DocumentCode
2420938
Title
Sharing the components of transposition-invariant distance, DIT, on DIT-organized Burkhard-Keller structure in searches for best matching strings
Author
Santana, Oscar ; Perez, J.M. ; Hernandez, Zenith
Author_Institution
Dept. of Inf. & Syst., Las Palmas Univ.
fYear
1989
fDate
23-25 Oct 1989
Firstpage
435
Lastpage
441
Abstract
Various construction approaches for character/frequency information sharing structures are proposed to optimize transportation-invariant distance evaluation. An approach for Burkhard-Keller tree construction according to the sharing structure is proposed. Experimental results are presented
Keywords
optimisation; search problems; trees (mathematics); Burkhard-Keller structure; best matching strings; character/frequency information sharing structures; optimization; transposition-invariant distance; tree construction; Adaptive filters; Cost function; Data structures; Dictionaries; Frequency; Informatics; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
Conference_Location
Fairfax, VA
Print_ISBN
0-8186-1984-8
Type
conf
DOI
10.1109/TAI.1989.65351
Filename
65351
Link To Document