Sciweavers

182 search results - page 23 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
NIPS
2008
13 years 9 months ago
Logistic Normal Priors for Unsupervised Probabilistic Grammar Induction
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
Shay B. Cohen, Kevin Gimpel, Noah A. Smith
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...
DLT
2003
13 years 9 months ago
Tile Rewriting Grammars
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
Stefano Crespi-Reghizzi, Matteo Pradella
SOFSEM
1998
Springer
13 years 12 months ago
Determining Type of TIL Construction with Verb Valency Analyser
In our paper we discuss an approach to semiautomatic corpus processing aimed at analysing verb valencies in Czech and consecutive determining the type of TIL (Transparent Intension...
Pavel Smrz, Ales Horák
CL
2000
Springer
13 years 7 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...