Editor for this issue: <>
Computational Intelligence special issue on NLG in the recent Linguist-List entry 3.92 (Publications of Interest). Single copies of the special issue may be orderedMail to author|Respond to list|Read more issues|LINGUIST home page|Top of issueUS$17.50 per copy from: National Research Council of Canada Research Journals Subscriptions Office, Attn: Ms.Joan Hill Ottawa ON K1A 0R6 Cheques/money orders are to be made out to: National Research Council of Canada Please mention with your order: COMPUTATIONAL INTELLIGENCE, Special Issue on NLG, 7(4), 1991.
It is probably worth pointing out that the two proposals for "reverse sorting" a wordlist: (A) rev|sort|rev [contributed by timMail to author|Respond to list|Read more issues|LINGUIST home page|Top of issuecanon.co.uk (Tim F O'Donoghue)]; and (B) sort -r applied to a sorted, uniq'ed wordlist [contributed by Martin Wynne <LNP5MW
cms1.leeds.ac.uk>] differ in substance. For example, if (A) is applied to a file that contains ax axa axb it returns axa axb ax while if (B) is applied to the same file, it returns axb axa ax The -r option for sort reverses sort's collating sequence; it has no effect on the sequence of characters within each word. The (A) method seems to be what the author of the awk script [Chris Culy <cculy
vaxa.weeg.uiowa.edu>] had in mind by "reverse sort," but I would expect rev to run considerably faster than any equivalent awk script. Will Dowling (will
franklin.com)