<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="koehn-senellart-2010-fast">
    <titleInfo>
        <title>Fast Approximate String Matching with Suffix Arrays and A* Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Philipp</namePart>
        <namePart type="family">Koehn</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jean</namePart>
        <namePart type="family">Senellart</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2010-oct&quot; 31-&quot;nov&quot; 4&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Machine Translation in the Americas</publisher>
            <place>
                <placeTerm type="text">Denver, Colorado, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We present a novel exact solution to the approximate string matching problem in the context of translation memories, where a text segment has to be matched against a large corpus, while allowing for errors. We use suffix arrays to detect exact n-gram matches, A* search heuristics to discard matches and A* parsing to validate candidate segments. The method outperforms the canonical baseline by a factor of 100, with average lookup times of 4.3–247ms for a segment in a realistic scenario.</abstract>
    <identifier type="citekey">koehn-senellart-2010-fast</identifier>
    <location>
        <url>https://aclanthology.org/2010.amta-papers.2</url>
    </location>
    <part>
        <date>2010-oct&quot; 31-&quot;nov&quot; 4&quot;</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Fast Approximate String Matching with Suffix Arrays and A* Parsing
%A Koehn, Philipp
%A Senellart, Jean
%S Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers
%D 2010
%8 oct" 31 "nov" 4"
%I Association for Machine Translation in the Americas
%C Denver, Colorado, USA
%F koehn-senellart-2010-fast
%X We present a novel exact solution to the approximate string matching problem in the context of translation memories, where a text segment has to be matched against a large corpus, while allowing for errors. We use suffix arrays to detect exact n-gram matches, A* search heuristics to discard matches and A* parsing to validate candidate segments. The method outperforms the canonical baseline by a factor of 100, with average lookup times of 4.3–247ms for a segment in a realistic scenario.
%U https://aclanthology.org/2010.amta-papers.2

Markdown (Informal)

[Fast Approximate String Matching with Suffix Arrays and A* Parsing](https://aclanthology.org/2010.amta-papers.2) (Koehn & Senellart, AMTA 2010)

• Fast Approximate String Matching with Suffix Arrays and A* Parsing (Koehn & Senellart, AMTA 2010)

ACL

• Philipp Koehn and Jean Senellart. 2010. Fast Approximate String Matching with Suffix Arrays and A* Parsing. In Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers, Denver, Colorado, USA. Association for Machine Translation in the Americas.