Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/73205
Title: Increasing radius search schemes for the most similar strings on the Burkhard-Keller tree
Authors: Santana Suárez, Octavio 
Pérez Aguiar, José 
Rodríguez Del Pino, Juan Carlos 
UNESCO Clasification: 570104 Lingüística informatizada
Issue Date: 1990
Journal: Cybernetics and Systems 
Abstract: In this work, search schemes are proposed for (he most strings similar to a given one, based on the Levenshtein directional distance (Levenshtein, 1966), working on a Burkhard-Keller structure (Burkhard and Keller, 1973; Nevalainen and Ka- tajainen, 1982), organized by the transposition-invariant distance (Santana et al., 1987), and using an increasing search radius as opposed to the decreasing search radius schemes (Santana et al., 1988). Some organization approaches are studied to find the best way to improve search performance. The test results are analyzed, comparing these approaches and the different search schemes.
URI: http://hdl.handle.net/10553/73205
ISSN: 0196-9722
DOI: 10.1080/01969729008902232
Source: Cybernetics And Systems [ISSN 0196-9722], v. 21 (2-3), p. 167-180, (Marzo-Junio 1990)
Appears in Collections:Artículos
Show full item record

Page view(s)

27
checked on May 9, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.