Skip to main content

Unsupervised Method for Parsing Coordinated Base Noun Phrases

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

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

  • 1505 Accesses

Abstract

Syntactic parsing is an important processing step for various language processing applications including Information Extraction, Question Answering, and Machine Translation. Parsing base Noun Phrases is one particular parsing issue that is not handled by current state-of-the-art syntactic parsers. In this paper we present research that investigates the base Noun Phrase parsing problem. We develop a base Noun Phrase parser based on several statistical models that provide promising results on a test set of 538 base Noun Phrases. The parameters of the models are estimated from the web in the form of web counts. This makes our method unsupervised with no training data being needed.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Cao, Y., Li, H.: Base Noun Phrase Translation Using Web Data and the EM Algorithm. In: International Conference on Computational Linguistics (COLING) (2002)

    Google Scholar 

  2. Charniak, E.: Statistical Parsing with a context-free grammar and word statistics. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, AAAI Press, Menlo Park (1997)

    Google Scholar 

  3. Collins, M.: A New Statistical Parser Based on Bigram Lexical Dependencies. In: Proceedings of the 34th Annual Meeting of the ACL, Santa Cruz, CA (1996)

    Google Scholar 

  4. Daume III, H., Marcu, D.: NP Bracketing by Maximum Entropy Tagging and SVM Reranking. In: Proceedings of Empirical Methods in Natural Language Processing (2004)

    Google Scholar 

  5. Gildea, D.: Loosely Tree-Based Alignment for Machine Translation. In: Proceedings of the 41th Annual Conference of the Association for Computational Linguistics, Sapporo, Japan (2003)

    Google Scholar 

  6. Hobbs, J.R.: Information Extraction from Biomedical Text. In: Journal of Biomedical Informatics (2003)

    Google Scholar 

  7. Jurafsky, D., Martin, J.: Speech and Language Processing. Prentice-Hall, Englewood Cliffs (2000)

    Google Scholar 

  8. Keller, F., Lapata, M.: Using the Web to Obtain Frequencies for Unseen Bigrams. Computational Linguistics 29(3), 459–484 (2003)

    Article  Google Scholar 

  9. Krymolowski, Y., Dagan, I.: Compositional Memory-Based Partial Parsing. In: Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL), pp. 45–52 (2000)

    Google Scholar 

  10. Lappin, S., Leass, H.J.: An Algorithm for Pronominal Anaphora Resolution. Computational Linguistics 20(4), 535–561 (1994)

    Google Scholar 

  11. Magerman, D.M.: Natural Language Parsing as Statistical Pattern Recognition, PhD Thesis, Stanford University (February 1994)

    Google Scholar 

  12. Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a Large Annotated Corpus of English: The Penn Treebank. Computational Linguistics 19(2), 313–330 (1993)

    Google Scholar 

  13. Markham, J., Rus, V.: On the Implementation of a Baseline Part-of-Speech Tagger. In: Third Mid-South College Computing Conference (MSCCC-05), Oxford, Mississippi, April (2005)

    Google Scholar 

  14. Miller, G.A.: WordNet: a lexical database for English. Communications of the ACM 38(11), 39–41 (1995)

    Article  Google Scholar 

  15. Nakov, P., Hearst, M.: Search Engine Statistics Beyond the n-gram: Application to Noun Compound Bracketing. In: Proceedings of Ninth Conference on Computational Natural Language Learning, Ann Arbor, MI, June (2005)

    Google Scholar 

  16. Ramshaw, L.A., Marcus, M.P.: Text Chunking Using Transformation-Based Learning. In: Proceedings of the Third Workshop on Very Large Corpora, Cambridge, MA, USA (1995)

    Google Scholar 

  17. Rus, V.: High Precision Logic Form Transformation. In: International Conference on Tools with Artificial Intelligence (ICTAI), Dallas, TX, November (2001)

    Google Scholar 

  18. Rus, V., Moldovan, D.I., Bolohan, O.: Bracketing Compound Nouns for Logic Form Derivation. In: Proceedings of the FLAIRS 2002 Conference, Pensacola, Florida, May (2002)

    Google Scholar 

  19. Sang, T.K., Erik, F.: Noun Phrase Recognition by System Combination. In: Proceedings of ANLP-NAACL 2000, Seattle, Washington, USA, pp. 50–55. Morgan Kaufmann Publishers, San Francisco (2000)

    Google Scholar 

  20. Voorhees, E.: Overview of the TREC 2002 Question Answering Track. In: Proceedings of the Eleventh Text Retrieval Conference (TREC 2002) (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexander Gelbukh

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rus, V., Ravi, S., Lintean, M.C., McCarthy, P.M. (2007). Unsupervised Method for Parsing Coordinated Base Noun Phrases. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2007. Lecture Notes in Computer Science, vol 4394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70939-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70939-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70938-1

  • Online ISBN: 978-3-540-70939-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics