An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities

An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andreas Stolcke

Venue:	Computational Linguistics
Citations:	155 - 5 self

BibTeX

@ARTICLE{Stolcke02anefficient,
    author = {Andreas Stolcke},
    title = {An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities},
    journal = {Computational Linguistics},
    year = {2002},
    volume = {21},
    pages = {165--201}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions

Citations

6231	Maximum likelihood from incomplete data via the EM algorithm - Dempster, Laird - 1977
666	An introduction to hidden Markov models - Rabiner, Juang - 1986
594	An efficient context-free parsing algorithm - Earley - 1970
573	A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains - Baum, Petrie, et al. - 1970
345	A maximum likelihood approach to continuous speech recognition - Bahl, Jelinek - 1983
316	The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language - Lari, Young - 1990
240	Inside-Outside Reestimation from Partially Bracketed Corpora - Pereira, Schabes - 1992
232	Trainable Grammars for Speech Recognition - Baker - 1979
182	Efficient Parsing for Natural Language - Tomita - 1986
178	Generalised probabilistic LR parsing of natural language (corpora) with unification-based grammars - Briscoe, Carroll - 1993
109	The Theory - Aho, Ullman - 1972
105	Basic methods of probabilistic context-free grammars - Jelinek, Lafferty, et al. - 1992
86	Applying Probability Measures to Abstract Languages - Booth, Thompson - 1973
76	An improved context-free recognizer - Graham, Harrison, et al. - 1980
68	Computation of the probability of initial substring generation by stochastic context-free grammars - Jelinek, Lafferty - 1991
56	A probabilistic parsing method for sentence disambiguation - Fujisaki - 1989
54	Pearl: A Probabilistic Chart Parser - Magerman, Marcus - 1991
49	Markov source modeling of text generation - Jelinek - 1985
43	Efficiency, robustness, and accuracy in picky chart parsing - Magerman, Weir - 1992
38	Applications of stochastic context-free grammars using the inside-outside algorithm - Lari, Young - 1991
34	Precise n-gram probabilities from stochastic context-free grammars - Stolcke, Segal - 1994
32	Trainable grammars for speech recognition”. In Speech Communication Papers for the 97th Meeting of the Acoustical - Baker - 1979
28	The Berkeley restaurant project - Jurafsky, Wooters, et al. - 1994
26	Using a stochastic context-free grammar as a language model for speech recognition - JURAFKSY, WOOTERS, et al. - 1995
26	Stochastic grammars and pattern recognition”. In Speech Recognition and Understanding. Recent Advances, Trends, and Applications, edited by Pietro Laface and Renato De Mori, volume F75 - Ney - 1992
22	i\ proba.bilist.ic chart parser - Pearl - 1991
21	LR parsing of probabilistic grammars with input uncertainty for speech recognition. Computer Speech and Language 4.297–323 - WRIGHT - 1990
11	Computation of probabilities for an island-driven parser - Corazza, Mori, et al. - 1991
11	Prolog and Natural-Language Analysis. Number 10 - Pereira, Shieber - 1987
10	Hidden Markov estimation for unrestricted stochastic context-free grammars - Kupiec - 1992
8	Trainable grammars for speech recognition," Speech Communication Papers for the 97th Meeting of the Acoustical Society of - Baker - 1979
7	A probabilistic parser and its applications - Jones, Eisner - 1992
6	An inside-outside algorithm for estimating the parameters of a hidden stochastic context-free grammar based on Earley’s algorithm - Schabes - 1991
6	Restaurant Project - Berkeley
4	Spoken sentence recognition by time-synchronous parsing algorithm of context-free grammar - Nakagawa - 1987
3	Modification of Earley’s algorithm for speech recognition - Päseler - 1988
3	Markov source modeling of text generation”. In The Impact of Processing Techniques on Communications, edited by - Jelinek - 1985
3	Precisen-gram probabilities from stochastic context-free grammars - Stolcke, Segal - 1994
2	Markov Source Modeling of Text Generation," The Impact of - Jelinek - 1985
2	Modification of Earley's algorithm for speech recognition - ASELER, ANNEDORE - 1988
1	A parsing algorithm for weighted grammars and substring recognition - Casacuberta, Vidal - 1988
1	Modification of Earley's algorithm for speech recognition - Piseler - 1988
1	Stolcke Efficient Probabilistic Context-Free Parsing Earley - Andreas - 1970
1	Annedore - aseler - 1988
1	Speech Understanding and Dialog Systems, edited by - Niemann, Lang, et al. - 1987
1	Y ) is bounded above by the probability that the entire derivation starting at X terminates Unfortunately, the terminology used in the literature is not uniform. For example, Jelinek & Lafferty - unknown authors - 1991
1	Applications, volume F75 - Advances, Trends - 1990