Stochastic Tree-Adjoining Grammars

The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is defined and basic algorithms for SLTAG are designed. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexically sensitive (as N-gram models or Hidden Markov Models) and yet hierarchical (as stochastic context-free grammars). An algorithm for computing the probability of a sentence generated by a SLTAG is presented. Then, an iterative algorithm for estimating the parameters of a SLTAG given a training corpus is introduced.

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

[2]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[3]  Aaron D. Wyner,et al.  Prediction and Entropy of Printed English , 1993 .

[4]  David J. Weir,et al.  The convergence of mildly context-sensitive grammar formalisms , 1990 .

[5]  Aravind K. Joshi,et al.  Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.

[6]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[7]  Fernando Pereira,et al.  Inside-Outside Reestimation From Partially Bracketed Corpora , 1992, HLT.

[8]  Steve Young,et al.  Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .

[9]  Fletcher Pratt.  Secret and Urgent: The Story of Codes and Ciphers , 1939 .

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

[11]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, Annual Meeting of the Association for Computational Linguistics.

[12]  Aravind K. Joshi,et al.  An Introduction to Tree Adjoining Grammar , 1987 .

[13]  Claude E. Shannon,et al.  Prediction and Entropy of Printed English , 1951 .

[14]  Aravind K. Joshi,et al.  Tree-adjoining grammars and lexicalized grammars , 1992, Tree Automata and Languages.

[15]  Gerald Gazdar,et al.  Applicability of Indexed Grammars to Natural Languages , 1988 .

[16]  Taylor L. Booth,et al.  Probabilistic Representation of Formal Languages , 1969, SWAT.

[17]  Aravind K. Joshi,et al.  Mathematical and computational aspects of lexicalized grammars , 1990 .

[18]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, ACL.