spell_check 0.0.1 → 0.0.2

checksums.yaml

@@ -1,15 +1,7 @@
 ---
-!binary "U0hBMQ==":
-  metadata.gz: !binary |-
-    ZDVjNDRmYmQ4YzE4Mjc4ZmYxNTRiYTA3OGM2ODBkNjJiYWU0Yzk4NA==
-  data.tar.gz: !binary |-
-    M2M0MzI4MTU1N2MzMTEwZTEzZTc2YWZmM2I1ZWUxZDNmNmFiNjczYw==
+SHA1:
+  metadata.gz: ce688713ddfae655795ef42d25a7dff3b28589bf
+  data.tar.gz: 2cdcd1423e1ea0ba48262fc9de1a00f4e681c10d
 SHA512:
-  metadata.gz: !binary |-
-    MDcyYjE0MGIxNTZkMTFkYmM1NWZmN2I0MWIxMzUyNDAxNjE3YmMzMTQ0MjMw
-    NmU5NDc1ZjY0MmY1OWI2MGYxYTY2NGJkODIzMDcxNmI1NTE4YWI1MTczN2Q0
-    YWE1YTI5Y2UzM2Q3MDk2Y2IxNDhiNTJlMDMxMzIzZmIwMmRmMDk=
-  data.tar.gz: !binary |-
-    NDJkMjE1ZDM1MmExNjdjYTJiNzcwZDczNTZjNzM5MWM3NzI4MDUyN2E1Njdh
-    MzEzYzVhNzI5MzcyYTRiOTNkZjViYTc0MjUyYjczZjhkZDhlOTVlNDczNzY0
-    NTcwODZkMTBiYzRhNmQ3M2Y1NGQ0OWNiMjFkZTIyMTU0ZDE2Mzg=
+  metadata.gz: 0ede83eda143f02a3fdd5c8a424f29b74109416c53ef3d41dd23344056b90092df571ab0302136c271d98a3c3dddfa2d9a7c0fa909ac5f04e9a8b3a2ace9bb1e
+  data.tar.gz: 06cb4b8abab0a51435ae43532fd22c977fcbff4c4d60c7a5650f6d83837aed127f6c5c1556f9e594d1a5779b82c2b7186275e6a06818bc3961ee8af6501d660c

data/lib/spell_check.rb

@@ -1,5 +1,6 @@
 require 'spell_check/version'
 require 'spell_check/dictionary'
+require 'levenshtein'
 
 module SpellCheck
 
@@ -18,11 +19,11 @@ module SpellCheck
     word = adjust_case( aWordToCheck )
 
     # Attempt to see if input word is found before doing regular expression search
-    corrected_word = @dict.find_word(word)
+    corrected_word = @dict.find_word word
     return corrected_word unless corrected_word.nil?
 
     # Input word was not found, so try matching regular expression
-    corrected_word = correct_repetitions(word)
+    corrected_word = correct_repetitions word
     return corrected_word unless corrected_word.nil?
 
     return not_found
@@ -67,7 +68,7 @@ private
 
   # Builds a RegExp object and then matches it against the dictionary values
   # @param [String] word
-  # @return [Array]
+  # @return [Set]
   def self.find_reg_ex_matches( word )
     reg_ex = build_reg_ex word
     @dict.find_reg_ex_matches reg_ex
@@ -89,41 +90,12 @@ private
   # Given a set of words that are possible corrections for the input word, this method compares the corrected words
   # to the input and returns to closest matching correction using Levenshtein distance.
   # @param [String] word
-  # @param [Array] matches
+  # @param [Set] matches
+  # @return [Array]
   def self.get_best_match( word, matches )
     lev_array = matches.to_a
-    lev_array.sort! { |x,y| levenshtein_distance(x,word) <=> levenshtein_distance(y,word)}
+    lev_array.sort! { |x,y| Levenshtein.distance(x,word) <=> Levenshtein.distance(y,word)}
     lev_array.first # lowest number of changes means closest match to original input
   end
 
-  # The Levenshtein Distance algorithm measures the number of changes required to match two strings.  For this reason
-  # it is a good method to compare the similarity of strings.  Please note that this code was sourced at
-  # http://stackoverflow.com/questions/16323571/measure-the-distance-between-two-strings-with-ruby
-  # @param [String] s
-  # @param [String] t
-  # @return [Integer]
-  def self.levenshtein_distance(s, t)
-    m = s.length
-    n = t.length
-    return m if n == 0
-    return n if m == 0
-    d = Array.new(m+1) {Array.new(n+1)}
-
-    (0..m).each {|i| d[i][0] = i}
-    (0..n).each {|j| d[0][j] = j}
-    (1..n).each do |j|
-      (1..m).each do |i|
-        d[i][j] = if s[i-1] == t[j-1]  # adjust index into string
-                    d[i-1][j-1]       # no operation required
-                  else
-                    [ d[i-1][j]+1,    # deletion
-                      d[i][j-1]+1,    # insertion
-                      d[i-1][j-1]+1,  # substitution
-                    ].min
-                  end
-      end
-    end
-    d[m][n]
-  end
-
 end

data/lib/spell_check/version.rb

@@ -1,3 +1,3 @@
 module SpellCheck
-  VERSION = "0.0.1"
+  VERSION = '0.0.2'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: spell_check
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Solberg, Garrick L
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-09-23 00:00:00.000000000 Z
+date: 2014-09-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -38,9 +38,9 @@ dependencies:
     - - ~>
       - !ruby/object:Gem::Version
         version: '0'
-description: ! "Checks if a word exists in text dictionary.  If it does not, this
-  gem will attempt to correct\n                          the input by changing repeated
-  characters and case."
+description: |-
+  Checks if a word exists in text dictionary.  If it does not, this gem will attempt to correct
+                            the input by changing repeated characters and case.
 email:
 - Garrick.Solberg@gmail.com
 executables: []
@@ -61,12 +61,12 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []