damerau-levenshtein 0.5.2 → 0.5.3

Sign up to get free protection for your applications and to get access to all the features.
data/README.rdoc CHANGED
@@ -3,7 +3,7 @@
3
3
  The damerau-levenshtein gem allows to find edit distance between two UTF-8 or ASCII encoded strings with O(N**2) efficiency.
4
4
 
5
5
  This gem implements pure Levenshtein algorithm, Damerau modification of it (where 2 character transposition counts as 1 edit distance).
6
- It also includes Boehmer & Rees 2008 modification of Damerau algorithm, where transposition of bigger than 1 character blocks is taken as 1 edit distance as well (Boehmer & Rees 2008).
6
+ It also includes Boehmer & Rees 2008 modification of Damerau algorithm, where transposition of bigger than 1 character blocks is taken in account as well (Boehmer & Rees 2008).
7
7
 
8
8
  require 'damerau-levenshtein'
9
9
  DamerauLevenshtein.distance('Something', 'Smoething') #returns 1
data/VERSION CHANGED
@@ -1 +1 @@
1
- 0.5.2
1
+ 0.5.3
@@ -5,14 +5,14 @@
5
5
 
6
6
  Gem::Specification.new do |s|
7
7
  s.name = %q{damerau-levenshtein}
8
- s.version = "0.5.2"
8
+ s.version = "0.5.3"
9
9
 
10
10
  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
11
- s.authors = ["Dmitry Mozzherin"]
11
+ s.authors = [%q{Dmitry Mozzherin}]
12
12
  s.date = %q{2011-07-23}
13
13
  s.description = %q{Calculation of editing distance for 2 strings using Levenshtein or Damerau-Levenshtein algorithms}
14
14
  s.email = %q{dmozzherin@gmail.com}
15
- s.extensions = ["ext/damerau_levenshtein_binding/extconf.rb"]
15
+ s.extensions = [%q{ext/damerau_levenshtein_binding/extconf.rb}]
16
16
  s.extra_rdoc_files = [
17
17
  "LICENSE.txt",
18
18
  "README.rdoc"
@@ -32,13 +32,12 @@ Gem::Specification.new do |s|
32
32
  "spec/spec_helper.rb"
33
33
  ]
