levenshtein-distance

问题 I would like to be able to search a table as follows for smith as get everything that it within 1 variance. Data: O'Brien Smithe Dolan Smuth Wong Smoth Gunther Smiht I have looked into using Levenshtein distance does anyone know how to implement this with it? 回答1: In order to efficiently search using levenshtein distance, you need an efficient, specialised index, such as a bk-tree. Unfortunately, no database system I know of, including MySQL, implements bk-tree indexes. This is further

问题 I need to calculate the similarity between 2 strings. So what exactly do I mean? Let me explain with an example: The real word: hospital Mistaken word: haspita Now my aim is to determine how many characters I need to modify the mistaken word to obtain the real word. In this example, I need to modify 2 letters. So what would be the percent? I take the length of the real word always. So it becomes 2 / 8 = 25% so these 2 given string DSM is 75%. How can I achieve this with performance being a

问题 I have a table like this: id name 1 gfh 2 bob 3 boby 4 hgf etc. I am wondering how can I use Levenshtein metric to compare different rows of my 'name' column? I already know that I can use this to compare columns: L.distance('Hello, Word!', 'Hallo, World!') But how about rows? Can anybody help? 回答1: Here is a way to do it with pandas and numpy: from numpy import triu, ones t = """id name 1 gfh 2 bob 3 boby 4 hgf""" df = pd.read_csv(pd.core.common.StringIO(t), sep='\s{1,}').set_index('id')

问题 Given this data (relative letter frequency from both languages): spanish => 'e' => 13.72, 'a' => 11.72, 'o' => 8.44, 's' => 7.20, 'n' => 6.83, english => 'e' => 12.60, 't' => 9.37, 'a' => 8.34, 'o' => 7.70, 'n' => 6.80, And then computing the letter frequency for the string "this is a test" gives me: "t"=>21.43, "s"=>14.29, "i"=>7.14, "r"=>7.14, "y"=>7.14, "'"=>7.14, "h"=>7.14, "e"=>7.14, "l"=>7.14 So, what would be a good approach for matching the given string letter frequency with a

问题 Is there a way if a string is close to a string in a table it will replace it with the one in the table? Like a spellcheck function, that searches through a table and if the input is close to one in the table it will fix it , so the one in the table and the string is the same? 回答1: You can use this code :) Reference code is from here : https://github.com/badarsh2/Algorithm-Implementations/blob/master/Levenshtein_distance/Lua/Yonaba/levenshtein.lua local function min(a, b, c) return math.min

问题 When I use the fuzzystrmatch levenshtein function with diacritic characters it returns a wrong / multibyte-ignorant result: select levenshtein('ą', 'x'); levenshtein ------------- 2 (Note: the first character is an 'a' with a diacritic below, it is not rendered properly after I copied it here) The fuzzystrmatch documentation (https://www.postgresql.org/docs/9.1/fuzzystrmatch.html) warns that: At present, the soundex, metaphone, dmetaphone, and dmetaphone_alt functions do not work well with

问题 I've created the mysql user function using the levenshtein distance and ratio source codes. I am comparing 2 records and based on a 75% match I want to select the record. Order comes into table paypal_ipn_orders with an ITEM title A query executes against a table itemkey to find a 75% match in a record called ITEM as well if a 75% title is match it assigns an eight digit number from table itemkey to table paypal_ipn_orders Here is the query UPDATE paypal_ipn_orders SET sort_num = (SELECT sort

问题 I'm going crazy here. Python 3.5 PySpark 2.1. using code from here: https://www.datacamp.com/community/tutorials/fuzzy-string-python here is the function: import numpy as np def levenshtein_ratio_and_distance(s, t, ratio_calc = False): """ levenshtein_ratio_and_distance: Calculates levenshtein distance between two strings. If ratio_calc = True, the function computes the levenshtein distance ratio of similarity between two strings For all i and j, distance[i,j] will contain the Levenshtein

问题 I am attempting to compare the edit distance between two arrays. I have tried using Text:Levenshtein. #!/usr/bin/perl -w use strict; use Text::Levenshtein qw(distance); my @words = qw(four foo bar); my @list = qw(foo fear); my @distances = distance(@list, @words); print "@distances\n"; #results: 3 2 0 3 I however want the results to appear as follows: 2 0 3 2 3 2 Taking the first element of @list through the array of @words and doing the same through out the rest of the elements of @list. I

问题 I been reading and testing some examples in php levenshtein . Comparing $input to $words outputs comparing $input = 'hw r u my dear angel'; // array of words to check against $words = array('apple','pineapple','banana','orange','how are you', 'radish','carrot','pea','bean','potato','hw are you'); outputs Input word: hw r u my dear angel Did you mean: hw are you? comparing, remove hw are you in the array. $input = 'hw r u my dear angel'; // array of words to check against $words = array('apple