Sciweavers

10493 search results - page 104 / 2099
» Dynamic Word Problems
Sort
View
ACL
2001
13 years 9 months ago
Multi-Class Composite N-gram Language Model for Spoken Language Processing Using Multiple Word Clusters
In this paper, a new language model, the Multi-Class Composite N-gram, is proposed to avoid a data sparseness problem for spoken language in that it is difficult to collect traini...
Hirofumi Yamamoto, Shuntaro Isogai, Yoshinori Sagi...
DEXA
2005
Springer
109views Database» more  DEXA 2005»
14 years 1 months ago
Web Query Expansion by WordNet
In this paper, we address a novel method of Web query expansion by using WordNet and TSN. WordNet is an online lexical dictionary which describes word relationships in three dimens...
Zhiguo Gong, Chan Wa Cheang, Leong Hou U
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 7 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
ICASSP
2010
IEEE
13 years 6 months ago
Building pair-wise visual word tree for efficent image re-ranking
Bag-of-visual Words (BoW) image representation is getting popular in computer vision and multimedia communities. However, experiments show that the traditional BoW representation ...
Shiliang Zhang, Qingming Huang, Yijuan Lu, Wen Gao...
ACL
2004
13 years 9 months ago
Finding Predominant Word Senses in Untagged Text
In word sense disambiguation (WSD), the heuristic of choosing the most common sense is extremely powerful because the distribution of the senses of a word is often skewed. The pro...
Diana McCarthy, Rob Koeling, Julie Weeds, John A. ...