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

This is an internal preview of the ACL Anthology that may be incomplete and contain mistakes. Do not treat this content as an official publication.

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

Naohiko Uramoto

Anthology ID:: C94-2114
Volume:: COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics
Month:
Year:: 1994
Address:
Venue:: COLING
SIG:
Publisher:
Note:
Pages:
Language:
URL:: https://aclanthology.org/C94-2114
DOI:
Bibkey:
Cite (ACL):: Naohiko Uramoto. 1994. A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation. In COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics.
Cite (Informal):: A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation (Uramoto, COLING 1994)
Copy Citation:
PDF:: https://preview.aclanthology.org/nschneid-patch-3/C94-2114.pdf