Learning grammatical structure using statistical decision-trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1147, Issue , 1996, Pages 1-21

  Magerman, David M ^a  

^a Renaissance Technologies Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; SYNTACTICS;

ACCURACY RATE; DECISION TREE LEARNING; GRAMMAR DEVELOPMENT; GRAMMATICAL INFERENCES; GRAMMATICAL STRUCTURE; STATISTICAL DECISION TREE; STATISTICAL PARSER; STATISTICAL PATTERN;

DECISION TREES;

EID: 84958982834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033339     Document Type: Conference Paper

References (18)

1. L. R. Bahl, P. F. Brown, P. V. deSouza, and R. L. Mercer. 1989. A tree-based statistical language model for natural language speech recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. 36, No. 7, pages 1001-1008.
2. J. K. Baker. 1975. Stochastic modeling for automatic speech understanding. Speech Recognition, pages 521-542.
3. L. E. Baum. 1972. An inequality and associated maximization technique in statistical estimation of probabilistic functions of markov processes. Inequalities, Vol. 3, pages 1-8.
4. E. Black and et al. 1991. A procedure for quantitatively comparing the syntactic coverage of english grammars. Proceedings of the February 1991 DARPA Speech and Natural Language Workshop, pages 306-311.
5. E. Black, R. Garside, and G. Leech. 1993. Statistically-driven computer grammars of english: the ibm/lancaster approach. Rodopi, Atlanta, Georgia.
6. E. Black, J. Lafferty, and S. Roukos. 1992. Development and evaluation of a broad-coverage probabilistic grammar of english-language computer manuals. Proceedings of the Association for Computational Linguistics, 1992.
7. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth and Brooks, Pacific Grove, California.
8. P. F. Brown, V. Della Pietra, P. V. deSouza, J. C. Lai, and R. L. Mercer. 1992. “Class-based n-gram models of natural language.” Computational Linguistics, 18(4), pages 467-479.
9. G. Carroll and E. Charniak 1992. Learning probabilistic dependency grammars from labeled text. Working Notes, Fall Symposium Series, AAAI, pages 25-32.
10. F. Jelinek, J. Lafferty, D. M. Magerman, R. Mercer, A. Ratnapaxkhi, and S. Roukos. 1994. Decision tree parsing using a hidden derivation model. Proceedings of the 1994 Human Language Technology Workshop, pages 272-277.
11. F. Jelinek, J. D. Lafferty, and R. L. Mercer. 1992. Basic methods of probabilistic context-free grammars. Speech Recognition and Understanding: Recent Advances, Trends, and Applications. Proceedings of the NATO Advanced Study Institute, pages 345-360.
12. J. Kupiec. 1991. A trellis-based algorithm for estimating the parameters of a hidden stochastic context-free grammar. Proceedings of the February 1991 DARPA Speech and Natural Language Workshop, pages 241-246, 1991.
13. D. M. Magerman. 1994. Natural Language Parsing as Statistical Pattern Recognition. Doctoral dissertation. Stanford University, Stanford, California.
14. D. M. Magerman. 1995. Statistical decision-tree models for parsing. Proceedings of the Association for Computational Linguistics, 1995.
15. D. M. Magerman and M. P. Marcus. 1990. Parsing a natural language using mutual information statistics. Proceedings of AAAI-90.
16. F. Pereira and Y. Schabes. 1992. Inside-outside reestimation from partially bracketed corpora. Proceedings of the February 1992 DARPA Speech and Natural Language Workshop, pages 122-127.
17. V. Pratt, 1973. A linguistics oriented programming language. Proceedings of the Third International Joint Conference on Artificial Intelligence.
18. Y. Schabes and R. Waters. 1993. Stochastic lexicalized context-free grammar. Proceedings of the August 1993 International Workshop on Parsing Technologies.