aboutsummaryrefslogtreecommitdiffstats
path: root/railties/lib/rails/command
diff options
context:
space:
mode:
authorGuillermo Iguaran <guilleiguaran@gmail.com>2018-03-29 11:05:47 -0500
committerGitHub <noreply@github.com>2018-03-29 11:05:47 -0500
commit480595e4919256ce692cb43f53ef05cb43d93cff (patch)
treee2ea880c72c1ce012a1ee2d6cbf85fb8fed65701 /railties/lib/rails/command
parent1765f09b10483f69fd13c238db7122179d8b4e6a (diff)
parentcb25f2c989588edf77f978820196b4446e01ffe8 (diff)
downloadrails-480595e4919256ce692cb43f53ef05cb43d93cff.tar.gz
rails-480595e4919256ce692cb43f53ef05cb43d93cff.tar.bz2
rails-480595e4919256ce692cb43f53ef05cb43d93cff.zip
Merge pull request #32289 from gsamokovarov/did-you-mean-suggestions
Use `did_you_mean` spell checker for option suggestions
Diffstat (limited to 'railties/lib/rails/command')
-rw-r--r--railties/lib/rails/command/spellchecker.rb46
1 files changed, 2 insertions, 44 deletions
diff --git a/railties/lib/rails/command/spellchecker.rb b/railties/lib/rails/command/spellchecker.rb
index 59ccab4ea2..154358cd45 100644
--- a/railties/lib/rails/command/spellchecker.rb
+++ b/railties/lib/rails/command/spellchecker.rb
@@ -3,50 +3,8 @@
module Rails
module Command
module Spellchecker # :nodoc:
- class << self
- def suggest(word, from:, count: 3)
- from.sort_by { |w| levenshtein_distance(word, w) }.take(count)
- end
-
- private
- # This code is based directly on the Text gem implementation.
- # Copyright (c) 2006-2013 Paul Battley, Michael Neumann, Tim Fletcher.
- #
- # Returns a value representing the "cost" of transforming str1 into str2.
- def levenshtein_distance(str1, str2) # :doc:
- s = str1
- t = str2
- n = s.length
- m = t.length
-
- return m if (0 == n)
- return n if (0 == m)
-
- d = (0..m).to_a
- x = nil
-
- # avoid duplicating an enumerable object in the loop
- str2_codepoint_enumerable = str2.each_codepoint
-
- str1.each_codepoint.with_index do |char1, i|
- e = i + 1
-
- str2_codepoint_enumerable.with_index do |char2, j|
- cost = (char1 == char2) ? 0 : 1
- x = [
- d[j + 1] + 1, # insertion
- e + 1, # deletion
- d[j] + cost # substitution
- ].min
- d[j] = e
- e = x
- end
-
- d[m] = x
- end
-
- x
- end
+ def self.suggest(word, from:)
+ DidYouMean::SpellChecker.new(dictionary: from.map(&:to_s)).correct(word).first
end
end
end