fuzzy-string-match 0.9.0

data/LICENSE.txt

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/README.md

@@ -0,0 +1,68 @@
+# What is fuzzy-string-match
+
+* fuzzy-string-match is a fuzzy string matching library for ruby.
+* It is fast. ( written in C with RubyInline )
+* It suports only Jaro-Winkler distance algorithm.
+* This program was ported by hand from lucene-3.0.2. (lucene is Java product)
+* If you want to add another string distance algorithm, please port by yourself and contact me <kiyoka@sumibi.org>.
+
+## Installing 
+  1. gem install fuzzy-string-match
+
+## Features
+* Caluclate Jaro-Winkler distance of two strings.
+  * Pure ruby version can handle both ascii and UTF8 strings. (and slow)
+  * Native version can only ascii strings. (and fast)
+
+## Sample code 
+  * Native version
+
+<code>
+    require 'fuzzystringmatch'
+    jarow = FuzzyStringMatch::JaroWinkler.new.create( :native )
+    p jarow.getDistance(  "jones",      "johnson" )
+</code>
+
+  * Pure ruby version
+
+<code>
+    require 'fuzzystringmatch'
+    jarow = FuzzyStringMatch::JaroWinkler.new.create( :pure )
+    p jarow.getDistance( "ああ",        "あい"        )
+</code>
+
+## Sample on irb
+
+<code>
+    irb(main):001:0> require 'fuzzystringmatch'
+    require 'fuzzystringmatch'
+    => true
+
+    irb(main):002:0> jarow = FuzzyStringMatch::JaroWinkler.new.create( :native )
+    jarow = FuzzyStringMatch::JaroWinkler.new.create( :native )
+    => #<FuzzyStringMatch::JaroWinklerNative:0x000001011b0010>
+
+    irb(main):003:0> jarow.getDistance( "al",        "al"        )
+    jarow.getDistance( "al",        "al"        )
+    => 1.0
+
+    irb(main):004:0> jarow.getDistance( "dixon",     "dicksonx"  )
+    jarow.getDistance( "dixon",     "dicksonx"  )
+    => 0.8133333333333332
+</code>
+
+## Requires
+ - RubyInline
+ - Ruby 1.9.1 or higher
+
+## Author
+ - Copyright (C) Kiyoka Nishiyama <kiyoka@sumibi.org>
+ - I ported from java source code of lucene-3.0.2.
+
+## See also
+ - http://en.wikipedia.org/wiki/Jaro–Winkler_distance
+ - http://lucene.apache.org/
+ - http://github.com/naoya/perl-text-jarowinkler
+
+## License
+ - Apache 2.0 LICENSE

data/benchmark/vs_amatch.rb

@@ -0,0 +1,54 @@
+#!/usr/local/bin/ruby
+#
+# http://www.ruby-lang.org/ja/man/html/benchmark.html
+#
+require 'benchmark'
+require 'amatch'
+require './lib/fuzzystringmatch'
+
+looptimes = 10000
+
+names50 = [ "Aichi",     "Akita",    "Aomori", "Chiba",    "Ehime",    "Fukui",     "Fukuoka",   "Fukushima", "Gifu",      "Gunma",
+            "Hiroshima", "Hokkaido", "Hyogo",  "Ibaraki",  "Ishikawa", "Iwate",     "Kagawa",    "Kagoshima", "Kanagawa",  "Kochi",
+            "Kumamoto",  "Kyoto",    "Mie",    "Miyagi",   "Miyazaki", "Nagano",    "Nagasaki",  "Nara",      "Niigata",   "Oita",
+            "Okayama",   "Okinawa",  "Osaka",  "Saga",     "Saitama",  "Shiga",     "Shimane",   "Shizuoka",  "Tochigi",   "Tokushima",
+            "Tokyo",     "Tottori",  "Toyama", "Wakayama", "Yamagata", "Yamaguchi", "Yamanashi", "Dummy1",    "Dummy2",    "Dummy3" ]
+names = names50 + names50
+
+keyword = "Tokyo"
+
+printf( " --- \n" )
+printf( " --- Each match functions will be called %dMega times. --- \n", (names.size * looptimes) / (1000.0 * 1000.0) )
+printf( " --- \n" )
+
+puts "[Amatch]"
+puts Benchmark::CAPTION
+puts Benchmark.measure {
+  jarow = Amatch::JaroWinkler.new keyword
+  looptimes.times { |n|
+    names.map { |x|
+      jarow.match( x )
+    }
+  }
+}
+
+puts "[this Module (pure)]"
+puts Benchmark::CAPTION
+puts Benchmark.measure {
+  jarow = FuzzyStringMatch::JaroWinkler.new.create
+  looptimes.times { |n|
+    names.map { |x|
+      jarow.getDistance( keyword, x )
+    }
+  }
+}
+puts "[this Module (native)]"
+puts Benchmark::CAPTION
+puts Benchmark.measure {
+  jarow = FuzzyStringMatch::JaroWinkler.new.create( :native )
+  looptimes.times { |n|
+    names.map { |x|
+      jarow.getDistance( keyword, x )
+    }
+  }
+}

