taxamatch_rb 0.6.5 → 0.7.4

data/Gemfile.lock

@@ -0,0 +1,75 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    archive-tar-minitar (0.5.2)
+    biodiversity (0.5.16)
+      json
+      treetop
+    biodiversity19 (0.5.16)
+      json
+      treetop
+    builder (3.0.0)
+    columnize (0.3.3)
+    cucumber (1.0.0)
+      builder (>= 2.1.2)
+      diff-lcs (>= 1.1.2)
+      gherkin (~> 2.4.1)
+      json (>= 1.4.6)
+      term-ansicolor (>= 1.0.5)
+    diff-lcs (1.1.2)
+    gherkin (2.4.1)
+      json (>= 1.4.6)
+    git (1.2.5)
+    jeweler (1.6.2)
+      bundler (~> 1.0)
+      git (>= 1.2.5)
+      rake
+    json (1.5.3)
+    linecache19 (0.5.12)
+      ruby_core_source (>= 0.1.4)
+    mocha (0.9.12)
+    polyglot (0.3.1)
+    rake (0.9.2)
+    rake-compiler (0.7.9)
+      rake
+    rcov (0.9.9)
+    rspec (2.3.0)
+      rspec-core (~> 2.3.0)
+      rspec-expectations (~> 2.3.0)
+      rspec-mocks (~> 2.3.0)
+    rspec-core (2.3.1)
+    rspec-expectations (2.3.0)
+      diff-lcs (~> 1.1.2)
+    rspec-mocks (2.3.0)
+    ruby-debug-base19 (0.11.25)
+      columnize (>= 0.3.1)
+      linecache19 (>= 0.5.11)
+      ruby_core_source (>= 0.1.4)
+    ruby-debug19 (0.11.6)
+      columnize (>= 0.3.1)
+      linecache19 (>= 0.5.11)
+      ruby-debug-base19 (>= 0.11.19)
+    ruby-prof (0.10.7)
+    ruby_core_source (0.1.5)
+      archive-tar-minitar (>= 0.5.2)
+    shoulda (2.11.3)
+    term-ansicolor (1.0.5)
+    treetop (1.4.9)
+      polyglot (>= 0.3.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  biodiversity (~> 0.5.13)
+  biodiversity19 (~> 0.5.13)
+  bundler (~> 1.0.0)
+  cucumber
+  jeweler (~> 1.6.0)
+  mocha
+  rake-compiler
+  rcov
+  rspec (~> 2.3.0)
+  ruby-debug19
+  ruby-prof
+  shoulda

data/README.rdoc

@@ -14,11 +14,7 @@ Taxamatch_Rb is compatible with ruby versions 1.8.7 and 1.9.1 and higher
 
 == Installation
 
-    sudo gem install dimus-taxamatch_rb --source http://gems.github.com
-
-or
-    sudo gem sources -a http://gems.github.com #(you only have to do this once)
-    sudo gem install dimus-taxamatch_rb
+    sudo gem install taxamatch_rb
 
 == Usage
 

data/ext/damerau_levenshtein/extconf.rb

@@ -0,0 +1,11 @@
+# Loads mkmf which is used to make makefiles for Ruby extensions
+require 'mkmf'
+
+# Give it a name
+extension_name = 'damerau_levenshtein'
+
+# The destination
+dir_config(extension_name)
+
+# Do the work
+create_makefile(extension_name)

data/lib/taxamatch_rb.rb

@@ -8,38 +8,38 @@ require 'taxamatch_rb/normalizer'
 require 'taxamatch_rb/phonetizer'
 require 'taxamatch_rb/authmatch'
 
-$KCODE='u' if RUBY_VERSION.split('.')[1].to_i < 9  
+$KCODE='u' if RUBY_VERSION.split('.')[1].to_i < 9
 
 module Taxamatch
 
   class Base
-  
+
     def initialize
       @parser = Taxamatch::Atomizer.new
       @dlm = Taxamatch::DamerauLevenshteinMod.new
     end
-   
-   
+
+
     #takes two scientific names and returns true if names match and false if they don't
-    def taxamatch(str1, str2, return_boolean = true) 
+    def taxamatch(str1, str2, return_boolean = true)
       preparsed_1 = @parser.parse(str1)
       preparsed_2 = @parser.parse(str2)
       match = taxamatch_preparsed(preparsed_1, preparsed_2) rescue nil
       return_boolean ? (!!match && match['match']) : match
     end
-  
-    #takes two hashes of parsed scientific names, analyses them and returns back 
+
+    #takes two hashes of parsed scientific names, analyses them and returns back
     #this function is useful when species strings are preparsed.
     def taxamatch_preparsed(preparsed_1, preparsed_2)
       result = nil
-      result =  match_uninomial(preparsed_1, preparsed_2) if preparsed_1[:uninomial] && preparsed_2[:uninomial] 
+      result =  match_uninomial(preparsed_1, preparsed_2) if preparsed_1[:uninomial] && preparsed_2[:uninomial]
       result =  match_multinomial(preparsed_1, preparsed_2) if preparsed_1[:genus] && preparsed_2[:genus]
       if result && result['match']
-        result['match'] = match_authors(preparsed_1, preparsed_2) == 0 ? false : true 
+        result['match'] = match_authors(preparsed_1, preparsed_2) == 0 ? false : true
       end
       return result
     end
-  
+
     def match_uninomial(preparsed_1, preparsed_2)
       match_genera(preparsed_1[:uninomial], preparsed_2[:uninomial])
     end
@@ -54,14 +54,14 @@ module Taxamatch
         match_hash = match_matches(gen_match, sp_match, infrasp_match)
       elsif (preparsed_1[:infraspecies] && !preparsed_2[:infraspecies]) || (!preparsed_1[:infraspecies] && preparsed_2[:infraspecies])
         match_hash = { 'match' => false, 'edit_distance' => 5, 'phonetic_match' => false }
-        total_length += preparsed_1[:infraspecies] ? preparsed_1[:infraspecies][0][:string].size : preparsed_2[:infraspecies][0][:string].size 
+        total_length += preparsed_1[:infraspecies] ? preparsed_1[:infraspecies][0][:string].size : preparsed_2[:infraspecies][0][:string].size
       else
         match_hash = match_matches(gen_match, sp_match)
       end
       match_hash.merge({'score' => (1 - match_hash['edit_distance']/(total_length/2))})
       match_hash
     end
-  
+
     def match_genera(genus1, genus2)
       genus1_length = genus1[:normalized].size
       genus2_length = genus2[:normalized].size
@@ -69,10 +69,10 @@ module Taxamatch
       match = false
       ed = @dlm.distance(genus1[:normalized], genus2[:normalized],1,3) #TODO put block = 2
       return {'edit_distance' => ed, 'phonetic_match' => false, 'match' => false} if ed/min_length.to_f > 0.2
-      return {'edit_distance' => ed, 'phonetic_match' => true, 'match' => true} if genus1[:phonetized] == genus2[:phonetized] 
-    
+      return {'edit_distance' => ed, 'phonetic_match' => true, 'match' => true} if genus1[:phonetized] == genus2[:phonetized]
+
       match = true if ed <= 3 && (min_length > ed * 2) && (ed < 2 || genus1[0] == genus2[0])
-      {'edit_distance' => ed, 'match' => match, 'phonetic_match' => false} 
+      {'edit_distance' => ed, 'match' => match, 'phonetic_match' => false}
     end
 
     def match_species(sp1, sp2)
@@ -86,11 +86,11 @@ module Taxamatch
       return {'edit_distance' => ed, 'phonetic_match' => false, 'match' => false} if ed/min_length.to_f > 0.3334
       #puts 's: %s, %s, %s' % [sp1[:normalized], sp2[:normalized], ed]
       return {'edit_distance' => ed, 'phonetic_match' => true, 'match' => true} if sp1[:phonetized] == sp2[:phonetized]
-    
+
       match = true if ed <= 4 && (min_length >= ed * 2) && (ed < 2 || sp1[:normalized][0] == sp2[:normalized][0]) && (ed < 4 || sp1[:normalized][0...3] == sp2[:normalized][0...3])
       { 'edit_distance' => ed, 'match' => match, 'phonetic_match' => false}
     end
-  
+
     def match_authors(preparsed_1, preparsed_2)
       au1 = preparsed_1[:all_authors]
       au2 = preparsed_2[:all_authors]
@@ -98,8 +98,8 @@ module Taxamatch
       yr2 = preparsed_2[:all_years]
       Taxamatch::Authmatch.authmatch(au1, au2, yr1, yr2)
     end
-  
-    def match_matches(genus_match, species_match, infraspecies_match = nil) 
+
+    def match_matches(genus_match, species_match, infraspecies_match = nil)
       match = species_match
       if infraspecies_match
         match['edit_distance'] += infraspecies_match['edit_distance']

data/lib/taxamatch_rb/damerau_levenshtein_mod.rb

@@ -1,122 +1,25 @@
 # encoding: UTF-8
-require 'rubygems'
-require 'inline'
-require 'time'
+
+require File.join(File.dirname(__FILE__), 'damerau_levenshtein')
+
 module Taxamatch
 
   class DamerauLevenshteinMod
+    include DamerauLevenshtein
+
     def distance(str1, str2, block_size=2, max_distance=10)
-      # puts str1.unpack("U*");
       distance_utf(str1.unpack("U*"), str2.unpack("U*"), block_size, max_distance)
     end
-
-    inline do |builder|
-      builder.c "
-      static VALUE distance_utf(VALUE _s, VALUE _t, int block_size, int max_distance){
-        int i, i1, j, j1, k, sl, half_sl, tl, half_tl, cost, *d, distance, del, ins, subs, transp, block;
-        int stop_execution = 0;
-        int min = 0;
-        int current_distance = 0;
-
-        VALUE *sv = RARRAY_PTR(_s);
-        VALUE *tv = RARRAY_PTR(_t);
-      
-        sl = RARRAY_LEN(_s);
-        tl = RARRAY_LEN(_t);
-      
-        if (sl == 0) return INT2NUM(tl);
-        if (tl == 0) return INT2NUM(sl);
-        //case of lengths 1 must present or it will break further in the code
-        if (sl == 1 && tl == 1 && sv[0] != tv[0]) return INT2NUM(1);
-      
-        int s[sl];
-        int t[tl];
-      
-        for (i=0; i < sl; i++) s[i] = NUM2INT(sv[i]);
-        for (i=0; i < tl; i++) t[i] = NUM2INT(tv[i]);
-      
-        sl++;
-        tl++;
-      
-        //one-dimentional representation of 2 dimentional array len(s)+1 * len(t)+1
-        d = malloc((sizeof(int))*(sl)*(tl));
-        //populate 'vertical' row starting from the 2nd position (first one is filled already)
-        for(i = 0; i < tl; i++){
-          d[i*sl] = i;
-        }
-      
-        //fill up array with scores
-        for(i = 1; i<sl; i++){
-          d[i] = i;
-          if (stop_execution == 1) break;
-          current_distance = 10000;
-          for(j = 1; j<tl; j++){
-          
-            cost = 1;
-            if(s[i-1] == t[j-1]) cost = 0;
-          
-            half_sl = (sl - 1)/2;
-            half_tl = (tl - 1)/2;
-          
-            block = block_size < half_sl ? block_size : half_sl;
-            block = block < half_tl ? block : half_tl;
-          
-            while (block >= 1){   
-              int swap1 = 1;
-              int swap2 = 1;
-              i1 = i - (block * 2);
-              j1 = j - (block * 2);
-              for (k = i1; k < i1 + block; k++) {
-                if (s[k] != t[k + block]){
-                  swap1 = 0;
-                  break;
-                }
-              }
-              for (k = j1; k < j1 + block; k++) {
-                if (t[k] != s[k + block]){
-                  swap2 = 0;
-                  break;
-                }
-              }
-            
-              del = d[j*sl + i - 1] + 1; 
-              ins = d[(j-1)*sl + i] + 1;
-              min = del;
-              if (ins < min) min = ins;
-              //if (i == 2 && j==2) return INT2NUM(swap2+5); 
-              if (i >= block && j >= block && swap1 == 1 && swap2 == 1){
-                transp = d[(j - block * 2) * sl + i - block * 2] + cost + block -1; 
-                if (transp < min) min = transp;
-                block = 0;
-              } else if (block == 1) {
-                subs = d[(j-1)*sl + i - 1] + cost;
-                if (subs < min) min = subs;
-              }
-              block--;
-            } 
-            d[j*sl+i]=min;          
-            if (current_distance > d[j*sl+i]) current_distance = d[j*sl+i];
-          }
-          if (current_distance > max_distance) {
-            stop_execution = 1;
-          }
-        }
-        distance=d[sl * tl - 1];
-        if (stop_execution == 1) distance = current_distance;
-      
-        free(d);
-        return INT2NUM(distance);
-      }
-     "
-    end
   end
+
 end
 
 if __FILE__ == $0
-  a=Taxamatch::DamerauLevenshteinMod.new
+
+  a = Taxamatch::DamerauLevenshteinMod.new
   s = 'Cedarinia scabra Sjöstedt 1921'.unpack('U*')
   t = 'Cedarinia scabra Söjstedt 1921'.unpack('U*')
-  
+
   #puts s.join(",")
   #puts t.join(",")
 
@@ -133,7 +36,7 @@ if __FILE__ == $0
   puts 'utf time: ' + (Time.now - start).to_s + ' sec'
 
   #puts a.distance('Cedarinia scabra Sjöstedt 1921','Cedarinia scabra Söjstedt 1921')
-  #puts a.distance_utf(s, t, 2, 10) 
+  #puts a.distance_utf(s, t, 2, 10)
   #puts a.distance('tar','atp',1,10);
   puts a.distance('sub', 'usb', 1, 10);
 end

data/spec/damerau_levenshtein_mod_test.txt

@@ -60,4 +60,4 @@ Pxxxxomus|Pomatomus|10|1|4
 Pxxxxomus|Pomatomus|2|1|3
 
 #
-PUNCTATA|PUNCTATA|10|1|0
+PUNCTATA|PUNCTATA|10|1|0

data/spec/spec_helper.rb

@@ -1,10 +1,4 @@
-begin
-  require 'spec'
-rescue LoadError
-  require 'rubygems' unless ENV['NO_RUBYGEMS']
-  gem 'rspec'
-  require 'spec'
-end
+require 'rspec'
 
 $:.unshift(File.dirname(__FILE__) + '/../lib')
 require 'taxamatch_rb'

data/spec/taxamatch_rb_spec.rb

@@ -1,5 +1,5 @@
 # encoding: UTF-8
-require File.dirname(__FILE__) + '/spec_helper.rb'
+require 'spec_helper'
 
 describe 'DamerauLevenshteinMod' do
   it 'should get tests' do
@@ -7,7 +7,7 @@ describe 'DamerauLevenshteinMod' do
       dl = Taxamatch::DamerauLevenshteinMod.new
       if y
         res = dl.distance(y[0], y[1], y[3].to_i, y[2].to_i)
-        #puts y if res != y[4].to_i
+        puts y if res != y[4].to_i
         res.should == y[4].to_i
       end
     end
@@ -18,17 +18,17 @@ describe 'Atomizer' do
   before(:all) do
     @parser = Taxamatch::Atomizer.new
   end
-  
+
   it 'should parse uninomials' do
     @parser.parse('Betula').should == {:all_authors=>[], :all_years=>[], :uninomial=>{:string=>"Betula", :normalized=>"BETULA", :phonetized=>"BITILA", :authors=>[], :years=>[], :normalized_authors=>[]}}
     @parser.parse('Ærenea Lacordaire, 1872').should == {:all_authors=>["LACORDAIRE"], :all_years=>["1872"], :uninomial=>{:string=>"Aerenea", :normalized=>"AERENEA", :phonetized=>"ERINIA", :authors=>["Lacordaire"], :years=>["1872"], :normalized_authors=>["LACORDAIRE"]}}
   end
-  
+
   it 'should parse binomials' do
     @parser.parse('Leœptura laetifica Dow, 1913').should == {:all_authors=>["DOW"], :all_years=>["1913"], :genus=>{:string=>"Leoeptura", :normalized=>"LEOEPTURA", :phonetized=>"LIPTIRA", :authors=>[], :years=>[], :normalized_authors=>[]}, :species=>{:string=>"laetifica", :normalized=>"LAETIFICA", :phonetized=>"LITIFICA", :authors=>["Dow"], :years=>["1913"], :normalized_authors=>["DOW"]}}
   end
-  
-  it 'should parse trinomials' do 
+
+  it 'should parse trinomials' do
     @parser.parse('Hydnellum scrobiculatum zonatum (Banker) D. Hall et D.E. Stuntz 1972').should == {:all_authors=>["BANKER", "D HALL", "D E STUNTZ"], :all_years=>["1972"], :genus=>{:string=>"Hydnellum", :normalized=>"HYDNELLUM", :phonetized=>"HIDNILIM", :authors=>[], :years=>[], :normalized_authors=>[]}, :species=>{:string=>"scrobiculatum", :normalized=>"SCROBICULATUM", :phonetized=>"SCRABICILATA", :authors=>[], :years=>[], :normalized_authors=>[]}, :infraspecies=>[{:string=>"zonatum", :normalized=>"ZONATUM", :phonetized=>"ZANATA", :authors=>["Banker", "D. Hall", "D.E. Stuntz"], :years=>["1972"], :normalized_authors=>["BANKER", "D HALL", "D E STUNTZ"]}]}
   end
 end
@@ -42,7 +42,7 @@ describe 'Taxamatch::Normalizer' do
     Taxamatch::Normalizer.normalize('Fallén').should == 'FALLEN'
     Taxamatch::Normalizer.normalize('Choriozopella trägårdhi').should == 'CHORIOZOPELLA TRAGARDHI'
   end
-  
+
   it 'should normalize words' do
     Taxamatch::Normalizer.normalize_word('L-3eœ|pt[ura$').should == 'L-3EOEPTURA'
   end
@@ -52,25 +52,25 @@ describe 'Taxamatch::Base' do
   before(:all) do
     @tm = Taxamatch::Base.new
   end
-  
+
   it 'should get txt tests' do
     dl = Taxamatch::DamerauLevenshteinMod.new
     read_test_file(File.expand_path(File.dirname(__FILE__)) + '/taxamatch_test.txt', 4) do |y|
       if y
         y[2] = y[2] == 'true' ? true : false
         res = @tm.taxamatch(y[0], y[1], false)
-        puts "%s, %s, %s, %s" % [y[0], y[1], y[2], y[3]] 
+        puts "%s, %s, %s, %s" % [y[0], y[1], y[2], y[3]]
         res['match'].should == y[2]
         res['edit_distance'].should == y[3].to_i
       end
     end
   end
-  
+
   it 'should work with names that cannot be parsed' do
     res = @tm.taxamatch('Quadraspidiotus ostreaeformis MacGillivray, 1921','Quadraspidiotus ostreaeformis Curtis)')
     res = false
   end
-  
+
   it 'should compare genera' do
     #edit distance 1 always match
     g1 = make_taxamatch_hash 'Plantago'
@@ -138,17 +138,17 @@ describe 'Taxamatch::Base' do
     #Should not match if Distance 2 or 3 and first 1 char is not the same
     s1 = make_taxamatch_hash 'morrrr'
     s2 = make_taxamatch_hash 'torraa'
-    @tm.match_species(s1, s2).should == {'phonetic_match' => false, 'match' => false, 'edit_distance' => 3} 
+    @tm.match_species(s1, s2).should == {'phonetic_match' => false, 'match' => false, 'edit_distance' => 3}
     #Distance 1 will match anywhere
     s1 = make_taxamatch_hash 'major'
     s2 = make_taxamatch_hash 'rajor'
-    @tm.match_species(s1, s2).should == {'phonetic_match' => false, 'match' => true, 'edit_distance' => 1} 
+    @tm.match_species(s1, s2).should == {'phonetic_match' => false, 'match' => true, 'edit_distance' => 1}
     #Will not match if distance 3 and length is less then twice of the edit distance
     s1 = make_taxamatch_hash 'marrr'
     s2 = make_taxamatch_hash 'maaaa'
     @tm.match_species(s1, s2).should == {'phonetic_match' => false, 'match' => false, 'edit_distance' => 3}
   end
-  
+
   it 'should match matches' do
     #No trobule case
     gmatch = {'match' => true, 'phonetic_match' => true, 'edit_distance' => 1}
@@ -159,7 +159,7 @@ describe 'Taxamatch::Base' do
     smatch = {'match' => true, 'phonetic_match' => true, 'edit_distance' => 1}
     @tm.match_matches(gmatch, smatch).should == {'phonetic_match'=>false, 'edit_distance'=>2, 'match'=>false}
     gmatch = {'match' => true, 'phonetic_match' => true, 'edit_distance' => 1}
-    smatch = {'match' => false, 'phonetic_match' => false, 'edit_distance' => 1}    
+    smatch = {'match' => false, 'phonetic_match' => false, 'edit_distance' => 1}
     @tm.match_matches(gmatch, smatch).should == {'phonetic_match'=>false, 'edit_distance'=>2, 'match'=>false}
     #Should not match if binomial edit distance > 4 NOTE: EVEN with full phonetic match
     gmatch = {'match' => true, 'phonetic_match' => true, 'edit_distance' => 3}
@@ -188,7 +188,7 @@ describe 'Taxamatch::Base' do
     before(:all) do
       @am = Taxamatch::Authmatch
     end
-    
+
     it 'should calculate score' do
       res = @am.authmatch(['Linnaeus', 'Muller'], ['L'], [], [1788])
       res.should == 90
@@ -219,22 +219,22 @@ describe 'Taxamatch::Base' do
       res = @am.authmatch(['Stepanov', 'Linnaeus', 'Muller'], ['Muller', 'Kurtz', 'Stepanov'], [1766], [1765])
       res.should == 0
     end
-    
+
     it 'should compare years' do
       @am.compare_years([1882],[1880]).should == 2
       @am.compare_years([1882],[]).should == nil
       @am.compare_years([],[]).should == 0
       @am.compare_years([1788,1798], [1788,1798]).should be_nil
     end
-    
-    it 'should remove duplicate authors' do 
+
+    it 'should remove duplicate authors' do
       #Li submatches Linnaeus and it its size 3 is big enought to remove Linnaeus
       #Muller is identical
       res = @am.remove_duplicate_authors(['Lin', 'Muller'], ['Linnaeus', 'Muller'])
       res.should == [[], []]
       #same in different order
       res = @am.remove_duplicate_authors(['Linnaeus', 'Muller'], ['Linn', 'Muller'])
-      res.should == [[], []]      
+      res.should == [[], []]
       #auth Li submatches Linnaeus, but Li size less then 3 required to remove Linnaeus
       res = @am.remove_duplicate_authors(['Dem', 'Li'], ['Linnaeus', 'Stepanov'])
       res.should == [["Dem"], ["Linnaeus", "Stepanov"]]
@@ -252,7 +252,7 @@ describe 'Taxamatch::Base' do
       # res = @am.fuzzy_match_authors('L', 'Muller')
       # res.should be_false
     end
-    
+
   end
 
 end

metadata

@@ -4,9 +4,9 @@ version: !ruby/object:Gem::Version
   prerelease: false
   segments: 
   - 0
-  - 6
-  - 5
-  version: 0.6.5
+  - 7
+  - 4
+  version: 0.7.4
 platform: ruby
 authors: 
 - Dmitry Mozzherin
@@ -14,13 +14,42 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-10-07 00:00:00 -04:00
+date: 2011-06-23 00:00:00 -04:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
-  name: RubyInline
-  prerelease: false
+  name: biodiversity
   requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 5
+        - 13
+        version: 0.5.13
+  type: :runtime
+  prerelease: false
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: biodiversity19
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 5
+        - 13
+        version: 0.5.13
+  type: :runtime
+  prerelease: false
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: rake-compiler
+  requirement: &id003 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ">="
@@ -29,11 +58,134 @@ dependencies:
         - 0
         version: "0"
   type: :runtime
-  version_requirements: *id001
+  prerelease: false
+  version_requirements: *id003
 - !ruby/object:Gem::Dependency 
-  name: biodiversity
+  name: rspec
+  requirement: &id004 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 3
+        - 0
+        version: 2.3.0
+  type: :development
   prerelease: false
-  requirement: &id002 !ruby/object:Gem::Requirement 
+  version_requirements: *id004
+- !ruby/object:Gem::Dependency 
+  name: cucumber
+  requirement: &id005 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id005
+- !ruby/object:Gem::Dependency 
+  name: bundler
+  requirement: &id006 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 0
+        - 0
+        version: 1.0.0
+  type: :development
+  prerelease: false
+  version_requirements: *id006
+- !ruby/object:Gem::Dependency 
+  name: jeweler
+  requirement: &id007 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 6
+        - 0
+        version: 1.6.0
+  type: :development
+  prerelease: false
+  version_requirements: *id007
+- !ruby/object:Gem::Dependency 
+  name: rcov
+  requirement: &id008 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id008
+- !ruby/object:Gem::Dependency 
+  name: ruby-debug19
+  requirement: &id009 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id009
+- !ruby/object:Gem::Dependency 
+  name: ruby-prof
+  requirement: &id010 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id010
+- !ruby/object:Gem::Dependency 
+  name: shoulda
+  requirement: &id011 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id011
+- !ruby/object:Gem::Dependency 
+  name: mocha
+  requirement: &id012 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  prerelease: false
+  version_requirements: *id012
+- !ruby/object:Gem::Dependency 
+  name: biodiversity
+  requirement: &id013 !ruby/object:Gem::Requirement 
     none: false
     requirements: 
     - - ">="
@@ -44,21 +196,37 @@ dependencies:
         - 13
         version: 0.5.13
   type: :runtime
-  version_requirements: *id002
+  prerelease: false
+  version_requirements: *id013
+- !ruby/object:Gem::Dependency 
+  name: rake-compiler
+  requirement: &id014 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  prerelease: false
+  version_requirements: *id014
 description: This gem implements algorithm for fuzzy matching scientific names developed by Tony Rees
 email: dmozzherin@eol.org
 executables: []
 
-extensions: []
-
+extensions: 
+- ext/damerau_levenshtein/extconf.rb
 extra_rdoc_files: 
 - LICENSE
 - README.rdoc
 files: 
+- Gemfile.lock
 - README.rdoc
 - lib/taxamatch_rb.rb
 - lib/taxamatch_rb/atomizer.rb
 - lib/taxamatch_rb/authmatch.rb
+- lib/taxamatch_rb/damerau_levenshtein.bundle
 - lib/taxamatch_rb/damerau_levenshtein_mod.rb
 - lib/taxamatch_rb/normalizer.rb
 - lib/taxamatch_rb/phonetizer.rb
@@ -68,13 +236,14 @@ files:
 - spec/taxamatch_rb_spec.rb
 - spec/taxamatch_test.txt
 - LICENSE
+- ext/damerau_levenshtein/extconf.rb
 has_rdoc: true
 homepage: http://github.com/GlobalNamesArchitecture/taxamatch_rb
 licenses: []
 
 post_install_message: 
-rdoc_options: 
-- --charset=UTF-8
+rdoc_options: []
+
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
@@ -82,6 +251,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: -2865757795593253659
       segments: 
       - 0
       version: "0"
@@ -100,6 +270,5 @@ rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3
 summary: Implementation of Tony Rees Taxamatch algorithms
-test_files: 
-- spec/spec_helper.rb
-- spec/taxamatch_rb_spec.rb
+test_files: []
+