Sciweavers

391 search results - page 1 / 79
» Factored Language Models and Generalized Parallel Backoff
Sort
View
NAACL
2003
13 years 6 months ago
Factored Language Models and Generalized Parallel Backoff
We introduce factored language models (FLMs) and generalized parallel backoff (GPB). An FLM represents words as bundles of features (e.g., morphological classes, stems, data-drive...
Jeff Bilmes, Katrin Kirchhoff
ICASSP
2009
IEEE
13 years 9 months ago
Neural network based language models for highly inflective languages
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
Tomas Mikolov, Jirí Kopecký, Lukas B...
ICASSP
2008
IEEE
13 years 11 months ago
Efficient language model look-ahead probabilities generation using lower order LM look-ahead information
In this paper, an efficient method for language model lookahead probability generation is presented. Traditional methods generate language model look-ahead (LMLA) probabilities fo...
Langzhou Chen, K. K. Chin
EMNLP
2011
12 years 4 months ago
Lexical Generalization in CCG Grammar Induction for Semantic Parsing
We consider the problem of learning factored probabilistic CCG grammars for semantic parsing from data containing sentences paired with logical-form meaning representations. Tradi...
Tom Kwiatkowski, Luke S. Zettlemoyer, Sharon Goldw...
OSDI
2008
ACM
13 years 7 months ago
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Bud...