Show simple item record

dc.contributor.authorMuhammad Fuad, Muhammad Marwan
dc.date.accessioned2015-02-25T10:16:55Z
dc.date.available2015-12-06T06:50:04Z
dc.date.issued2014
dc.description.abstractThe 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.en_US
dc.identifier.citationLecture Notes in Computer Science 8646(2014) s. 465-475en_US
dc.identifier.cristinIDFRIDAID 1181199
dc.identifier.doi10.1007/978-3-319-10160-6_41
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/10037/7212
dc.identifier.urnURN:NBN:no-uit_munin_6781
dc.language.isoengen_US
dc.publisherSpringer Verlagen_US
dc.rights.accessRightsopenAccess
dc.subject422:Algoritmer og beregnbarhetsteorien_US
dc.subject422:Algorithms and computability theoryen_US
dc.titleParameter-Free Extended Edit Distanceen_US
dc.typeJournal articleen_US
dc.typeTidsskriftartikkelen_US
dc.typePeer revieweden_US


File(s) in this item

Thumbnail
Thumbnail

This item appears in the following collection(s)

Show simple item record