论文信息 - A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation

A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation

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.

Naohiko Uramoto

[1] Paul Procter,et al. Longman Dictionary of Contemporary English , 1978 .

[2] Makoto Nagao,et al. A framework of a mechanical translation between Japanese and English by analogy principle , 1984 .

[3] Katashi Nagao. Dependency Analyzer: A Knowledge-Based Approach to Structural Disambiguation , 1990, COLING.

[4] W. T. McLeod. The new Collins thesaurus , 1984 .

[5] Satoshi Sato,et al. Toward Memory-based Translation , 1990, COLING.

[6] Naohiko Uramoto. Example-Based Word-Sense Disambiguation , 1994 .