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

DOI10.1016/S0167-8655(02)00382-3zbMath1054.68126OpenAlexW1970479141MaRDI 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

zbMATH Keywords

Pattern recognitionMetric spacesHandwritten character recognitionNearest neighbourEdit distance

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (5)

A metric normalization of tree edit distance ⋮ On the hardness of computing the edit distance of shallow trees ⋮ Unnamed Item ⋮ Generalized quasi-metric on strings ⋮ Learning stochastic edit distance: application in handwritten character recognition

This page was built for publication: Comparison of AESA and LAESA search algorithms using string and tree-edit-distances