Sciweavers

38 search results - page 4 / 8
» Querying Parse Trees of Stochastic Context-Free Grammars
Sort
View
EACL
1993
ACL Anthology
13 years 9 months ago
Using an Annotated Corpus as a Stochastic Grammar
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
Rens Bod
NAACL
2010
13 years 5 months ago
Variational Inference for Adaptor Grammars
Adaptor grammars extend probabilistic context-free grammars to define prior distributions over trees with "rich get richer" dynamics. Inference for adaptor grammars seek...
Shay B. Cohen, David M. Blei, Noah A. Smith
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
COLING
2000
13 years 9 months ago
Parsing with the Shortest Derivation
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...
Rens Bod
UAI
2004
13 years 9 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...