Sciweavers

35 search results - page 3 / 7
» Offspring-annotated probabilistic context-free grammars
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 9 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
COLING
2010
13 years 23 days ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
ACL
1998
13 years 7 months ago
An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
Rebecca Hwa
ACL
2008
13 years 7 months ago
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
Mark Johnson
NIPS
2008
13 years 7 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