Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
From MaRDI portal
Publication:4419527
DOI10.1016/S0167-8655(02)00382-3zbMath1054.68126MaRDI QIDQ4419527
Juan Ramón Rico-Juan, Luisa Micó
Publication date: 13 August 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00382-3
Pattern recognition; Metric spaces; Handwritten character recognition; Nearest neighbour; Edit distance
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68T10: Pattern recognition, speech recognition
Related Items
Unnamed Item, On the hardness of computing the edit distance of shallow trees, A metric normalization of tree edit distance, Generalized quasi-metric on strings, Learning stochastic edit distance: application in handwritten character recognition