Efficient Bounded Jaro-Winkler Similarity Based Search
| dc.contributor.author | Keil, Jan Martin | |
| dc.contributor.editor | Grust, Torsten | |
| dc.contributor.editor | Naumann, Felix | |
| dc.contributor.editor | Böhm, Alexander | |
| dc.contributor.editor | Lehner, Wolfgang | |
| dc.contributor.editor | Härder, Theo | |
| dc.contributor.editor | Rahm, Erhard | |
| dc.contributor.editor | Heuer, Andreas | |
| dc.contributor.editor | Klettke, Meike | |
| dc.contributor.editor | Meyer, Holger | |
| dc.date.accessioned | 2019-04-11T07:21:15Z | |
| dc.date.available | 2019-04-11T07:21:15Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | 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. | en |
| dc.identifier.doi | 10.18420/btw2019-13 | |
| dc.identifier.isbn | 978-3-88579-683-1 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/21697 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik, Bonn | |
| dc.relation.ispartof | BTW 2019 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) – Proceedings, Volume P-289 | |
| dc.subject | Jaro-Winkler Similarity | |
| dc.subject | Similarity Search | |
| dc.subject | String Similarity | |
| dc.title | Efficient Bounded Jaro-Winkler Similarity Based Search | en |
| gi.citation.endPage | 214 | |
| gi.citation.startPage | 205 | |
| gi.conference.date | 4.-8. März 2019 | |
| gi.conference.location | Rostock | |
| gi.conference.sessiontitle | Wissenschaftliche Beiträge |
Dateien
Originalbündel
1 - 1 von 1