Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
- 30 June 2003
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 24 (9-10), 1417-1426
- https://doi.org/10.1016/s0167-8655(02)00382-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the use of normalized edit distances and an efficient k-NN search technique (k-AESA) for fast and accurate string classificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Syntactic Pattern Recognition by Error Correcting Analysis on Tree AutomataLecture Notes in Computer Science, 2000
- Comparison of fast nearest neighbour classifiers for handwritten character recognitionPattern Recognition Letters, 1998
- A note on the Nagendraprasad-Wang-Gupta thinning algorithmPattern Recognition Letters, 1995
- A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognition Letters, 1994
- New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)Pattern Recognition Letters, 1994
- Fast speaker-independent DTW recognition of isolated words using a metric-space search algorithm (AESA)Speech Communication, 1988
- Is the DTW “distance” really a metric? An algorithm reducing the number of DTW comparisons in isolated word recognitionSpeech Communication, 1985
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- On the Encoding of Arbitrary Geometric ConfigurationsIEEE Transactions on Electronic Computers, 1961