Logo des Repositoriums
 
Textdokument

Efficient Bounded Jaro-Winkler Similarity Based Search

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Zusatzinformation

Datum

2019

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Quelle

Verlag

Gesellschaft für Informatik, Bonn

Zusammenfassung

The Jaro-Winkler similarity is a widely used measure for the similarity of strings. We propose an efficient algorithm for the bounded search of similar strings in a large set of strings. We compared our approach to the naive approach and the approach by Dreßler et al. Our results prove a significant improvement of the efficiency in computation of the bounded Jaro-Winkler similarity for querying of similar strings.

Beschreibung

Keil, Jan Martin (2019): Efficient Bounded Jaro-Winkler Similarity Based Search. BTW 2019. DOI: 10.18420/btw2019-13. Gesellschaft für Informatik, Bonn. PISSN: 1617-5468. ISBN: 978-3-88579-683-1. pp. 205-214. Wissenschaftliche Beiträge. Rostock. 4.-8. März 2019

Zitierform

Tags