Listing Center Strings Under the Edit Distance Metric

2015 ◽  
pp. 771-782
Author(s):  
Hiromitsu Maji ◽  
Taisuke Izumi
Keyword(s):  
Edit Distance ◽  
Distance Metric

EDIT DISTANCE WITH COMBINATIONS AND SPLITS AND ITS APPLICATIONS IN OCR NAME MATCHING

2009 ◽  
Vol 20 (06) ◽  
pp. 1047-1068 ◽  
Author(s):  
MANOLIS CHRISTODOULAKIS ◽  
GERHARD BREY
Keyword(s):  
Pattern Matching ◽  
Upper Bound ◽  
Edit Distance ◽  
Random Errors ◽  
Distance Metric ◽  
Running Time ◽  
Total Length ◽  
New Variant ◽  
Wide Range ◽  
Name Matching

Approximate pattern matching has a wide range of applications and, depending on the type of approximation, there exist numerous algorithms for solving it. In this article we focus on texts which originate from OCRed documents, whose errors quite often have a particular form and are far from being random errors. We introduce a new variant of the edit distance metric, where apart from the traditional edit operations, two new operations are supported. The combination operation allows two or more symbols from a string x to be interpreted as a single symbol and then "matched" (or aligned) against a single symbol of a second string y. Its dual is the operation of a split, where a single symbol from x is broken down into a sequence of two or more other symbols, that can then be matched against an equal number of symbols from y. Our algorithm requires O(L) time for preprocessing, and O(mnk) time for computing the edit distance, where L is the total length of all the valid combinations/splits, m and n are the lengths of the two strings under comparison and k is an upper bound on the number of valid splits for any single symbol. The expected running time is O(mn).

scholarly journals The extended edit distance metric

2008 ◽  
Author(s):  
Muhammad Marwan Muhammad Fuad ◽  
Pierre-Francois Marteau
Keyword(s):  
Edit Distance ◽  
Distance Metric

Workflow distance metric based on tree edit distance

2013 ◽  
Vol 32 (12) ◽  
pp. 3529-3533
Author(s):  
Nan JIA ◽  
Xiao-dong FU ◽  
Yuan HUANG ◽  
Xiao-yan LIU ◽  
Zhi-hua DAI
Keyword(s):  
Edit Distance ◽  
Distance Metric ◽  
Tree Edit Distance

Stochastic Contextual Edit Distance and Probabilistic FSTs

2014 ◽  
Author(s):  
Ryan Cotterell ◽  
Nanyun Peng ◽  
Jason Eisner
Keyword(s):  
Edit Distance

Contextual-distance Metric Based Laplacian Maximum Margin Criterion

2011 ◽  
Vol 36 (12) ◽  
pp. 1661-1673
Author(s):  
Jun GAO ◽  
Shi-Tong WANG ◽  
Xiao-Ming WANG
Keyword(s):  
Distance Metric ◽  
Maximum Margin ◽  
Maximum Margin Criterion

scholarly journals Distance metric learning for graph structured data

2021 ◽  
Author(s):  
Tomoki Yoshida ◽  
Ichiro Takeuchi ◽  
Masayuki Karasuyama
Keyword(s):  
Metric Learning ◽  
Structured Data ◽  
Distance Metric Learning ◽  
Distance Metric
Sign in / Sign up

Export Citation Format

Share Document