340 search results - page 45 / 68 » New adaptive compressors for natural language text |
IR
2008
14 years 11 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
84
Voted
CSIE
2009
IEEE
15 years 6 months ago
2009
IEEE
Building a model using machine learning that can classify the sentiment of natural language text often requires an extensive set of labeled training data from the same domain as t...
110
click to vote
KDD
2009
ACM
16 years 9 days ago
2009
ACM
Address standardization is a very challenging task in data cleansing. To provide better customer relationship management and business intelligence for customer-oriented cooperates...
107
click to vote
ALGORITHMICA
2005
14 years 11 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
CICLING
2009
Springer
16 years 10 days ago
2009
Springer
This paper presents a method for improving phrase-based Statistical Machine Translation systems by enriching the original translation model with information derived from a multilin...