34
34
  s.homepage = %q{http://github.com/dimus/damerau-levenshtein}
35
- s.licenses = ["MIT"]
36
- s.require_paths = ["lib"]
37
- s.rubygems_version = %q{1.3.7}
35
+ s.licenses = [%q{MIT}]
36
+ s.require_paths = [%q{lib}]
37
+ s.rubygems_version = %q{1.8.5}
38
38
  s.summary = %q{Calculation of editing distance for 2 strings using Levenshtein or Damerau-Levenshtein algorithms}
39
39
 
40
40
  if s.respond_to? :specification_version then
41
- current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
42
41
  s.specification_version = 3
43
42
 
44
43
  if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
metadata CHANGED
@@ -1,12 +1,8 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: damerau-levenshtein
3
3
  version: !ruby/object:Gem::Version
4
- prerelease: false
5
- segments:
6
- - 0
7
- - 5
8
- - 2
9
- version: 0.5.2
4
+ prerelease:
5
+ version: 0.5.3
10
6
  platform: ruby
11
7
  authors:
12
8
  - Dmitry Mozzherin
@@ -14,8 +10,7 @@ autorequire:
14
10
  bindir: bin
15
11
  cert_chain: []
16
12
 
17
- date: 2011-07-23 00:00:00 -04:00
18
- default_executable:
13
+ date: 2011-07-23 00:00:00 Z
19
14
  dependencies:
20
15
  - !ruby/object:Gem::Dependency
21
16
  name: rake-compiler
@@ -24,8 +19,6 @@ dependencies:
24
19
  requirements:
25
20
  - - ">="
26
21
  - !ruby/object:Gem::Version
27
- segments:
28
- - 0
29
22
  version: "0"
30
23
  type: :development
31
24
  prerelease: false
@@ -37,10 +30,6 @@ dependencies:
37
30
  requirements:
38
31
  - - ~>
39
32
  - !ruby/object:Gem::Version
40
- segments:
41
- - 2
42
- - 3
43
- - 0
44
33
  version: 2.3.0
45
34
  type: :development
46
35
  prerelease: false
@@ -52,8 +41,6 @@ dependencies:
52
41
  requirements:
53
42
  - - ">="
54
43
  - !ruby/object:Gem::Version
55
- segments:
56
- - 0
57
44
  version: "0"
58
45
  type: :development
59
46
  prerelease: false
@@ -65,10 +52,6 @@ dependencies:
65
52
  requirements:
66
53
  - - ~>
67
54
  - !ruby/object:Gem::Version
68
- segments:
69
- - 1
70
- - 0
71
- - 0
72
55
  version: 1.0.0
73
56
  type: :development
74
57
  prerelease: false
@@ -80,10 +63,6 @@ dependencies:
80
63
  requirements:
81
64
  - - ~>
82
65
  - !ruby/object:Gem::Version
83
- segments:
84
- - 1
85
- - 6
86
- - 0
87
66
  version: 1.6.0
88
67
  type: :development
89
68
  prerelease: false
@@ -95,8 +74,6 @@ dependencies:
95
74
  requirements:
96
75
  - - ">="
97
76
  - !ruby/object:Gem::Version
98
- segments:
99
- - 0
100
77
  version: "0"
101
78
  type: :development
102
79
  prerelease: false
@@ -108,8 +85,6 @@ dependencies:
108
85
  requirements:
109
86
  - - ">="
110
87
  - !ruby/object:Gem::Version
111
- segments:
112
- - 0
113
88
  version: "0"
114
89
  type: :development
115
90
  prerelease: false
@@ -121,8 +96,6 @@ dependencies:
121
96
  requirements:
122
97
  - - ">="
123
98
  - !ruby/object:Gem::Version
124
- segments:
125
- - 0
126
99
  version: "0"
127
100
  type: :development
128
101
  prerelease: false
@@ -134,8 +107,6 @@ dependencies:
134
107
  requirements:
135
108
  - - ">="
136
109
  - !ruby/object:Gem::Version
137
- segments:
138
- - 0
139
110
  version: "0"
140
111
  type: :development
141
112
  prerelease: false
@@ -147,8 +118,6 @@ dependencies:
147
118
  requirements:
148
119
  - - ">="
149
120
  - !ruby/object:Gem::Version
150
- segments:
151
- - 0
152
121
  version: "0"
153
122
  type: :development
154
123
  prerelease: false
@@ -176,7 +145,6 @@ files:
176
145
  - spec/damerau_levenshtein_test.txt
177
146
  - spec/spec_helper.rb
178
147
  - ext/damerau_levenshtein_binding/extconf.rb
179
- has_rdoc: true
180
148
  homepage: http://github.com/dimus/damerau-levenshtein
181
149
  licenses:
182
150
  - MIT
@@ -190,7 +158,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
190
158
  requirements:
191
159
  - - ">="
192
160
  - !ruby/object:Gem::Version
193
- hash: 1769781403176282343
161
+ hash: -3535294163359070239
194
162
  segments:
195
163
  - 0
196
164
  version: "0"
@@ -199,13 +167,11 @@ required_rubygems_version: !ruby/object:Gem::Requirement
199
167
  requirements:
200
168
  - - ">="
201
169
  - !ruby/object:Gem::Version
202
- segments:
203
- - 0
204
170
  version: "0"
205
171
  requirements: []
206
172
 
207
173
  rubyforge_project:
208
- rubygems_version: 1.3.7
174
+ rubygems_version: 1.8.5
209
175
  signing_key:
210
176
  specification_version: 3
211
177
  summary: Calculation of editing distance for 2 strings using Levenshtein or Damerau-Levenshtein algorithms