Sciweavers

35 search results - page 4 / 7
» Offspring-annotated probabilistic context-free grammars
Sort
View
NAACL
2010
13 years 7 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
PAMI
2006
109views more  PAMI 2006»
13 years 9 months ago
Offline Grammar-Based Recognition of Handwritten Sentences
This paper proposes a sequential coupling of a Hidden Markov Model (HMM) recognizer for offline handwritten English sentences with a probabilistic bottom-up chart parser using Sto...
Matthias Zimmermann, Jean-Cédric Chappelier...
UAI
2004
13 years 11 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...
INFOCOM
2009
IEEE
14 years 4 months ago
Event Recognition in Sensor Networks by Means of Grammatical Inference
Abstract—Modern military and civilian surveillance applications should provide end users with the high level representation of events observed by sensors rather than with the raw...
Sahin Cem Geyik, Boleslaw K. Szymanski
TCS
2008
13 years 9 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta