Edge-Based Best-First Chart Parsing

Natural language grammars are often very large and full of ambiguities, making standard computer parsers too slow to be practical for many tasks. Best-first parsing attempts to address this problem by preferentially working to expand subparses that are judged ``good'''' by some probabilistic figure of merit. We explain the standard non-probabilistic and best-first chart parsing paradigms, then describe a new method of best-first parsing which improves upon previous work by ranking subparses at a more fine-grained level, speeding up parsing by approximately a factor of 20 over the best previous results. Moreover, these results are achieved with a higher level of accuracy than is obtained by parsing to exhaustion.

[1]  B. Lang Deterministic Techniques for Efficient Non-Deterministic Parsers , 1974, ICALP.

[2]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[3]  Martin Kay,et al.  Algorithm schemata and data structures in syntactic processing , 1986 .

[4]  Ralph Grishman,et al.  Statistical Parsing of Messages , 1990, HLT.

[5]  Bernard Lang,et al.  Towards a Uniform Formal Framework for Parsing , 1991 .

[6]  Robert J. Bobrow Statistical Agenda Parsing , 1991, HLT.

[7]  Mitchell P. Marcus,et al.  Parsing the Voyager Domain Using Pearl , 1991, HLT.

[8]  Fred Kochman,et al.  Calculating the Probability of a Partial Parse of a Sentence , 1991, HLT.

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

[10]  Scott Miller,et al.  Automatic Grammar Acquisition , 1994, HLT.

[11]  David M. Magerman Statistical Decision-Tree Models for Parsing , 1995, ACL.

[12]  Eugene Charniak,et al.  Figures of Merit for Best-First Probabilistic Chart Parsing , 1998, Comput. Linguistics.

[13]  Joshua Goodman,et al.  Parsing Algorithms and Metrics , 1996, ACL.

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

[15]  Eugene Charniak,et al.  Statistical Parsing with a Context-Free Grammar and Word Statistics , 1997, AAAI/IAAI.

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

[17]  Joshua Goodman,et al.  Global Thresholding and Multiple-Pass Parsing , 1997, EMNLP.

[18]  Klaas Sikkel,et al.  Parsing of Context-Free Languages , 1997, Handbook of Formal Languages.