<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="de-la-higuera-oncina-2013-computing">
    <titleInfo>
        <title>Computing the Most Probable String with a Probabilistic Finite State Machine</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Colin</namePart>
        <namePart type="family">de la Higuera</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jose</namePart>
        <namePart type="family">Oncina</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2013-07</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Mark-Jan</namePart>
            <namePart type="family">Nederhof</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">St Andrews, Scotland</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <identifier type="citekey">de-la-higuera-oncina-2013-computing</identifier>
    <location>
        <url>https://aclanthology.org/W13-1801</url>
    </location>
    <part>
        <date>2013-07</date>
        <extent unit="page">
            <start>1</start>
            <end>8</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Computing the Most Probable String with a Probabilistic Finite State Machine
%A de la Higuera, Colin
%A Oncina, Jose
%Y Nederhof, Mark-Jan
%S Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
%D 2013
%8 July
%I Association for Computational Linguistics
%C St Andrews, Scotland
%F de-la-higuera-oncina-2013-computing
%U https://aclanthology.org/W13-1801
%P 1-8

Markdown (Informal)

[Computing the Most Probable String with a Probabilistic Finite State Machine](https://aclanthology.org/W13-1801) (de la Higuera & Oncina, FSMNLP 2013)

• Computing the Most Probable String with a Probabilistic Finite State Machine (de la Higuera & Oncina, FSMNLP 2013)

ACL

• Colin de la Higuera and Jose Oncina. 2013. Computing the Most Probable String with a Probabilistic Finite State Machine. In Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pages 1–8, St Andrews, Scotland. Association for Computational Linguistics.