data/lib/fuzzystringmatch.rb

@@ -0,0 +1,200 @@
+#
+#                            Fuzzy String Match 
+#
+#   Copyright 2010 Kiyoka Nishiyama
+#
+#   Licensed under the Apache License, Version 2.0 (the "License");
+#   you may not use this file except in compliance with the License.
+#   You may obtain a copy of the License at
+#
+#       http://www.apache.org/licenses/LICENSE-2.0
+#
+#   Unless required by applicable law or agreed to in writing, software
+#   distributed under the License is distributed on an "AS IS" BASIS,
+#   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+#   See the License for the specific language governing permissions and
+#   limitations under the License.
+#
+module FuzzyStringMatch
+  
+  class JaroWinkler
+    def create( type = :pure )     # factory method
+      case type
+      when :pure
+        JaroWinklerPure.new
+      when :native
+        JaroWinklerNative.new
+      end
+    end
+  end
+
+  class JaroWinklerPure
+    THRESHOLD = 0.7
+
+    def getDistance( s1, s2 )
+      a1 = s1.split( // )
+      a2 = s2.split( // )
+      
+      if s1.size > s2.size
+        (max,min) = a1,a2
+      else
+        (max,min) = a2,a1
+      end
+
+      range = [ (max.size / 2 - 1), 0 ].max
+      indexes = Array.new( min.size, -1 )
+      flags   = Array.new( max.size, false )
+
+      matches = 0;
+      (0 ... min.size).each { |mi|
+        c1 = min[mi]
+        xi = [mi - range, 0].max
+        xn = [mi + range + 1, max.size].min
+        
+        (xi ... xn).each { |i|
+          if (not flags[i]) && ( c1 == max[i] )
+            indexes[mi] = i
+            flags[i] = true
+            matches += 1
+            break
+          end
+        }
+      }
+
+      ms1 = Array.new( matches, nil )
+      ms2 = Array.new( matches, nil )
+
+      si = 0
+      (0 ... min.size).each { |i|
+        if (indexes[i] != -1)
+          ms1[si] = min[i]
+          si += 1
+        end
+      }
+
+      si = 0
+      (0 ... max.size).each { |i|
+        if flags[i]
+          ms2[si] = max[i]
+          si += 1
+        end
+      }
+      
+      transpositions = 0
+      (0 ... ms1.size).each { |mi|
+        if ms1[mi] != ms2[mi]
+          transpositions += 1
+        end
+      }
+
+      prefix = 0
+      (0 ... min.size).each { |mi|
+        if s1[mi] == s2[mi]
+          prefix += 1
+        else
+          break
+        end
+      }
+
+      if 0 == matches
+        0.0
+      else
+        m = matches.to_f
+        t = (transpositions/ 2)
+        j = ((m / s1.size) + (m / s2.size) + ((m - t) / m)) / 3.0;
+        return j < THRESHOLD ? j : j + [0.1, 1.0 / max.size].min * prefix * (1 - j)
+      end
+    end
+  end
+
+  require 'inline'
+  class JaroWinklerNative
+    inline do |builder|
+      builder.add_compile_flags '-std=c99'
+      builder.c_raw 'int max( int a, int b ) { return ((a)>(b)?(a):(b)); }'
+      builder.c_raw 'int min( int a, int b ) { return ((a)<(b)?(a):(b)); }'
+      builder.c_raw 'double double_min( double a, double b ) { return ((a)<(b)?(a):(b)); }'
+      builder.c '
+double getDistance( char *s1, char *s2 )
+{
+  char *_max;
+  char *_min;
+  int _max_length = 0;
+  int _min_length = 0;
+  if ( strlen(s1) > strlen(s2) ) {
+    _max = s1; _max_length = strlen(s1);
+    _min = s2; _min_length = strlen(s2);
+  }
+  else {
+    _max = s2; _max_length = strlen(s2);
+    _min = s1; _min_length = strlen(s1);
+  }
+  int range = max( _max_length / 2 - 1, 0 );
+  
+  int indexes[_min_length];
+  for( int i = 0 ; i < _min_length ; i++ ) {
+    indexes[i] = -1;
+  }
+
+  int flags[_max_length];
+  for( int i = 0 ; i < _max_length ; i++ ) {
+    flags[i] = 0;
+  }
+  int matches = 0;
+  for (int mi = 0; mi < _min_length; mi++) {
+    char c1 = _min[mi];
+    for (int xi = max(mi - range, 0), xn = min(mi + range + 1, _max_length); xi < xn; xi++ ) {
+      if (!flags[xi] && (c1 == _max[xi])) {
+	indexes[mi] = xi;
+	flags[xi] = 1;
+	matches++;
+	break;
+      }
+    }
+  }
+
+  char ms1[matches];
+  char ms2[matches];
+  int ms1_length = matches;
+  
+  for (int i = 0, si = 0; i < _min_length; i++) {
+    if (indexes[i] != -1) {
+      ms1[si] = _min[i];
+      si++;
+    }
+  }
+  for (int i = 0, si = 0; i < _max_length; i++) {
+    if (flags[i]) {
+      ms2[si] = _max[i];
+      si++;
+    }
+  }
+  int transpositions = 0;
+  for (int mi = 0; mi < ms1_length; mi++) {
+    if (ms1[mi] != ms2[mi]) {
+      transpositions++;
+    }
+  }
+  int prefix = 0;
+  for (int mi = 0; mi < _min_length; mi++) {
+    if (s1[mi] == s2[mi]) {
+      prefix++;
+    } else {
+      break;
+    }
+  }
+
+  double m = (double) matches;
+  if (matches == 0) {
+    return 0.0;
+  }
+  int t = transpositions / 2;
+  double j = ((m / strlen(s1) + m / strlen(s2) + (m - t) / m)) / 3;
+  double jw = j < 0.7 ? j : j + double_min(0.1, 1.0 / _max_length) * prefix
+    * (1 - j);
+  return jw;
+}'
+    end
+  end
+
+end

data/test/fuzzystringmatch_spec.rb

@@ -0,0 +1,139 @@
+#!/usr/bin/env ruby
+# -*- encoding: utf-8 -*-
+#
+# fuzzystringmatch_spec.rb -  "RSpec file for FuzzyStringMatch module "
+#  
+#   Copyright (c) 2010  Kiyoka Nishiyama  <kiyoka@sumibi.org>
+#
+#  Licensed to the Apache Software Foundation (ASF) under one or more
+#  contributor license agreements.  See the NOTICE file distributed with
+#  this work for additional information regarding copyright ownership.
+#  The ASF licenses this file to You under the Apache License, Version 2.0
+#  (the "License"); you may not use this file except in compliance with
+#  the License.  You may obtain a copy of the License at
+# 
+#      http://www.apache.org/licenses/LICENSE-2.0
+# 
+#  Unless required by applicable law or agreed to in writing, software
+#  distributed under the License is distributed on an "AS IS" BASIS,
+#  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+#  See the License for the specific language governing permissions and
+#  limitations under the License.
+#
+#  
+require 'fuzzystringmatch'
+require 'amatch'
+
+describe FuzzyStringMatch, "when some string distances (Pure) are" do
+  before do
+    @jarow = FuzzyStringMatch::JaroWinkler.new.create
+  end
+  it "should" do
+    @jarow.getDistance( "henka",     "henkan"    ).should be_close( 0.9722, 0.0001 )
+    @jarow.getDistance( "al",        "al"        ).should == 1.0
+    @jarow.getDistance( "martha",    "marhta"    ).should be_close( 0.9611, 0.0001 )
+    @jarow.getDistance( "jones",     "johnson"   ).should be_close( 0.8323, 0.0001 )
+    @jarow.getDistance( "abcvwxyz",  "cabvwxyz"  ).should be_close( 0.9583, 0.0001 )
+    @jarow.getDistance( "dwayne",    "duane"     ).should be_close( 0.8400, 0.0001 )
+    @jarow.getDistance( "dixon",     "dicksonx"  ).should be_close( 0.8133, 0.0001 )
+    @jarow.getDistance( "fvie",      "ten"       ).should == 0.0
+    lambda {
+      d1 = @jarow.getDistance("zac ephron", "zac efron")
+      d2 = @jarow.getDistance("zac ephron", "kai ephron")
+      d1 > d2
+    }.should be_true
+    lambda {
+      d1 = @jarow.getDistance("brittney spears", "britney spears")
+      d2 = @jarow.getDistance("brittney spears", "brittney startzman")
+      d1 > d2
+    }.should be_true
+  end
+end
+
+describe FuzzyStringMatch, "when some string distances (Native) are" do
+  before do
+    @jarow = FuzzyStringMatch::JaroWinkler.new.create( :native )
+  end
+  it "should" do
+    @jarow.getDistance( "henka",     "henkan"    ).should be_close( 0.9722, 0.0001 )
+    @jarow.getDistance( "al",        "al"        ).should == 1.0
+    @jarow.getDistance( "martha",    "marhta"    ).should be_close( 0.9611, 0.0001 )
+    @jarow.getDistance( "jones",     "johnson"   ).should be_close( 0.8323, 0.0001 )
+    @jarow.getDistance( "abcvwxyz",  "cabvwxyz"  ).should be_close( 0.9583, 0.0001 )
+    @jarow.getDistance( "dwayne",    "duane"     ).should be_close( 0.8400, 0.0001 )
+    @jarow.getDistance( "dixon",     "dicksonx"  ).should be_close( 0.8133, 0.0001 )
+    @jarow.getDistance( "fvie",      "ten"       ).should == 0.0
+    lambda {
+      d1 = @jarow.getDistance("zac ephron", "zac efron")
+      d2 = @jarow.getDistance("zac ephron", "kai ephron")
+      d1 > d2
+    }.should be_true
+    lambda {
+      d1 = @jarow.getDistance("brittney spears", "britney spears")
+      d2 = @jarow.getDistance("brittney spears", "brittney startzman")
+      d1 > d2
+    }.should be_true
+  end
+end
+
+def amatch_getDistance( s1, s2 )
+  @jarow = Amatch::JaroWinkler.new( s1 )
+  @jarow.match( s2 )
+end
+
+
+describe FuzzyStringMatch, "when some UTF8 string distances (Pure) are" do
+  before do
+    @jarow = FuzzyStringMatch::JaroWinkler.new.create
+  end
+  it "should" do
+    @jarow.getDistance( "ａｌ",              "ａｌ"        ).should == 1.0
+    @jarow.getDistance( "ｍａｒｔｈａ",      "ｍａｒｈｔａ"    ).should be_close( 0.9611, 0.0001 )
+    @jarow.getDistance( "ｊｏｎｅｓ",        "ｊｏｈｎｓｏｎ"   ).should be_close( 0.8323, 0.0001 )
+    @jarow.getDistance( "ａｂｃｖｗｘｙｚ",  "ｃａｂｖｗｘｙｚ"  ).should be_close( 0.9583, 0.0001 )
+    @jarow.getDistance( "ｄｗａｙｎｅ",      "ｄｕａｎｅ"     ).should be_close( 0.8400, 0.0001 )
+    @jarow.getDistance( "ｄｉｘｏｎ",        "ｄｉｃｋｓｏｎｘ"  ).should be_close( 0.8133, 0.0001 )
+    @jarow.getDistance( "ｆｖｉｅ",          "ｔｅｎ"       ).should == 0.0
+    lambda {
+      d1 = @jarow.getDistance("ｚａｃ　ｅｐｈｒｏｎ", "ｚａｃ　ｅｆｒｏｎ")
+      d2 = @jarow.getDistance("ｚａｃ　ｅｐｈｒｏｎ", "ｋａｉ　ｅｐｈｒｏｎ")
+      d1 > d2
+    }.should be_true
+    lambda {
+      d1 = @jarow.getDistance("ｂｒｉｔｔｎｅｙ　ｓｐｅａｒｓ", "ｂｒｉｔｎｅｙ　ｓｐｅａｒｓ")
+      d2 = @jarow.getDistance("ｂｒｉｔｔｎｅｙ　ｓｐｅａｒｓ", "ｂｒｉｔｔｎｅｙ　ｓｔａｒｔｚｍａｎ")
+      d1 > d2
+    }.should be_true
+    @jarow.getDistance( "スパゲティー",              "スパゲッティー"    ).should be_close( 0.9666, 0.0001 )
+    @jarow.getDistance( "スパゲティー",              "スパゲティ"        ).should be_close( 0.9722, 0.0001 )
+    @jarow.getDistance( "スティービー・ワンダー",    "スピーディー・ワンダー"     ).should be_close( 0.8561, 0.0001 )
+    @jarow.getDistance( "マイケル・ジャクソン",      "ジャイケル・マクソン"       ).should be_close( 0.8000, 0.0001 )
+    @jarow.getDistance( "まつもとゆきひろ",          "まつもとひろゆき"           ).should be_close( 0.9500, 0.0001 )
+    @jarow.getDistance( "クライエント",              "クライアント"      ).should be_close( 0.9222, 0.0001 )
+    @jarow.getDistance( "サーバー",                  "サーバ"            ).should be_close( 0.9416, 0.0001 )
+  end
+end
+
+
+describe Amatch, "when use Amatch gem, results are" do
+  it "should" do
+    amatch_getDistance( "henka",     "henkan"    ).should be_close( 0.9666, 0.0001 )  ## amatch's result value is different from lucene version.
+    amatch_getDistance( "al",        "al"        ).should == 1.0
+    amatch_getDistance( "martha",    "marhta"    ).should be_close( 0.9611, 0.0001 )
+    amatch_getDistance( "jones",     "johnson"   ).should be_close( 0.8323, 0.0001 )
+    amatch_getDistance( "abcvwxyz",  "cabvwxyz"  ).should be_close( 0.9583, 0.0001 )
+    amatch_getDistance( "dwayne",    "duane"     ).should be_close( 0.8400, 0.0001 )
+    amatch_getDistance( "dixon",     "dicksonx"  ).should be_close( 0.8133, 0.0001 )
+    amatch_getDistance( "fvie",      "ten"       ).should == 0.0
+    lambda {
+      d1 = amatch_getDistance("zac ephron", "zac efron")
+      d2 = amatch_getDistance("zac ephron", "kai ephron")
+      d1 > d2
+    }.should be_true
+    lambda {
+      d1 = amatch_getDistance("brittney spears", "britney spears")
+      d2 = amatch_getDistance("brittney spears", "brittney startzman")
+      d1 > d2
+    }.should be_true
+  end
+end

metadata

@@ -0,0 +1,111 @@
+--- !ruby/object:Gem::Specification 
+name: fuzzy-string-match
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 9
+  - 0
+  version: 0.9.0
+platform: ruby
+authors: 
+- Kiyoka Nishiyama
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-10-13 00:00:00 +09:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: amatch
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: RubyInline
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 3
+        - 8
+        - 6
+        version: 3.8.6
+  type: :runtime
+  version_requirements: *id003
+description: calculate Jaro Winkler distance.
+email: kiyoka@sumibi.org
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- LICENSE.txt
+- README.md
+files: 
+- LICENSE.txt
+- README.md
+- benchmark/vs_amatch.rb
+- lib/fuzzystringmatch.rb
+- test/fuzzystringmatch_spec.rb
+has_rdoc: true
+homepage: http://github.com/kiyoka/fuzzy-string-match
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --charset=UTF-8
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 1
+      - 9
+      - 1
+      version: 1.9.1
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: fuzzy string matching library
+test_files: 
+- test/fuzzystringmatch_spec.rb