Sciweavers

367 search results - page 31 / 74
» Lexicalized Context-Free Grammars
Sort
View
NAACL
2007
13 years 10 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...
ECML
2003
Springer
14 years 1 months ago
A Hybrid Language Model based on Stochastic Context-free Grammars
Abstract. This paper explores the use of initial Stochastic Context-Free Grammars (SCFG) obtained from a treebank corpus for the learning of SCFG by means of estimation algorithms....
Diego Linares, José-Miguel Benedí, J...
COLING
2008
13 years 10 months ago
Extracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Hao Zhang, Daniel Gildea, David Chiang
ACL
2006
13 years 10 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang
ICPR
2008
IEEE
14 years 2 months ago
On-line handwritten Kanji string recognition based on grammar description of character structures
In this paper, we evaluate a method for on-line handwritten Kanji character recognition by describing the structure of Kanji using Stochastic Context-Free Grammar (SCFG), and exte...
Ikumi Ota, Ryo Yamamoto, Takuya Nishimoto, Shigeki...