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

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

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

Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm

The ECGI (error correcting grammatical inference) algorithm is a recently introduced automatic learning method. The authors present improvements to the ECGI and the corresponding experiments to test these improvements. The results show the ability of the ECGI to obtain structural models of (isolated) words which enable a very high speaker-independent recognition rate to be achieved. >

M. J. Lloret

Papers

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