Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a Large Annotated corpus of English: the Penn Treebank. Computational Linguistics 19(2), 313–330 (1993)
Ngai, G., Florian, R.: Transformation-Based Learning in the Fast Lane. In: North American Chapter of the Association for Computation Linguistics (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Delden, S. (2005). Simple But Useful Algorithms for Identifying Noun Phrase Complements of Embedded Clauses in a Partial Parse. In: Montoyo, A., Muńoz, R., Métais, E. (eds) Natural Language Processing and Information Systems. NLDB 2005. Lecture Notes in Computer Science, vol 3513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428817_36
Download citation
DOI: https://doi.org/10.1007/11428817_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26031-8
Online ISBN: 978-3-540-32110-1
eBook Packages: Computer ScienceComputer Science (R0)