<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="brooke-etal-2017-unsupervised">
    <titleInfo>
        <title>Unsupervised Acquisition of Comprehensive Multiword Lexicons using Competition in an n-gram Lattice</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Julian</namePart>
        <namePart type="family">Brooke</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jan</namePart>
        <namePart type="family">Šnajder</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Timothy</namePart>
        <namePart type="family">Baldwin</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>We present a new model for acquiring comprehensive multiword lexicons from large corpora based on competition among n-gram candidates. In contrast to the standard approach of simple ranking by association measure, in our model n-grams are arranged in a lattice structure based on subsumption and overlap relationships, with nodes inhibiting other nodes in their vicinity when they are selected as a lexical item. We show how the configuration of such a lattice can be optimized tractably, and demonstrate using annotations of sampled n-grams that our method consistently outperforms alternatives by at least 0.05 F-score across several corpora and languages.</abstract>
    <identifier type="citekey">brooke-etal-2017-unsupervised</identifier>
    <identifier type="doi">10.1162/tacl_a_00073</identifier>
    <location>
        <url>https://aclanthology.org/Q17-1032</url>
    </location>
    <part>
        <date>2017</date>
        <detail type="volume"><number>5</number></detail>
        <extent unit="page">
            <start>455</start>
            <end>470</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Unsupervised Acquisition of Comprehensive Multiword Lexicons using Competition in an n-gram Lattice
%A Brooke, Julian
%A Šnajder, Jan
%A Baldwin, Timothy
%J Transactions of the Association for Computational Linguistics
%D 2017
%V 5
%I MIT Press
%C Cambridge, MA
%F brooke-etal-2017-unsupervised
%X We present a new model for acquiring comprehensive multiword lexicons from large corpora based on competition among n-gram candidates. In contrast to the standard approach of simple ranking by association measure, in our model n-grams are arranged in a lattice structure based on subsumption and overlap relationships, with nodes inhibiting other nodes in their vicinity when they are selected as a lexical item. We show how the configuration of such a lattice can be optimized tractably, and demonstrate using annotations of sampled n-grams that our method consistently outperforms alternatives by at least 0.05 F-score across several corpora and languages.
%R 10.1162/tacl_a_00073
%U https://aclanthology.org/Q17-1032
%U https://doi.org/10.1162/tacl_a_00073
%P 455-470

Markdown (Informal)

[Unsupervised Acquisition of Comprehensive Multiword Lexicons using Competition in an n-gram Lattice](https://aclanthology.org/Q17-1032) (Brooke et al., TACL 2017)

• Unsupervised Acquisition of Comprehensive Multiword Lexicons using Competition in an n-gram Lattice (Brooke et al., TACL 2017)

ACL

• Julian Brooke, Jan Šnajder, and Timothy Baldwin. 2017. Unsupervised Acquisition of Comprehensive Multiword Lexicons using Competition in an n-gram Lattice. Transactions of the Association for Computational Linguistics, 5:455–470.