.png){kind=icon}
.png){kind=icon}
Return
Generalizing identity-based string comparison metrics: Framework and techniques
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2019.06.028.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a framework that aims at handling metrics among strings defined over heterogeneous alphabets. Furthermore, we illustrate in detail its application to generalize one of the most important string metrics, namely the edit distance. This last activity leads us to define the Multi-Parameterized Edit Distance (MPED). As for this last metric, we investigate its computational properties and solution algorithms, and we present several experiments for its evaluation. As a final contribution, we provide several notes about some possible applications of MPED and other generalized metrics in different scenarios. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
String metrics
Generalized string similarity framework
Matching schema
Generalized metric function
Multi-parameterized edit distance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W