Constituency parsing of complex noun sequences in hindi

dc.contributor.author Batra, Arpita
dc.contributor.author Paul, Soma
dc.contributor.author Kulkarni, Amba
dc.date.accessioned 2022-03-27T02:01:59Z
dc.date.available 2022-03-27T02:01:59Z
dc.date.issued 2014-01-01
dc.description.abstract A complex noun sequence is one in which a head noun is recursively modified by one or more bare nouns and/or genitives Constituency analysis of complex noun sequence is a prerequisite for finding dependency relation (semantic relation) between components of the sequence. Identification of dependency relation is useful for various applications such as question answering, information extraction, textual entailment, paraphrasing. In Hindi, syntactic agreement rules can handle to a large extent the parsing of recursive genitives (Sharma, 2012)[12].This paper implements frequency based corpus driven approaches for parsing recursive genitive structures that syntactic rules cannot handle as well as recursive compound nouns and combination of gentive and compound noun sequences. Using syntactic rules and dependency global algorithm, an accuracy of 92.85% is obtained. © 2014 Springer-Verlag Berlin Heidelberg.
dc.identifier.citation Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.8403 LNCS(PART 1)
dc.identifier.issn 03029743
dc.identifier.uri 10.1007/978-3-642-54906-9_23
dc.identifier.uri http://link.springer.com/10.1007/978-3-642-54906-9_23
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/4503
dc.subject bracketing
dc.subject complex noun sequence
dc.subject compound noun
dc.subject constituency parsing
dc.subject genitives
dc.title Constituency parsing of complex noun sequences in hindi
dc.type Book Series. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: