Relating Probabilistic Grammars and Automata

Relating Probabilistic Grammars and Automata (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Steven Abney , David Mcallester , Fernando Pereira

Venue:	In Proceedings of ACP’99
Citations:	31 - 0 self

BibTeX

@INPROCEEDINGS{Abney99relatingprobabilistic,
    author = {Steven Abney and David Mcallester and Fernando Pereira},
    title = {Relating Probabilistic Grammars and Automata},
    booktitle = {In Proceedings of ACP’99},
    year = {1999},
    pages = {542--549},
    publisher = {Morgan Kaufmann}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilis- tic languages, they appear to impose different inductive biases.

Citations

780	Head-Driven Statistical Models for Natural Language Parsing - Collins - 1999
324	Statistical Parsing with a Context-Free Grammar and Word Statistics - Charniak - 1997
178	Generalised probabilistic LR parsing of natural language (corpora) with unification-based grammars - Briscoe, Carroll - 1993
136	Natural Language Parsing as Statistical Pattern Recognition - Magerman - 1994
106	Exploiting syntactic structure for language modeling - Chelba, Jelinek - 1998
86	Applying Probability Measures to Abstract Languages - Booth, Thompson - 1973
42	Bilexical Grammars and a CubicTime Probabilistic Parser - Eisner - 1997
10	Deterministic left corner parser - Rosenkrantz, Lewis - 1970
2	The Theory of Parsing, Translation and Compiling, volume I - Aho, Ullman - 1972
1	A linear oberved time statistical parser based on maximum entropy models - Ratnaparkhi - 1997