A best-match algorithm for broad-coverage example-based disambiguation

Naohiko Uramoto · 1994

To improve the coverage of example-bases, two methods are introduced into the best-match algorithm. The first is for acquiring conjunctive relationships from corpora, as measures of word similarity that can be used in addition to thesauruses. The Second, used when a word does not appear in an example-base or a thesaurus, is for inferring links to words in the example-base by comparing the usage of the word in the text and that of words in the example-base.

Read the paper · More papers on PaperTik