Skip to main content

Constituency Parsing of Complex Noun Sequences in Hindi

  • Conference paper
Computational Linguistics and Intelligent Text Processing (CICLing 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8403))

  • 2031 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chapter 9: Regular expressions, the Open Group Base Specifications Issue 6, IEEE Std 1003.1, 2004 Edition. The Open Group (2004)

    Google Scholar 

  2. Hindi dependency treebank, workshop on MT and Parsing in Indian Languages. 24th International Conference on Computational Linguistics (2012)

    Google Scholar 

  3. Girju, R., Maldovan, D., Tatu, M., Antohe, D.: On the semantics of noun compounds. Computer Speech and Language (2005)

    Google Scholar 

  4. Jaccard, P.: The distribution of the flora in the alpine zone. The New Phytologist (1912)

    Google Scholar 

  5. Kavuluru, R., Harris, D.: A knowledge-based approach to syntactic disambiguation of biomedical noun compounds. In: Proceedings of COLING (2012)

    Google Scholar 

  6. Kulkarni, A., Kumar, A.: Statistical constituency parser for sanskrit compounds. In: Proceedings of ICON (2011)

    Google Scholar 

  7. Kulkarni, A., Paul, S., Kulkarni, M., Kumar, A., Surtani, N.: Semantic processing of compounds in indian languages. In: Proceedings of COLING (2012)

    Google Scholar 

  8. Lapata, M., Keller, F.: Web-based models for natural language processing. ACM (2005)

    Google Scholar 

  9. Lauer, M.: Corpus statistics meet the noun compound: Some empirical results (1995)

    Google Scholar 

  10. Pecina, P.: Lexical association measures. Institute of Formal and Applied Linguistics (2009)

    Google Scholar 

  11. Pustejovsky, J., Bergler, S., Anick, P.: Lexical semantic techniques for corpus analysis. Association for Computational Linguistics (1993)

    Google Scholar 

  12. Sharma, S.: Disambiguating the parsing of hindi recursive genitive constructions, IIIT Hyderabad, India (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Batra, A., Paul, S., Kulkarni, A. (2014). Constituency Parsing of Complex Noun Sequences in Hindi. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2014. Lecture Notes in Computer Science, vol 8403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54906-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54906-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54905-2

  • Online ISBN: 978-3-642-54906-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics