Created
November 7, 2012 05:15
-
-
Save plukevdh/4029680 to your computer and use it in GitHub Desktop.
memoized levenshtein
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-module(levenshtein). | |
-export([distance/2]). | |
store_result(Key, Value, Cache) -> | |
{Value, dict:store(Key, Value, Cache)}. | |
distance(String1, String2) -> | |
{List,_} = distance(String1, String2, dict:new()), | |
List. | |
distance(String1, []=String2, Cache) -> | |
store_result({String1, String2}, string:len(String1), Cache); | |
distance([]=String1, String2, Cache) -> | |
store_result({String1, String2}, string:len(String2), Cache); | |
distance([X|Rest1], [X|Rest2], Cache) -> | |
distance(Rest1,Rest2,Cache); | |
distance([_|Rest1]=String1, [_|Rest2]=String2, Cache) -> | |
case dict:is_key({String1,String2}, Cache) of | |
true -> {dict:fetch({String1,String2}, Cache), Cache}; | |
false -> | |
{L1,C1} = distance(String1, Rest2, Cache), | |
{L2,C2} = distance(Rest1, String2, C1), | |
{L3,C3} = distance(Rest1, Rest2, C2), | |
MinDist = lists:min([L1, L2, L3]) + 1, | |
store_result({String1,String2}, MinDist, C3) | |
end. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Levenshtein | |
attr_reader :distance | |
def initialize(first, second) | |
@from = first | |
@to = second | |
@memo = {} | |
end | |
def distance | |
@distance ||= calculate_distance(@from, @to) | |
end | |
private | |
def put_cache(from,to, val) | |
@memo["#{from}_#{to}"] = val | |
val | |
end | |
def get_cache(from,to) | |
@memo["#{from}_#{to}"] | |
end | |
# mimic erlang's [Head|Tail] construct | |
def head_rest(val) | |
return val[0], val[1..-1] | |
end | |
def calculate_distance(from, to) | |
return put_cache(from,to,0) if from == to | |
return put_cache(from,to,from.length) if to.empty? | |
return put_cache(from,to,to.length) if from.empty? | |
from_h, from_t = head_rest(from) | |
to_h, to_t = head_rest(to) | |
return calculate_distance(from_t, to_t) if from_h == to_h | |
cache_val = get_cache(from,to) | |
if cache_val.nil? | |
val = [ | |
calculate_distance(from_t, to), | |
calculate_distance(from, to_t), | |
calculate_distance(from_t, to_t) | |
].min | |
put_cache(from,to,val+1) | |
else | |
cache_val | |
end | |
end | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
https://gist.github.com/4029376