<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="xu-lapata-2019-weakly">
    <titleInfo>
        <title>Weakly Supervised Domain Detection</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Yumo</namePart>
        <namePart type="family">Xu</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Mirella</namePart>
        <namePart type="family">Lapata</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019</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>In this paper we introduce domain detection as a new natural language processing task. We argue that the ability to detect textual segments that are domain-heavy (i.e., sentences or phrases that are representative of and provide evidence for a given domain) could enhance the robustness and portability of various text classification applications. We propose an encoder-detector framework for domain detection and bootstrap classifiers with multiple instance learning. The model is hierarchically organized and suited to multilabel classification. We demonstrate that despite learning with minimal supervision, our model can be applied to text spans of different granularities, languages, and genres. We also showcase the potential of domain detection for text summarization.</abstract>
    <identifier type="citekey">xu-lapata-2019-weakly</identifier>
    <identifier type="doi">10.1162/tacl_a_00287</identifier>
    <location>
        <url>https://aclanthology.org/Q19-1037</url>
    </location>
    <part>
        <date>2019</date>
        <detail type="volume"><number>7</number></detail>
        <extent unit="page">
            <start>581</start>
            <end>596</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Weakly Supervised Domain Detection
%A Xu, Yumo
%A Lapata, Mirella
%J Transactions of the Association for Computational Linguistics
%D 2019
%V 7
%I MIT Press
%C Cambridge, MA
%F xu-lapata-2019-weakly
%X In this paper we introduce domain detection as a new natural language processing task. We argue that the ability to detect textual segments that are domain-heavy (i.e., sentences or phrases that are representative of and provide evidence for a given domain) could enhance the robustness and portability of various text classification applications. We propose an encoder-detector framework for domain detection and bootstrap classifiers with multiple instance learning. The model is hierarchically organized and suited to multilabel classification. We demonstrate that despite learning with minimal supervision, our model can be applied to text spans of different granularities, languages, and genres. We also showcase the potential of domain detection for text summarization.
%R 10.1162/tacl_a_00287
%U https://aclanthology.org/Q19-1037
%U https://doi.org/10.1162/tacl_a_00287
%P 581-596

Markdown (Informal)

[Weakly Supervised Domain Detection](https://aclanthology.org/Q19-1037) (Xu & Lapata, TACL 2019)

• Weakly Supervised Domain Detection (Xu & Lapata, TACL 2019)

ACL

• Yumo Xu and Mirella Lapata. 2019. Weakly Supervised Domain Detection. Transactions of the Association for Computational Linguistics, 7:581–596.