<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="choudhury-etal-2007-difficult">
    <titleInfo>
        <title>How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Monojit</namePart>
        <namePart type="family">Choudhury</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Markose</namePart>
        <namePart type="family">Thomas</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Animesh</namePart>
        <namePart type="family">Mukherjee</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Anupam</namePart>
        <namePart type="family">Basu</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Niloy</namePart>
        <namePart type="family">Ganguly</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2007</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Chris</namePart>
            <namePart type="family">Biemann</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Irina</namePart>
            <namePart type="family">Matveeva</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Rada</namePart>
            <namePart type="family">Mihalcea</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Dragomir</namePart>
            <namePart type="family">Radev</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Rochester, NY, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <identifier type="citekey">choudhury-etal-2007-difficult</identifier>
    <location>
        <url>https://aclanthology.org/W07-0212/</url>
    </location>
    <part>
        <date>2007</date>
        <extent unit="page">
            <start>81</start>
            <end>88</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach
%A Choudhury, Monojit
%A Thomas, Markose
%A Mukherjee, Animesh
%A Basu, Anupam
%A Ganguly, Niloy
%Y Biemann, Chris
%Y Matveeva, Irina
%Y Mihalcea, Rada
%Y Radev, Dragomir
%S Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing
%D 2007
%I Association for Computational Linguistics
%C Rochester, NY, USA
%F choudhury-etal-2007-difficult
%U https://aclanthology.org/W07-0212/
%P 81-88

Markdown (Informal)

[How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach](https://aclanthology.org/W07-0212/) (Choudhury et al., TextGraphs 2007)

• How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach (Choudhury et al., TextGraphs 2007)

ACL

• Monojit Choudhury, Markose Thomas, Animesh Mukherjee, Anupam Basu, and Niloy Ganguly. 2007. How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach. In Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing, pages 81–88, Rochester, NY, USA. Association for Computational Linguistics.