A Portable Algorithm for Mapping Bitext Correspondence
<|reference_start|>A Portable Algorithm for Mapping Bitext Correspondence: The first step in most empirical work in multilingual NLP is to construct maps of the correspondence between texts and their translations ({\bf bitext maps}). The Smooth Injective Map Recognizer (SIMR) algorithm presented here is a generic pattern recognition algorithm that is particularly well-suited to mapping bitext correspondence. SIMR is faster and significantly more accurate than other algorithms in the literature. The algorithm is robust enough to use on noisy texts, such as those resulting from OCR input, and on translations that are not very literal. SIMR encapsulates its language-specific heuristics, so that it can be ported to any language pair with a minimal effort.<|reference_end|>
@article{melamed1997a,
    title={A Portable Algorithm for Mapping Bitext Correspondence},
    author={I. Dan Melamed (University of Pennsylvania)},
    journal={Proceedings of the 35th Conference of the Association for
  Computational Linguistics (ACL'97), Madrid, Spain, 1997.},
    year={1997},
    archivePrefix={arXiv},
    eprint={cmp-lg/9706025},
    primaryClass={cmp-lg cs.CL}
}