Bitext Maps and Alignment via Pattern Recognition (1999)
Cached
Download Links
- [acl.ldc.upenn.edu]
- [www.aclweb.org]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | Computational Linguistics |
| Citations: | 68 - 0 self |
BibTeX
@ARTICLE{Melamed99bitextmaps,
author = {I. Dan Melamed},
title = {Bitext Maps and Alignment via Pattern Recognition},
journal = {Computational Linguistics},
year = {1999},
volume = {25},
pages = {107--130}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This article advances the state of the art ofbitext mapping by formulating the problem in terms of pattern recognition. From this point of view, the success of a bitext mapping algorithm hinges on how well it performs three tasks: signal generation, noise filtering, and search. The Smooth Injective Map Recognizer (SIMR) algorithm presented here integrates innovative approaches to each of these tasks. Objective evaluation has shown that SIMR's accuracy is consistently high for language pairs as diverse as French/English and Korean/English. If necessary, S IMR's bitext maps can be efficiently converted into segment alignments using the Geometric Segment Alignment (GSA) algorithm, which is also presented here. SIMR has produced bitext maps for over 200 megabytes of French-English bitexts. GSA has converted these maps into alignments. Both the maps and the alignments are available from the Linguistic Data Consortium) 1.
