Sciweavers

516 search results - page 22 / 104
» Sets of k-Independent Strings
Sort
View
AAAI
2010
13 years 9 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
DIS
2007
Springer
14 years 1 months ago
Unsupervised Spam Detection Based on String Alienness Measures
We propose an unsupervised method for detecting spam documents from Web page data, based on equivalence relations on strings. We propose 3 measures for quantifying the alienness (...
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Mas...
EMNLP
2008
13 years 9 months ago
Latent-Variable Modeling of String Transductions with Finite-State Methods
String-to-string transduction is a central problem in computational linguistics and natural language processing. It occurs in tasks as diverse as name transliteration, spelling co...
Markus Dreyer, Jason Smith, Jason Eisner
CICLING
2009
Springer
13 years 8 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
PAMI
2002
157views more  PAMI 2002»
13 years 7 months ago
Automatic Recognition of Handwritten Numerical Strings: A Recognition and Verification Strategy
A modular system to recognize handwritten numerical strings is proposed. It uses a segmentation-based recognition approach and a Recognition and Verification strategy. The approach...
Luiz E. Soares de Oliveira, Robert Sabourin, Fl&aa...