Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars

While O(n) methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies, has not yet been provided. This paper presents such an algorithm, and shows its correctness and advantages over prior work. The paper finishes by bringing out the connections between the algorithm and work on hypergraphs, which permits us to extend the presented Viterbi (best parse) algorithm to an inside (total probability) algorithm.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

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

[4]  Martin Kay,et al.  The MIND System , 1970 .

[5]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[6]  J. Baker.  Trainable grammars for speech recognition , 1979 .

[7]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[8]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

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

[10]  Chris Mellish,et al.  Natural Language Processing in PROLOG , 1989 .

[11]  Julian Kupiec.  A Trellis-Based Algorithm For Estimating The Parameters Of Hidden Stochastic Context-Free Grammar , 1991, HLT.

[12]  Frederick Jelinek,et al.  Basic Methods of Probabilistic Context Free Grammars , 1992 .

[13]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[14]  Stuart M. Shieber,et al.  Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[15]  Andreas Stolcke,et al.  An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities , 1994, CL.

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

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

[18]  Jean-Cédric Chappelier,et al.  A Generalized CYK Algorithm for Parsing Stochastic CFG , 1998, TAPD.

[19]  Joshua Goodman,et al.  Parsing Inside-Out , 1998, ArXiv.

[20]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .