Paper: A Best-Match Algorithm For Broad-Coverage Example-Based Disambiguation

ACL ID C94-2114
Title A Best-Match Algorithm For Broad-Coverage Example-Based Disambiguation
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
Authors

To improve tit('. coverage of examl)le-bases, two nlethods are introduced into the 1)est-match algo- rithm. The first is for acquiring conjunctive rela- tionships fl'om corpora, as measures of word simi- larity that can be used in addition to thesauruses. The Second, used when a word does not appear in an examltled)asc or a thesaurus, is for inferring links to words in the examph>base by ('mnparing the us- age of the word in the text ~md that of words in the example- base.