Sciweavers

945 search results - page 30 / 189
» On the robustness of primitive words
Sort
View
CIKM
2005
Springer
15 years 11 months ago
Word sense disambiguation in queries
This paper presents a new approach to determine the senses of words in queries by using WordNet. In our approach, noun phrases in a query are determined first. For each word in th...
Shuang Liu, Clement T. Yu, Weiyi Meng
WWW
2011
ACM
15 years 1 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
CSO
2009
IEEE
15 years 7 months ago
The Temporal-Spatial Modeling of Vocabulary for Language Monitoring
In order to extract catchwords, new words and other kinds of words for language monitoring, this paper propose the temporal-spatial modeling, which seemed the sort of words as the...
Wei He, Yu Zou, Yonglin Teng, Min Hou, Weibin Zhu
JSYML
2010
114views more  JSYML 2010»
15 years 4 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
ICCV
1999
IEEE
16 years 8 months ago
A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin