[jira] [Commented] (HIVE-9556) create UDF to measure strings similarity using Levenshtein Distance algo

[nicolas maillard (JIRA)]

    [ 
https://issues.apache.org/jira/browse/HIVE-9556?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14310631#comment-14310631
 ] 

nicolas maillard commented on HIVE-9556:
----------------------------------------

would it be a good time to add also the Damerau–Levenshtein_distance and jaro 
distance?

> create UDF to measure strings similarity using Levenshtein Distance algo
> ------------------------------------------------------------------------
>
>                 Key: HIVE-9556
>                 URL: https://issues.apache.org/jira/browse/HIVE-9556
>             Project: Hive
>          Issue Type: Improvement
>          Components: UDF
>            Reporter: Alexander Pivovarov
>            Assignee: Alexander Pivovarov
>         Attachments: HIVE-9556.1.patch, HIVE-9556.2.patch
>
>
> algorithm description http://en.wikipedia.org/wiki/Levenshtein_distance
> {code}
> --one edit operation, greatest str len = 12
> str_sim_levenshtein('Test String1', 'Test String2') = 1 - 1 / 12 = 0.91666667
> {code}



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)