rubyfish 0.0.2

data/LICENSE

@@ -0,0 +1,27 @@
+Copyright (c) 2010, AnjLab
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+    * Neither the name of Sunlight Labs nor the names of its contributors may be
+      used to endorse or promote products derived from this software without
+      specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/README.md

@@ -0,0 +1,39 @@
+=========
+jellyfish
+=========
+
+RubyFish is a ruby port of python library jellyfish (http://github.com/sunlightlabs/jellyfish) for doing approximate and phonetic matching of strings.
+
+RubyFish is a project of AnjLab (c) 2010.
+All code is released under a BSD-style license, see LICENSE for details.
+
+Originally written by
+Written by Michael Stephens <mstephens@sunlightfoundation.com> and James Turk
+<jturk@sunlightfoundation.com>.
+
+Ported by Yury Korolev <yury.korolev@gmail.com>
+Source is available at http://github.com/anjlab/rubyfish
+
+Included Algorithms
+===================
+
+String comparison:
+
+  * Levenshtein Distance
+  * Damerau-Levenshtein Distance
+  * Jaro Distance
+  * Jaro-Winkler Distance
+  * Hamming Distance
+  * Longest Substring
+  * Longest Subsequence
+
+Example Usage
+=============
+
+    ruby-1.9.2-p0 > require 'rubyfish'
+    ruby-1.9.2-p0 > RubyFish::Levenshtein.distance("jellyfish", "rubyfish")
+    => 4
+    ruby-1.9.2-p0 > RubyFish::Jaro.distance("jellyfish", "rubyfish")
+    => 0.7268518518518519
+    ruby-1.9.2-p0 > RubyFish::DamerauLevenshtein.distance("rubyfish", "rubyfihs")
+     => 1

data/ROADMAP.md

@@ -0,0 +1,3 @@
+ - Port MRA
+ - Port NYSIIS
+ - Add Double Metaphone

data/lib/rubyfish.rb

@@ -0,0 +1,12 @@
+#require "rubyfish/awesome"
+
+module RubyFish
+  autoload :Hamming, 'rubyfish/hamming'
+  autoload :Levenshtein, 'rubyfish/levenshtein'
+  autoload :DamerauLevenshtein, 'rubyfish/damerau_levenshtein'
+  autoload :LongestSubstring, 'rubyfish/longest_substring'
+  autoload :LongestSubsequence, 'rubyfish/longest_subsequence'
+  autoload :Jaro, 'rubyfish/jaro'
+  autoload :JaroWinkler, 'rubyfish/jaro_winkler'
+  autoload :MMatrix, 'rubyfish/mmatrix'
+end

data/lib/rubyfish/damerau_levenshtein.rb

@@ -0,0 +1,41 @@
+require 'matrix'
+
+module RubyFish::DamerauLevenshtein
+
+  def distance a, b
+    as = a.to_s
+    bs = b.to_s
+
+    rows = as.size + 1
+    cols = bs.size + 1
+
+    dist = ::RubyFish::MMatrix.new(rows, cols)
+
+    (0...rows).each {|i| dist[i, 0] = i}
+    (0...cols).each {|j| dist[0, j] = j}
+
+    (1...rows).each do |i|
+      (1...cols).each do |j|
+        cost = as[i - 1] == bs[j - 1] ? 0 : 1
+
+        #minimum of deletion, insertion, substitution
+        d1 = dist[i - 1, j] + 1
+        d2 = dist[i, j - 1] + 1
+        d3 = dist[i - 1, j - 1] + cost
+
+        d_now = [d1, d2, d3].min
+
+        if i > 2 && j > 2 && as[i - 1] == bs[j - 2] && as[i - 2] == bs[j - 1]
+          d1 = dist[i - 2, j - 2] + cost
+          d_now = [d_now, d1].min;
+        end
+
+        dist[i, j] = d_now;
+      end
+    end
+
+    dist[as.size, bs.size]
+  end
+
+  module_function :distance
+end

data/lib/rubyfish/hamming.rb

@@ -0,0 +1,14 @@
+module RubyFish::Hamming
+  def distance a, b
+    distance = 0
+    as, bs = a.to_s, b.to_s
+
+    short, long = [as, bs].sort
+
+    long.chars.zip(short.chars).each {|ac, bc| distance += 1 if ac != bc }
+
+    distance
+  end
+
+  module_function :distance
+end

data/lib/rubyfish/jaro.rb

@@ -0,0 +1,11 @@
+module RubyFish::Jaro
+  include ::RubyFish::JaroWinkler
+  extend ::RubyFish::JaroWinkler
+
+  def distance a, b
+    _distance(a, b, :winklerize => false)
+  end
+
+  module_function :distance
+
+end

data/lib/rubyfish/jaro_winkler.rb

@@ -0,0 +1,107 @@
+module RubyFish::JaroWinkler
+
+  def _distance a, b, opts = {}
+    long_tolerance = opts[:long_tolerance]
+    winklerize = opts[:winklerize]
+
+    as = a.to_s
+    bs = b.to_s
+
+    as_length = as.size
+    bs_length = bs.size
+
+    if as_length == 0 && bs_length == 0
+      return 1
+    end
+
+    if as_length == 0 || bs_length == 0
+      return 0
+    end
+
+    if as_length > bs_length
+      search_range = as_length
+      min_len = bs_length
+    else
+      search_range = bs_length
+      min_len = as_length
+    end
+
+    as_flag = Array.new(as_length + 1, false)
+    bs_flag = Array.new(bs_length + 1, false)
+
+    search_range = (search_range / 2) - 1
+    search_range = 0 if search_range < 0
+
+    # Looking only within the search range, count and flag the matched pairs.
+    common_chars = 0
+    (0...as_length).each do |i|
+      low_lim = (i >= search_range) ? i - search_range : 0
+      hi_lim = (i + search_range <= bs_length - 1) ? (i + search_range) : bs_length - 1
+      (low_lim..hi_lim).each do |j|
+         if !bs_flag[j] && bs[j] == as[i]
+            as_flag[i] = bs_flag[j] = true
+            common_chars += 1
+            break
+         end
+      end
+    end
+
+    # If no characters in common - return
+    return 0 if common_chars == 0
+
+    # Count the number of transpositions
+    k = trans_count = 0
+    (0...as_length).each do |i|
+       if as_flag[i]
+         for j in (k...bs_length) do
+           if bs_flag[j]
+              k = j + 1
+              break
+           end
+         end
+         trans_count += 1 if as[i] != bs[j]
+       end
+    end
+
+    trans_count = trans_count / 2
+
+    # adjust for similarities in nonmatched characters
+
+    one_third = 1.0/3
+    # Main weight computation.
+    weight = ( one_third * common_chars / as_length +
+               one_third * common_chars / bs_length +
+               one_third * (common_chars - trans_count) / common_chars )
+
+#    # Continue to boost the weight if the strings are similar
+    if winklerize && weight > 0.7
+      # Adjust for having up to the first 4 characters in common
+      j = (min_len >= 4) ? 4 : min_len
+      i = 0
+      while ((i<j)&&(as[i]==bs[i])&&((as[i].ord > 57) || (as[i].ord < 48)))
+        i+=1
+      end
+
+      weight += i * 0.1 * (1.0 - weight) if i > 0
+
+      # Optionally adjust for long strings.
+      #   After agreeing beginning chars, at least two more must agree and
+      #     the agreeing characters must be > .5 of remaining characters.
+      if long_tolerance && (min_len>4) && (common_chars > i+1) && (2 * common_chars >= min_len + i)
+        if as[0].ord > 57 || as[0].ord < 48
+            weight += (1.0 - weight) * (common_chars - i - 1) / (as_length + bs_length - i * 2 + 2).to_f
+        end
+      end
+    end
+
+    weight
+  end
+
+  def distance a, b, opts = {}
+    _distance(a, b, :winklerize => true)
+  end
+
+  module_function :distance
+  module_function :_distance
+
+end

data/lib/rubyfish/levenshtein.rb

@@ -0,0 +1,36 @@
+module RubyFish::Levenshtein
+
+  # http://en.wikipedia.org/wiki/Levenshtein_distance
+  def distance a, b
+    as, bs = a.to_s, b.to_s
+
+    as_length = as.size
+    bs_length = bs.size
+
+    rows = as_length + 1
+    cols = bs_length + 1
+
+    dist = ::RubyFish::MMatrix.new rows, cols
+    (0...rows).each {|i| dist[i, 0] = i}
+    (0...cols).each {|j| dist[0, j] = j}
+
+    (1...cols).each do |j|
+      (1...rows).each do |i|
+        if as[i - 1] == bs[j - 1]
+         dist[i, j] = dist[i - 1, j - 1]
+        else
+          d1 = dist[i - 1, j] + 1
+          d2 = dist[i, j - 1] + 1
+          d3 = dist[i - 1, j - 1] + 1
+
+          dist[i, j] = [d1, d2, d3].min;
+        end
+      end
+    end
+
+    dist[as_length, bs_length];
+  end
+
+  module_function :distance
+
+end

data/lib/rubyfish/longest_subsequence.rb

@@ -0,0 +1,34 @@
+module RubyFish::LongestSubsequence
+
+  # http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence#Ruby
+  def distance a, b
+    as = a.to_s
+    bs = b.to_s
+
+    rows = as.size
+    cols = bs.size
+
+    if rows == 0 || cols == 0
+      return 0
+    end
+
+    num = ::RubyFish::MMatrix.new  rows + 1, cols + 1
+
+    (1..rows).each do |i|
+      (1..cols).each do |j|
+        if as[i - 1] == bs[j - 1]
+          num[i, j] = num[i - 1, j - 1] + 1;
+        else
+          if num[i, j - 1] > num[i - 1, j]
+            num[i, j] = num[i, j - 1]
+          else
+            num[i, j] = num[i - 1, j]
+          end
+        end
+      end
+    end
+    num[rows, cols]
+  end
+
+  module_function :distance
+end

data/lib/rubyfish/longest_substring.rb

@@ -0,0 +1,34 @@
+module RubyFish::LongestSubstring
+
+  # http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_substring#Ruby
+  def distance a, b
+    as = a.to_s
+    bs = b.to_s
+
+    rows = as.size
+    cols = bs.size
+
+    if rows == 0 || cols == 0
+      return 0
+    end
+
+    num= ::RubyFish::MMatrix.new rows, cols
+    len,ans=0
+
+    as.each_char.with_index do |ac, i|
+      bs.each_char.with_index do |bc, j|
+        unless ac == bc
+          num[i, j]=0
+        else
+          (i==0 || j==0)? num[i, j] = 1 : num[i, j] = 1 + num[i-1, j-1]
+          len = ans = num[i, j] if num[i, j] > len
+        end
+      end
+    end
+
+    ans
+  end
+
+  module_function :distance
+
+end

data/lib/rubyfish/mmatrix.rb

@@ -0,0 +1,29 @@
+module RubyFish
+  class MMatrix
+    def initialize nrows, ncolumns
+      @rows = Array.new(nrows) { Array.new(ncolumns) {0}}
+    end
+
+    def [](i, j)
+      @rows[i][j]
+    end
+
+    def []=(i, j, v)
+      @rows[i][j] = v
+    end
+
+    def each_index
+      @rows.each_with_index do |r, i|
+        r.each_index do |j|
+          yield i, j
+        end
+      end
+    end
+
+    def each_with_index
+      each_index do |i, j|
+        yield self[i, j], i, j
+      end
+    end
+  end
+end

data/lib/rubyfish/mra.rb

@@ -0,0 +1,3 @@
+module RubyFish::MRA
+
+end

data/lib/rubyfish/version.rb

@@ -0,0 +1,3 @@
+module RubyFish
+  VERSION = "0.0.2"
+end

metadata

@@ -0,0 +1,82 @@
+--- !ruby/object:Gem::Specification 
+name: rubyfish
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 2
+  version: 0.0.2
+platform: ruby
+authors: 
+- Yury Korolev
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-09-20 00:00:00 +04:00
+default_executable: 
+dependencies: []
+
+description: Port of http://github.com/sunlightlabs/jellyfish
+email: 
+- yury.korolev@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- lib/rubyfish/damerau_levenshtein.rb
+- lib/rubyfish/hamming.rb
+- lib/rubyfish/jaro.rb
+- lib/rubyfish/jaro_winkler.rb
+- lib/rubyfish/levenshtein.rb
+- lib/rubyfish/longest_subsequence.rb
+- lib/rubyfish/longest_substring.rb
+- lib/rubyfish/mmatrix.rb
+- lib/rubyfish/mra.rb
+- lib/rubyfish/version.rb
+- lib/rubyfish.rb
+- LICENSE
+- CHANGELOG.md
+- README.md
+- ROADMAP.md
+has_rdoc: true
+homepage: http://github.com/anjlab/rubyfish
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 663674839144737507
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 1
+      - 3
+      - 6
+      version: 1.3.6
+requirements: []
+
+rubyforge_project: rubyfish
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: A new gem templates
+test_files: []
+