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

  • Authors:
  • Naohiko Uramoto

  • Affiliations:
  • IBM Research, Tokyo Research Laboratory, Kanagawa-ken, Japan

  • Venue:
  • COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.