130 search results - page 5 / 26 » A Stochastic Language Model using Dependency and Its Improve... |
COLT
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
ITA
2006
13 years 7 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
EMNLP
2010
13 years 5 months ago
2010
We show that the standard beam-search algorithm can be used as an efficient decoder for the global linear model of Zhang and Clark (2008) for joint word segmentation and POS-taggi...
ICGI
1998
Springer
13 years 11 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...