levenshtein 0.1.0 → 0.1.1

data/CHANGELOG

@@ -0,0 +1,10 @@
+0.1.1 (06-10-2008)
+
+* If one of the strings was both the begin and the end of the
+  other string, it would be stripped from both ends. Example:
+  Levenshtein.distance("abracadabra", "abra") resulted in 3
+  instead of 7. It's fixed now.
+
+0.1.0 (24-05-2008)
+
+* First release.

data/README

@@ -1,8 +1,8 @@
-# The Levenshtein distance is a metric for measuring the amount of difference
-# between two sequences (i.e., the so called edit distance). The Levenshtein
-# distance between two strings is given by the minimum number of operations
-# needed to transform one string into the other, where an operation is an
-# insertion, deletion, or substitution of a single character.
-#
-# More information about the Levenshtein distance algorithm:
-# http://en.wikipedia.org/wiki/Levenshtein_distance .
+The Levenshtein distance is a metric for measuring the amount of difference
+between two sequences (i.e., the so called edit distance). The Levenshtein
+distance between two strings is given by the minimum number of operations
+needed to transform one string into the other, where an operation is an
+insertion, deletion, or substitution of a single character.
+
+More information about the Levenshtein distance algorithm:
+http://en.wikipedia.org/wiki/Levenshtein_distance .

data/VERSION

@@ -1 +1 @@
-0.1.0
+0.1.1

data/lib/levenshtein.rb

@@ -18,7 +18,7 @@ end
 # http://en.wikipedia.org/wiki/Levenshtein_distance .
 
 module Levenshtein
-  # Returns the Levenshtein distance as a number bestween 0.0 and 1.0.
+  # Returns the Levenshtein distance as a number between 0.0 and 1.0.
   # It's basically the Levenshtein distance divided by the length of the longest string.
 
   def self.normalized_distance(s1, s2, threshold=nil)
@@ -62,7 +62,7 @@ module Levenshtein
       b += 1
     end
 
-    while s1[e1, 1] == s2[e2, 1]
+    while s1[e1, 1] == s2[e2, 1] and e1 > b and e2 > b
       e1 -= 1
       e2 -= 1
     end

data/test/test.rb

@@ -40,6 +40,7 @@ class TestLevenshtein < Test::Unit::TestCase
     assert_equal(3, Levenshtein.distance("ab123cd", "abxyzcd"))
     assert_equal(3, Levenshtein.distance("ab123", "abxyz"))
     assert_equal(3, Levenshtein.distance("123cd", "xyzcd"))
+    assert_equal(5, Levenshtein.distance("123cd123", "123"))
 
     assert_in_delta(0.42, Levenshtein.normalized_distance("ab123cd", "abxyzcd"), 0.01)
     assert_in_delta(0.6, Levenshtein.normalized_distance("ab123", "abxyz"), 0.01)

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: levenshtein
 version: !ruby/object:Gem::Version 
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors: 
 - Erik Veenstra
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2008-05-24 00:00:00 +02:00
+date: 2008-10-06 00:00:00 +02:00
 default_executable: 
 dependencies: []
 
@@ -29,6 +29,7 @@ files:
 - README
 - LICENSE
 - VERSION
+- CHANGELOG
 has_rdoc: true
 homepage: http://www.erikveen.dds.nl/levenshtein/index.html
 post_install_message: 
@@ -36,8 +37,9 @@ rdoc_options:
 - README
 - LICENSE
 - VERSION
+- CHANGELOG
 - --title
-- levenshtein (0.1.0)
+- levenshtein (0.1.1)
 - --main
 - README
 require_paths: 
@@ -57,7 +59,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
 requirements: []
 
 rubyforge_project: levenshtein
-rubygems_version: 1.0.1
+rubygems_version: 1.2.0
 signing_key: 
 specification_version: 2
 summary: Calculates the Levenshtein distance between two byte strings.