Cascaded Grammatical Relation Assignment

In this paper we discuss cascaded Memory-Based grammatical relations assignment. In the first stages of the cascade, we find chunks of several types (NP,VP,ADJP,ADVP,PP) and label them with their adverbial function (e.g. local, temporal). In the last stage, we assign grammatical relations to pairs of chunks. We studied the effect of adding several levels to this cascaded classifier and we found that even the less performing chunkers enhanced the performance of the relation finder.

[1]  Steven Abney,et al.  Parsing By Chunks , 1991 .

[2]  Rens Bod,et al.  A Computational Model of Language Performance: Data Oriented Parsing , 1992, COLING.

[3]  Beatrice Santorini,et al.  Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.

[4]  Mitchell P. Marcus,et al.  Text Chunking using Transformation-Based Learning , 1995, VLC@ACL.

[5]  Walter Daelemans,et al.  MBT: A Memory-Based Part of Speech Tagger-Generator , 1996, VLC@COLING.

[6]  Walter Daelemans,et al.  Memory-Based Learning: Using Similarity for Smoothing , 1997, ACL.

[7]  Adwait Ratnaparkhi,et al.  A Linear Observed Time Statistical Parser Based on Maximum Entropy Models , 1997, EMNLP.

[8]  Michael Collins,et al.  Three Generative, Lexicalised Models for Statistical Parsing , 1997, ACL.

[9]  J. Veenstra,et al.  Fast NP Chunking using Memory-Based learning techniques , 1998 .

[10]  Ralph Grishman,et al.  Corpus-based Parsing and Sublanguage Studies , 1998 .

[11]  Wojciech Skut,et al.  Automation of Treebank Annotation , 1998, CoNLL.

[12]  Shlomo Argamon,et al.  A Memory-Based Approach to Learning Shallow Natural Language Patterns , 1998, ACL.

[13]  S. Buchholz,et al.  Distinguishing complements from adjuncts using memory-based learning , 1998 .

[14]  Erik F. Tjong Kim Sang,et al.  Representing Text Chunks , 1999, EACL.

[15]  Gregory Grefenstette.  Light parsing as finite state filtering , 1999 .

[16]  E. T. K. Sang.  Memory-Based Shallow Parsing , 2002, Journal of machine learning research.