Sciweavers

115 search results - page 6 / 23
» Learning String Edit Distance
Sort
View
ISCI
2007
170views more  ISCI 2007»
13 years 8 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
LREC
2010
154views Education» more  LREC 2010»
13 years 10 months ago
Information Retrieval of Word Form Variants in Spoken Language Corpora Using Generalized Edit Distance
An important feature of spoken language corpora is existence of different spelling variants of words in transcription. So there is an important problem for linguist who works with...
Siim Orasmaa, Reina Käärik, Jaak Vilo, T...
PR
2010
84views more  PR 2010»
13 years 6 months ago
Learning state machine-based string edit kernels
Aurélien Bellet, Marc Bernard, Thierry Murg...
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 3 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 6 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen