Sciweavers

35 search results - page 6 / 7
» Offspring-annotated probabilistic context-free grammars
Sort
View
NAACL
2007
13 years 7 months ago
Bayesian Inference for PCFGs via Markov Chain Monte Carlo
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an altern...
Mark Johnson, Thomas L. Griffiths, Sharon Goldwate...
EMNLP
2004
13 years 7 months ago
Bilingual Parsing with Factored Estimation: Using English to Parse Korean
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
David A. Smith, Noah A. Smith
ACL
2012
11 years 8 months ago
Concept-to-text Generation via Discriminative Reranking
This paper proposes a data-driven method for concept-to-text generation, the task of automatically producing textual output from non-linguistic input. A key insight in our approac...
Ioannis Konstas, Mirella Lapata
IBPRIA
2011
Springer
12 years 9 months ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
ACL
2006
13 years 7 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas