Comparison of AESA and LAESA search algorithms using string and tree-edit-distances

Authors:
Juan Ramón Rico-Juan;Luisa Micó
Affiliations:
Universidad de Alicante, Departamento de Lenguajes y Sistemas Informáticos, Campus de San Vicente del, Raspeig, 03071 Alicante E-03080, Spain;Universidad de Alicante, Departamento de Lenguajes y Sistemas Informáticos, E-03080 Spain
Venue:
Pattern Recognition Letters
Year:
2003

Citing 7
Cited 14

Fast speaker-independent DTW recognition of isolated words using a metric-space algorithm (AESA)

Speech Communication - Word Recognition in Large Vocabularies
Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)

Pattern Recognition Letters
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

Pattern Recognition Letters
A note on the Nagendraprasad-Wang-Gupta thinning algorithm

Pattern Recognition Letters
Comparison of fast nearest neighbour classifiers for handwritten character recognition

Pattern Recognition Letters
The String-to-String Correction Problem

Journal of the ACM (JACM)

Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search

ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Learning stochastic edit distance: Application in handwritten character recognition

Pattern Recognition
A Normalized Levenshtein Distance Metric

IEEE Transactions on Pattern Analysis and Machine Intelligence
Use of Structured Pattern Representations for Combining Classifiers

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Contour Regularity Extraction Based on String Edit Distance

IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Randomized approaches for nearest neighbor search in metric space when computing the pairwise distance is extremely expensive

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A new editing scheme based on a fast two-string median computation applied to OCR

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A metric normalization of tree edit distance

Frontiers of Computer Science in China
Characterization of contour regularities based on the Levenshtein edit distance

Pattern Recognition Letters
Edit distance for ordered vector sets: a case of study

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Using learned conditional distributions as edit distance

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
An improved fast edit approach for two-string approximated mean computation applied to OCR

Pattern Recognition Letters
Indexing for subtree similarity-search using edit distance

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.10

Visualization

Abstract

Although the success rate of handwritten character recognition using a nearest neighbour technique together with edit distance is satisfactory, the exhaustive search is expensive. Some fast methods as AESA and LAESA have been proposed to find nearest neighbours in metric spaces. The average number of distances computed by these algorithms is very low and does not depend on the number of prototypes in the training set. In this paper, we compare the behaviour of these algorithms when string and tree-edit-distances are used.