Simple But Useful Algorithms for Identifying Noun Phrase Complements of Embedded Clauses in a Partial Parse

  • Sebastian van Delden
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3513)


Two algorithms for identifying noun phrase complements of embedded clauses in a partial parse are presented. The candidate noun phrases play subject or object roles in (reduced) relative and infinitival clauses. The algorithms are tested on several sources and results are presented.


Noun Phrase Natural Language Processing Relative Clause Embed Clause Input Sentence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a Large Annotated corpus of English: the Penn Treebank. Computational Linguistics 19(2), 313–330 (1993)Google Scholar
  2. 2.
    Ngai, G., Florian, R.: Transformation-Based Learning in the Fast Lane. In: North American Chapter of the Association for Computation Linguistics (2001)Google Scholar
  3. 3.
    van Delden, S., Gomez, F.: Cascaded Finite-State Partial Parsing: A Larger-First Approach. In: Recent Advances in Natural Language Processing III: Selected Papers from RANLP 2003. Current Issues in Linguistic Theory (CILT) Book Series, vol. 260, pp. 402–410. John Benjamin Publishers, Amsterdam (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sebastian van Delden
    • 1
  1. 1.Division of Mathematics and Computer ScienceUniversity of South Carolina UpstateSpartanburgUSA

Personalised recommendations