Sciweavers

3270 search results - page 30 / 654
» Approximate String Processing
Sort
View

Publication
141views
13 years 8 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
15 years 3 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
COLING
2010
14 years 4 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
FSMNLP
2005
Springer
15 years 3 months ago
Klex: A Finite-State Transducer Lexicon of Korean
This paper describes the implementation and system details of Klex, a finite-state transducer lexicon for the Korean language, developed using XRCE’s Xerox Finite State Tool (XF...
Na-Rae Han
FSMNLP
2005
Springer
15 years 3 months ago
WFSM Auto-intersection and Join Algorithms
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. ...
André Kempe, Jean-Marc Champarnaud, Franck ...