Sciweavers

35 search results - page 4 / 7
» Learning Bigrams from Unigrams
Sort
View
CORR
1998
Springer
96views Education» more  CORR 1998»
13 years 7 months ago
Similarity-Based Models of Word Cooccurrence Probabilities
Abstract. In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may ne...
Ido Dagan, Lillian Lee, Fernando C. N. Pereira
CICLING
2009
Springer
14 years 8 months ago
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vec...
Ted Pedersen
ACL
1997
13 years 8 months ago
Fertility Models for Statistical Natural Language Understanding
Several recent efforts in statistical natural language understanding (NLU) have focused on generating clumps of English words from semantic meaning concepts (Miller et al., 1995; ...
Stephen Della Pietra, Mark Epstein, Salim Roukos, ...
ICPR
2010
IEEE
14 years 2 months ago
Typographical Features for Scene Text Recognition
Scene text images feature an abundance of font style variety but a dearth of data in any given query. Recognition methods must be robust to this variety or adapt to the query data...
Jerod Weinman
ECML
2005
Springer
14 years 27 days ago
On Discriminative Joint Density Modeling
Abstract. We study discriminative joint density models, that is, generative models for the joint density p(c, x) learned by maximizing a discriminative cost function, the condition...
Jarkko Salojärvi, Kai Puolamäki, Samuel ...