Automatic Construction of Clean Broad-Coverage Translation Lexicons
| dc.creator | Melamed, I. Dan | |
| dc.date | 1996-08-01 | |
| dc.date.accessioned | 2026-07-07T09:10:34Z | |
| dc.date.available | 2026-07-07T09:10:34Z | |
| dc.description | Word-level translational equivalences can be extracted from parallel texts by surprisingly simple statistical techniques. However, these techniques are easily fooled by {\em indirect associations} --- pairs of unrelated words whose statistical properties resemble those of mutual translations. Indirect associations pollute the resulting translation lexicons, drastically reducing their precision. This paper presents an iterative lexicon cleaning method. On each iteration, most of the remaining incorrect lexicon entries are filtered out, without significant degradation in recall. This lexicon cleaning technique can produce translation lexicons with recall and precision both exceeding 90\%, as well as dictionary-sized translation lexicons that are over 99\% correct. | |
| dc.description | PostScript file, 10 pages. To appear in Proceedings of AMTA-96 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9607037 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9607037 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151384 | |
| dc.subject | Computation and Language | |
| dc.title | Automatic Construction of Clean Broad-Coverage Translation Lexicons | |
| dc.type | text |