Computation of Infix Probabilities for Probabilistic Context-Free Grammars

The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction. For the case where a probabilistic context-free grammar is used as language model, methods for the computation of infix probabilities have been presented in the literature, based on various simplifying assumptions. Here we present a solution that applies to the problem in its full generality.

[1]  Michael Luttenberger,et al.  On the convergence of Newton's method for monotone systems of polynomial equations , 2007, STOC '07.

[2]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[3]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[4]  Fernando Pereira,et al.  Relating Probabilistic Grammars and Automata , 1999, ACL.

[5]  Giorgio Satta,et al.  Computation of Probabilities for an Island-Driven Parser , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[7]  Ana L. N. Fred,et al.  Computation of Substring Probabilities in Stochastic Grammars , 2000, ICGI.

[8]  Zhiyi Chi,et al.  Estimation of Probabilistic Context-Free Grammars , 1998, Comput. Linguistics.

[9]  Matteo Comin,et al.  Conservative extraction of over-represented extensible motifs , 2005, ISMB.

[10]  Zhiyi Chi,et al.  Statistical Properties of Probabilistic Context-Free Grammars , 1999, CL.

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

[12]  John D. Lafferty,et al.  Computation of the Probability of Initial Substring Generation by Stochastic Context-Free Grammars , 1991, Comput. Linguistics.

[13]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

[14]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[15]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

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

[17]  Philip Resnik,et al.  Probabilistic Tree-Adjoining Grammar as a Framework for Statistical Natural Language Processing , 1992, COLING.

[18]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[19]  Giorgio Satta,et al.  Computing Partition Functions of PCFGs , 2009, Research on Language and Computation.

[20]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[21]  Joan-Andreu Sánchez,et al.  Consistency of Stochastic Context-Free Grammars From Probabilistic Estimation Based on Growth Transformations , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[23]  King-Sun Fu,et al.  Sequential classification of strings generated by SCFG's , 1975, International Journal of Computer & Information Sciences.

[24]  Yves Schabes,et al.  Stochastic Lexicalized Tree-adjoining Grammars , 1992, COLING.

[25]  Giorgio Satta,et al.  Probabilistic Parsing as Intersection , 2003, IWPT.

[26]  No Value,et al.  40th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference , 2002 .

[27]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .