|
|
1.1 root 1: Path and Ambiguous Word finder and regular expression matcher.
2:
3: source file small.c, binary data thes.packed
4: + regular expression routines reg*.[ch]
5:
6: command: small thesaurusfile
7:
8: repertoire:
9:
10: word gives entry for all senses
11: &3word gives entry for sense 3 of word
12: &n.word gives noun entries for word
13:
14: word1^word2 finds shortest paths from each sense
15: of word1 to some sense of word2
16:
17: both word1 and word2 may also have the &3... form or the &n.... form.
18:
19: /reg expression/ lists all headwords satisfying
20: the regular expression
21:
22: word^/regular expression/ N finds the N nearest headwords
23: matching reg expr. to a start
24: word, sense, or sense-set 'word'
25: N default = 10
26:
27: ambiguous word^word finds ``word clout'' word with
28: the given ambiguity. check
29: with 'word^word' that the
30: direct path is not as good,
31: the program can't detect this.
32: turned off by undefining AMBIGUOUS.
33:
34: binary file is 760K bytes of Huffman-coded data
35: run-time memory is about 2.3 MB
36:
37: reg expressions by presotto
38: rev. 4/5/89
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.