<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="patel-bhattacharyya-2018-iterative">
    <titleInfo>
        <title>An Iterative Approach for Unsupervised Most Frequent Sense Detection using WordNet and Word Embeddings</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Kevin</namePart>
        <namePart type="family">Patel</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Pushpak</namePart>
        <namePart type="family">Bhattacharyya</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-01</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 9th Global Wordnet Conference</title>
        </titleInfo>
        <originInfo>
            <publisher>Global Wordnet Association</publisher>
            <place>
                <placeTerm type="text">Nanyang Technological University (NTU), Singapore</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Given a word, what is the most frequent sense in which it occurs in a given corpus? Most Frequent Sense (MFS) is a strong baseline for unsupervised word sense disambiguation. If we have large amounts of sense-annotated corpora, MFS can be trivially created. However, sense-annotated corpora are a rarity. In this paper, we propose a method which can compute MFS from raw corpora. Our approach iteratively exploits the semantic congruity among related words in corpus. Our method performs better compared to another similar work.</abstract>
    <identifier type="citekey">patel-bhattacharyya-2018-iterative</identifier>
    <location>
        <url>https://aclanthology.org/2018.gwc-1.34</url>
    </location>
    <part>
        <date>2018-01</date>
        <extent unit="page">
            <start>293</start>
            <end>297</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An Iterative Approach for Unsupervised Most Frequent Sense Detection using WordNet and Word Embeddings
%A Patel, Kevin
%A Bhattacharyya, Pushpak
%S Proceedings of the 9th Global Wordnet Conference
%D 2018
%8 January
%I Global Wordnet Association
%C Nanyang Technological University (NTU), Singapore
%F patel-bhattacharyya-2018-iterative
%X Given a word, what is the most frequent sense in which it occurs in a given corpus? Most Frequent Sense (MFS) is a strong baseline for unsupervised word sense disambiguation. If we have large amounts of sense-annotated corpora, MFS can be trivially created. However, sense-annotated corpora are a rarity. In this paper, we propose a method which can compute MFS from raw corpora. Our approach iteratively exploits the semantic congruity among related words in corpus. Our method performs better compared to another similar work.
%U https://aclanthology.org/2018.gwc-1.34
%P 293-297

Markdown (Informal)

[An Iterative Approach for Unsupervised Most Frequent Sense Detection using WordNet and Word Embeddings](https://aclanthology.org/2018.gwc-1.34) (Patel & Bhattacharyya, GWC 2018)

• An Iterative Approach for Unsupervised Most Frequent Sense Detection using WordNet and Word Embeddings (Patel & Bhattacharyya, GWC 2018)

ACL

• Kevin Patel and Pushpak Bhattacharyya. 2018. An Iterative Approach for Unsupervised Most Frequent Sense Detection using WordNet and Word Embeddings. In Proceedings of the 9th Global Wordnet Conference, pages 293–297, Nanyang Technological University (NTU), Singapore. Global Wordnet Association.