<?xml version="1.0" standalone="yes"?>
<Paper uid="P97-1039">
  <Title>A Portable Algorithm for Mapping Bitext Correspondence</Title>
  <Section position="9" start_page="310" end_page="310" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> The Smooth Injective Map Recognizer (SIMR) bitext mapping algorithm advances the state of the art on several frontiers. It is significantly more accurate than other algorithms in the literature. Its expected running time and memory requirements are linear in the size of the input, which makes it the algorithm of choice for very large bitexts.</Paragraph>
    <Paragraph position="1"> It is not fazed by word order differences. It does not rely on pre-segmented input and is portable to any pair of languages with a minimal effort. These features make SIMR the mostly widely applicable bitext mapping algorithm to date.</Paragraph>
    <Paragraph position="2"> SIMR opens up several new avenues of research.</Paragraph>
    <Paragraph position="3"> One important application of bitext maps is the construction of translation lexicons (Dagan et al., 1993) and, as discussed, translation lexicons are an important information source for bitext mapping. It is likely that the accuracy of both kinds of algorithms can be improved by alternating between the two on the same bitext. There are also plans to build an automatic bitext locating spider for the World Wide Web, so that SIMR can be applied to more new language pairs and bitext genres.</Paragraph>
  </Section>
class="xml-element"></Paper>