Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers

Robustness in a parser refers to an ability to deal with exceptional phenomena. A parser is robust if it deals with phenomena outside its normal range of inputs. This paper reports on a series of robustness evaluations of state-of-the-art parsers in which we concentrated on one aspect of robustness: its ability to parse sentences containing misspelled words. We propose two measures for robustness evaluation based on a comparison of a parser's output for grammatical input sentences and their noisy counterparts. In this paper, we use these measures to compare the overall robustness of the four evaluated parsers, and we present an analysis of the decline in parser performance with increasing error levels. Our results indicate that performance typically declines tens of percentage units when parsers are presented with texts containing misspellings. When it was tested on our purpose-built test set of 443 sentences, the best parser in the experiment (C&C parser) was able to return exactly the same parse tree for the grammatical and ungrammatical sentences for 60.8%, 34.0% and 14.9% of the sentences with one, two or three misspelled words respectively.

[1]  Daniel Dominic Sleator,et al.  Parsing English with a Link Grammar , 1995, IWPT.

[2]  James R. Curran,et al.  Parsing the WSJ Using CCG and Log-Linear Models , 2004, ACL.

[3]  Geoffrey Sampson,et al.  English for the Computer: The SUSANNE Corpus and Analytic Scheme , 1995, Computational Linguistics.

[4]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

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

[6]  Christopher D. Manning,et al.  Generating Typed Dependency Parses from Phrase Structure Parses , 2006, LREC.

[7]  Julia Hockenmaier,et al.  Data and models for statistical parsing with combinatory categorial grammar , 2003 .

[8]  Ola Knutsson,et al.  Unsupervised Evaluation of Parser Robustness , 2005, CICLing.

[9]  Geoffrey Sampson English for the computer , 1995 .

[10]  Ben Hutchinson,et al.  Intrinsic versus Extrinsic Evaluations of Parsing Systems , 2003 .

[11]  Joakim Nivre,et al.  Two Strategies for Text Parsing , 2006 .

[12]  Douglas E. Appelt,et al.  Robust Processing of Real-World Natural-Language Texts , 1992, ANLP.

[13]  Claus-Rainer Rollinger,et al.  KI-95: Advances in Artificial Intelligence , 1995, Lecture Notes in Computer Science.

[14]  Dan Klein,et al.  Accurate Unlexicalized Parsing , 2003, ACL.

[15]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[16]  Mark Steedman,et al.  The syntactic process , 2004, Language, speech, and communication.

[17]  Jennifer Foster,et al.  Parsing Ungrammatical Input: an Evaluation Procedure , 2004, LREC.

[18]  Taylor L. Booth,et al.  Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.

[19]  J. M. Cohen,et al.  Mexico City : México , 1965 .

[20]  Ted Briscoe,et al.  Parser evaluation: using a grammatical relation annotation scheme , 2003 .