Parameter-Free Extended Edit Distance
ForfatterMuhammad Fuad, Muhammad Marwan
The edit distance is the most famous distance to compute the similarity between two strings of characters. The main drawback of the edit distance is that it is based on local procedures which reflect only a local view of similarity. To remedy this problem we presented in a previous work the extended edit distance, which adds a global view of similarity between two strings. However, the extended edit distance includes a parameter whose computation requires a long training time. In this paper we present a new extension of the edit distance which is parameter-free. We compare the performance of the new extension to that of the extended edit distance and we show how they both perform very similarly.
SiteringLecture Notes in Computer Science 8646(2014) s. 465-475
Følgende lisensfil er knyttet til denne innførselen: