*** empty log message ***

amatch/CHANGES

@@ -1,3 +1,8 @@
+2005-01-20 (0.2.0)
+    * Major changes in API and implementation:
+      Now the Levenshtein edit distance, Sellers edit distance, the Hamming
+      distance, the longest common subsequence length, the longest common
+      substring length, and the pair distance metric can be computed.
 2005-01-20 (0.1.4)
     * Better argument handling in initialization method
     * Minor changes in Rakefile and README.en

amatch/Rakefile

@@ -58,9 +58,9 @@ spec = Gem::Specification.new do |s|
   s.version = PKG_VERSION
   s.summary = "Approximate String Matching library"
   s.description = <<EOF
-Amatch is a library for approximate string matching and searching using
-a dynamic programming algorithm to compute the Levenshtein distance
-between strings.
+Amatch is a library for approximate string matching and searching in strings.
+Several algorithms can be used to do this, and it's also possible to compute a
+similarity metric number between 0.0 and 1.0 for two given strings.
 EOF
 
   #### Dependencies and requirements.

amatch/ext/amatch.c

@@ -1222,9 +1222,9 @@ static VALUE rb_str_longest_substring_similar(VALUE self, VALUE strings)
  *
  * This is a collection of classes that can be used for Approximate
  * matching, searching, and comparing of Strings. They implement algorithms
- * that compute the Sellers edit distance, the Hamming distance, the
- * longest common subsequence length, the longest common substring length, and
- * the pair distance metric.
+ * that compute the Levenshtein edit distance, Sellers edit distance, the
+ * Hamming distance, the longest common subsequence length, the longest common
+ * substring length, and the pair distance metric.
  *
  * == Author
  *