NDLI: A practical comparison of edit distance approximation algorithms

Content Provider	IEEE Xplore Digital Library
Author	Hanada, H. Nakamura, A. Kudo, M.
Copyright Year	2011
Description	Author affiliation: Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan (Hanada, H.; Nakamura, A.; Kudo, M.)
Abstract	The edit distance is a basic string similarity measure for many applications such as string searching, text mining, signal processing, bioinformatics and so on. However, its high computational cost often prevents it from being used for a large set of strings like similar string searching. A promising solution for the problem is to approximate the edit distance with low computational cost. However, although there are many methods for approximating the edit distance, most of them are analyzed only theoretically. In fact, most of the methods can evaluate the edit distance only in terms of order notations, and do not conduct any experiment. This is a large obstacle for applying them to real applications. In this study we will first list up existing edit distance approxi-mation methods. Then we compare them by: (i) approximation performances shown by the original authors, (ii) approximation performances re-analyzed by us (concrete values instead of the order notations) and (iii) experimental performances by our implementations.
Starting Page	231
Ending Page	236
File Size	361952
Page Count	6
File Format	PDF
ISBN	9781457703720
e-ISBN	9781457703713
DOI	10.1109/GRC.2011.6122599
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-11-08
Publisher Place	Taiwan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	edit distance string searching approximate string matching Approximation algorithms Concrete Vectors Computational efficiency string vectorization Function approximation Bioinformatics string replacement
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximate String Matching Using Markovian Distance

Bit-Parallel Approximate String Matching Algorithms with Transposition (2003)

Approximate String Matching: A Simpler Faster Algorithm

Bit-parallel approximate string matching algorithms with transposition (2002)

The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation

Parallel Algorithm for Approximate String Matching with K Differences

Understanding Cloud Data Using Approximate String Matching and Edit Distance

Spatial Approximate String Matching

An Improved Algorithm For Approximate String Matching

A practical comparison of edit distance approximation algorithms

Similar Documents

Approximate String Matching Using Markovian Distance

Bit-Parallel Approximate String Matching Algorithms with Transposition (2003)

Approximate String Matching: A Simpler Faster Algorithm

Bit-parallel approximate string matching algorithms with transposition (2002)

The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation

Parallel Algorithm for Approximate String Matching with K Differences

Understanding Cloud Data Using Approximate String Matching and Edit Distance

Spatial Approximate String Matching

An Improved Algorithm For Approximate String Matching

A practical comparison of edit distance approximation algorithms