1887
Volume 16, Issue 1
  • ISSN 0019-0829
  • E-ISSN: 1783-1490
USD
Buy:$35.00 + Taxes

Abstract

Alphabetical sorting routines useful in processing natural language texts are explored in this article. Four basic algorithms (Bin, Bubble, Tree and Chain sorts) and five SNOBOL implementations of these algorithms are discussed. In addition, the authors deal with problems of program-defined special character sets and sorting orders diverging from standard machine collating sequence, as well as questions of producing reverse-alphabetized word lists. Comparative running times for these programs on representative corpora of varying sizes are tabulated and compared. For those readers unfamiliar with SNOBOL, the article offers a brief introduction to the language sufficient to allow understanding of these and many other SNOBOL programs. Thus the programmer who works with other languages can both familiarize himself with SNOBOL, and at the same time learn enough to translate the sort programs into his usual language. Reference is also made to SPITBOL, a recently developed high-speed compiler for SNOBOL.

Loading

Article metrics loading...

/content/journals/10.1075/itl.16.01jon
2016-12-23
2019-09-17
Loading full text...

Full text loading...

References

  1. Dewar, Robert B.K.
    «SPITBOL». Document of the Illinois Institute of Technology. February 12, 1971.
    [Google Scholar]
  2. Griswold, R.E.
    et al., The SNOBOL4 Programming Language. Engelwood Cliffs: Prentice-Hall 1971.
    [Google Scholar]
  3. Martin, William A.
    , «Sorting». Computing Surveys3 (1971): 147–74.
    [Google Scholar]
http://instance.metastore.ingenta.com/content/journals/10.1075/itl.16.01jon
Loading
  • Article Type: Research Article
This is a required field
Please enter a valid email address
Approval was successful
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error