You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hive.apache.org by "Alexander Pivovarov (JIRA)" <ji...@apache.org> on 2015/02/03 07:03:34 UTC
[jira] [Updated] (HIVE-9556) create UDF to measure strings
similarity using Levenshtein Distance algo
[ https://issues.apache.org/jira/browse/HIVE-9556?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Alexander Pivovarov updated HIVE-9556:
--------------------------------------
Summary: create UDF to measure strings similarity using Levenshtein Distance algo (was: create UDF to measure string similarity using Levenshtein Distance algo)
> 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
>
> algorithm description http://en.wikipedia.org/wiki/Levenshtein_distance
> {code}
> --one edit operation, greatest str len = 12
> str_sim_levenshtein("Test String1", "Test String2") = (12 -1) / 12 = 0.9166667f
> {code}
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)