Simple but useful algorithms for identifying noun phrase complements of embedded clauses in a partial parse

Authors:
Sebastian van Delden
Affiliations:
Division of Mathematics and Computer Science, University of South Carolina Upstate, Spartanburg, SC
Venue:
NLDB'05 Proceedings of the 10th international conference on Natural Language Processing and Information Systems
Year:
2005

Citing 2
Cited 0

Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
Transformation-based learning in the fast lane

NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies

Quantified Score

Hi-index	0.01

Visualization

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.