Return-Path: X-Original-To: apmail-hive-dev-archive@www.apache.org Delivered-To: apmail-hive-dev-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 940DF17B29 for ; Sat, 7 Feb 2015 08:25:36 +0000 (UTC) Received: (qmail 69932 invoked by uid 500); 7 Feb 2015 08:25:35 -0000 Delivered-To: apmail-hive-dev-archive@hive.apache.org Received: (qmail 69759 invoked by uid 500); 7 Feb 2015 08:25:34 -0000 Mailing-List: contact dev-help@hive.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@hive.apache.org Delivered-To: mailing list dev@hive.apache.org Received: (qmail 69348 invoked by uid 500); 7 Feb 2015 08:25:34 -0000 Delivered-To: apmail-hadoop-hive-dev@hadoop.apache.org Received: (qmail 69345 invoked by uid 99); 7 Feb 2015 08:25:34 -0000 Received: from arcas.apache.org (HELO arcas.apache.org) (140.211.11.28) by apache.org (qpsmtpd/0.29) with ESMTP; Sat, 07 Feb 2015 08:25:34 +0000 Date: Sat, 7 Feb 2015 08:25:34 +0000 (UTC) From: "Alexander Pivovarov (JIRA)" To: hive-dev@hadoop.apache.org Message-ID: In-Reply-To: References: Subject: [jira] [Updated] (HIVE-9556) create UDF to measure strings similarity using Levenshtein Distance algo MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 [ https://issues.apache.org/jira/browse/HIVE-9556?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Alexander Pivovarov updated HIVE-9556: -------------------------------------- Status: Patch Available (was: In Progress) > 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 > > > 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)