Publikation:

Towards Identifying Hindi/Urdu Noun Templates in Support of a Large-Scale LFG Grammar

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2014

Autor:innen

Vaidya, Ashwini

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Linguistik: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

CHRISTIAN BOITET ..., , ed.. COLING 2014: the 25th International Conference on Computational Linguistics ; Proceedings of the Conference ; the 5th Workshop on South and Southeast Asian NLP, WSSANLP 2014. Dublin: Association for Computational Linguistics and Dublin City University, 2014, pp. 1-10. ISBN 978-1-873769-41-6

Zusammenfassung

Complex predicates (CPs) are a highly productive predicational phenomenon in Hindi and Urdu and present a challenge for deep syntactic parsing. For CPs, a combination of a noun and light verb express a single event. The combinatorial preferences of nouns with one (or more) light verb is useful for predicting an instance of a CP. In this paper, we present a semi-automatic method to obtain noun groups based on their co-occurrences with light verbs. These noun groups represent the likelihood of a particular noun-verb combination in a large corpus. Finally, in order to encode this in an LFG grammar, we propose linking nouns with templates that describe preferable combinations with light verbs.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
400 Sprachwissenschaft, Linguistik

Schlagwörter

Konferenz

COLING 2014 : 25th International Confernce on Computational Linguistics, 23. Aug. 2014 - 29. Aug. 2014, Dublin, Irland
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690SULGER, Sebastian, Ashwini VAIDYA, 2014. Towards Identifying Hindi/Urdu Noun Templates in Support of a Large-Scale LFG Grammar. COLING 2014 : 25th International Confernce on Computational Linguistics. Dublin, Irland, 23. Aug. 2014 - 29. Aug. 2014. In: CHRISTIAN BOITET ..., , ed.. COLING 2014: the 25th International Conference on Computational Linguistics ; Proceedings of the Conference ; the 5th Workshop on South and Southeast Asian NLP, WSSANLP 2014. Dublin: Association for Computational Linguistics and Dublin City University, 2014, pp. 1-10. ISBN 978-1-873769-41-6
BibTex
@inproceedings{Sulger2014Towar-30031,
  year={2014},
  title={Towards Identifying Hindi/Urdu Noun Templates in Support of a Large-Scale LFG Grammar},
  url={http://aclweb.org/anthology/W/W14/W14-5501.pdf},
  isbn={978-1-873769-41-6},
  publisher={Association for Computational Linguistics and Dublin City University},
  address={Dublin},
  booktitle={COLING 2014: the 25th International Conference on Computational Linguistics ; Proceedings of the Conference ; the 5th Workshop on South and Southeast Asian NLP, WSSANLP 2014},
  pages={1--10},
  editor={Christian Boitet ...},
  author={Sulger, Sebastian and Vaidya, Ashwini}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/30031">
    <dc:contributor>Sulger, Sebastian</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-25T09:19:27Z</dcterms:available>
    <dc:creator>Vaidya, Ashwini</dc:creator>
    <dc:contributor>Vaidya, Ashwini</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:creator>Sulger, Sebastian</dc:creator>
    <dcterms:issued>2014</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-25T09:19:27Z</dc:date>
    <dcterms:abstract xml:lang="eng">Complex predicates (CPs) are a highly productive predicational phenomenon in Hindi and Urdu and present a challenge for deep syntactic parsing. For CPs, a combination of a noun and light verb express a single event. The combinatorial preferences of nouns with one (or more) light verb is useful for predicting an instance of a CP. In this paper, we present a semi-automatic method to obtain noun groups based on their co-occurrences with light verbs. These noun groups represent the likelihood of a particular noun-verb combination in a large corpus. Finally, in order to encode this in an LFG grammar, we propose linking nouns with templates that describe preferable combinations with light verbs.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30031"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
    <dcterms:title>Towards Identifying Hindi/Urdu Noun Templates in Support of a Large-Scale LFG Grammar</dcterms:title>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.
http://aclweb.org/anthology/W/W14/W14-5501.pdf

Prüfdatum der URL

2015-02-25

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen