hive-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jason Dere (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HIVE-9556) create UDF to measure strings similarity using Levenshtein Distance algo
Date Thu, 12 Feb 2015 02:50:12 GMT

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

Jason Dere commented on HIVE-9556:
----------------------------------

Would like to gauge the level of demand for this one. Obviously this would be of interest
to some folks, but would like to hear from others if this is too specific to add as a built-in.
If it is too specific, would it be a candidate for hive-contrib?

> 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)

Mime
View raw message