Sciweavers

340 search results - page 45 / 68
» New adaptive compressors for natural language text
Sort
View
IR
2008
14 years 9 months ago
A compressed self-index using a Ziv-Lempel dictionary
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...
Luís M. S. Russo, Arlindo L. Oliveira
CSIE
2009
IEEE
15 years 4 months ago
Building a General Purpose Cross-Domain Sentiment Mining Model
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...
Matthew Whitehead, Larry Yaeger
KDD
2009
ACM
211views Data Mining» more  KDD 2009»
15 years 10 months ago
Address standardization with latent semantic association
Address standardization is a very challenging task in data cleansing. To provide better customer relationship management and business intelligence for customer-oriented cooperates...
Honglei Guo, Huijia Zhu, Zhili Guo, Xiaoxun Zhang,...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro
CICLING
2009
Springer
15 years 10 months ago
Enriching Statistical Translation Models Using a Domain-Independent Multilingual Lexical Knowledge Base
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...
Miguel García, Jesús Giménez,...