redis-asm 0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0614a530aee374d91c9b3fdbea83c6ac4020c588
+  data.tar.gz: c8e1a86c8f7dcf5b4a6ef455f47d50ada66af54b
+SHA512:
+  metadata.gz: 70a2cc486e140531cc11310965f0313870af99e512cc2f0d825d401202a1d95992a931eb86440016070b6eed76ba9ad238d195c812946a8679c72e2ba0eaebeb
+  data.tar.gz: 6467734e8eb1d868b35b80826afaa88bd46971f98451f135dba7faf7ed7588bb66a44cf0901b1618c9b3dca5538a7142cd17af73482964fd24185473abdbbaba

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

@@ -0,0 +1,3 @@
+language: ruby
+rvm:
+  - 2.1.5

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in redis-asm.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2015 Masato Yamaguchi
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,114 @@
+# Redis::Asm
+
+##### Fast fuzzy string search on Redis using Lua. UTF-8 Ready.
+
+## Description
+Fast ASM(Approximate String Matching) by calculating edit distance within the collections such as ZSET, HASH, LIST, SET on Redis using Lua script.  
+Redis::Asm provides you to search multi-byte characters correctly, because it recognizes lead-byte of UTF-8 strings.
+
+## Prerequisites
+This library requires a Redis server with Lua scripting support (EVAL and EVALSHA commands). This support was added in Redis 2.6.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'redis-asm'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install redis-asm
+
+## Usage
+
+To initialize `Redis::Asm` with host and port:
+```ruby
+redis = Redis.new(:host => REDIS_HOST, :port => REDIS_PORT)
+asm = Redis::Asm.new(redis)
+```
+To execute fuzzy search from Redis collections:
+```ruby
+require 'json'
+
+# asm.search(KEY, NEELDE, MAX_RESULTS=10)
+
+# To search from SET or LIST
+
+result = asm.search(SET_OR_LIST_KEY, 'example')
+puts JSON.parse(result).to_yaml
+# ---
+# - haystack: example
+#   match: 1
+# - haystack: samples
+#   match: 0.5
+# - haystack: abampere
+#   match: 0.42857142857143
+.
+.
+
+# To search from HASH
+
+# Redis::Asm matches HASH values
+# each item has 'field' property
+
+result = asm.search(HASH_KEY, '東京都')
+puts JSON.parse(result).to_yaml
+# ---
+# - haystack: "東京都"
+#   field: '126'
+#   match: 1
+# - haystack: "京都府"
+#   field: '125'
+#   match: 0.33333333333333
+
+# To search from ZSET
+# each item has 'score' property
+
+result = asm.search(ZSET_KEY, '東京都')
+puts JSON.parse(result).to_yaml
+# ---
+# - haystack: "東京都"
+#   score: '126'
+#   match: 1
+# - haystack: "京都府"
+#   score: '125'
+#   match: 0.33333333333333
+```
+## Performance
+
+ - PC: MBP 2.6 GHz Intel Core i5 16GM DD3 RAM
+ - OS: Mac OSX 10.9.5
+ - ruby 2.1.5p273 [x86_64-darwin13.0]
+ - Redis server v=2.6.17 bits=64
+
+```bash
+# search from 10,000 items of SETS
+# each item contains UTF-8 characters, and consists of between 1 and 30 chars.
+% ruby search_bench.rb stone
+      user     system      total        real
+  0.000000   0.000000   0.000000 (  0.038567)
+% ruby search_bench.rb 東京都
+      user     system      total        real
+  0.000000   0.000000   0.000000 (  0.022540)
+
+% ruby search_bench.rb 弊社といたしましては
+      user     system      total        real
+  0.000000   0.000000   0.000000 (  0.063109)
+
+```
+
+
+
+## Contributing
+
+1. Fork it ( https://github.com/krt/redis-asm/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,7 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec
+

data/lib/redis-asm.rb

@@ -0,0 +1,2 @@
+require 'redis'
+require 'redis/asm'

data/lib/redis/asm.rb

@@ -0,0 +1,26 @@
+require 'redis'
+require "redis/asm/version"
+require "digest/sha1"
+
+class Redis
+  class Asm
+
+    SCRIPT_DIR = File.expand_path('../../', __FILE__)
+    SCRIPT     = File.read File.join(SCRIPT_DIR, "redis_asm.lua")
+    SHA1       = Digest::SHA1.hexdigest SCRIPT
+
+    def initialize(redis)
+      @redis = redis
+    end
+
+    def search(key, needle, max_results=10)
+      @redis.evalsha(SHA1, :keys => [key], :argv => [needle, max_results])
+      rescue Exception => e
+        if e.message =~ /NOSCRIPT/
+          @redis.eval script, :keys => [key], :argv => [needle, max_results]
+        else
+          raise e
+      end
+    end
+  end
+end

data/lib/redis/asm/version.rb

@@ -0,0 +1,5 @@
+class Redis
+  class Asm
+    VERSION = "0.1"
+  end
+end

data/lib/redis_asm.lua

@@ -0,0 +1,239 @@
+--[[
+
+redis_asm.lua
+approximate string matching for redis
+
+Copyright (c) 2015 Masato Yamaguchi
+
+This software is released under the MIT License.
+
+http://opensource.org/licenses/mit-license.php
+
+
+USAGE:
+> eval "(content of this script)" 1 KEY NEEDLE MAX_RESULTS
+
+@param {string} KEY           Name of key. Accepts ZSET, SET, HASH and LIST.
+@param {string} NEEDLE        Search word.
+@param {boolean} MAX_RESULTS  Max size of results, defaults 10.
+@return {string}              Result as json string.
+]]
+
+local i
+local haystacks = {}
+local opt_data  = {} -- score for ZSET, or field for HASH.
+
+local key_type  = redis.call('TYPE', KEYS[1])["ok"]
+
+if not key_type then return nil end
+if key_type == 'zset' then
+  local zset = redis.call('ZRANGE', KEYS[1], 0, -1, 'WITHSCORES')
+  local is_value = true
+  for i = 1, #zset do
+    if     is_value then haystacks[#haystacks + 1] = zset[i] end
+    if not is_value then opt_data[#opt_data + 1]   = zset[i] end
+    is_value = not is_value
+  end
+elseif key_type == 'list' then
+  haystacks = redis.call('LRANGE', KEYS[1], 0, -1)
+elseif key_type == 'set' then
+  haystacks = redis.call('SMEMBERS', KEYS[1])
+elseif key_type == 'hash' then
+  local hash = redis.call('HGETALL', KEYS[1])
+  local is_field = true
+  for i = 1, #hash do
+    if     is_field then opt_data[#opt_data + 1]   = hash[i] end
+    if not is_field then haystacks[#haystacks + 1] = hash[i] end
+    is_field = not is_field
+  end
+else
+  return nil
+end
+
+local needle = ARGV[1]
+if not needle then return nil end
+
+local max_results = tonumber(ARGV[2]) or 10
+
+local cjson = cjson
+local s_byte = string.byte
+local s_sub = string.sub
+local s_find = string.find
+local m_min = math.min
+local m_max = math.max
+local m_floor = math.floor
+local m_ceil = math.ceil
+local t_sort = table.sort
+
+
+-- mapping utf-8 leading-byte to byte offset
+local byte_offsets = {
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3,
+3, 3, 3, 3, 3, 3, 3}
+
+--[[
+* Split utf-8 string into multi-byte chunks according to its leading-byte.
+* @param {string}
+* @return {Array.<string>} Array of multi-byte strings.
+--]]
+local function split_into_utf8_bytes(str)
+  local codes = {}
+  local i
+  local offset = 0
+
+  local mb_str, byte, offset_pos
+
+  for i = 1, #str do
+    offset_pos = i + offset
+    if offset_pos >= #str then
+      break
+    end
+
+    byte = byte_offsets[s_byte(str, offset_pos, offset_pos)] or 0
+    
+    mb_str = s_sub(str, offset_pos, offset_pos + byte)
+    codes[#codes + 1] = mb_str
+    offset = offset + byte
+  end
+  return codes
+end
+
+--[[
+* Check if haystack includes any character in needle.
+* @param {string}
+* @param {Array.<string>}
+* @return {boolean} true if haystack includes utf_needle
+--]]
+local function haystack_includes_needle_char(haystack, utf_needle)
+  for i = 1, #utf_needle do
+    if s_find(haystack, utf_needle[i]) then return true end
+  end
+  return false
+end
+
+local cache = {}
+
+--[[
+* Calculate match score using levenshtein distance.
+* @param {Array.<string>} haystack
+* @param {Array.<string>} needle
+* @param {boolean} if true, stop calculating 
+                   when the result might be lower than lowest_score
+* @param {number|nil} lowest_score
+* @return {number|nil} match score(0..1)
+--]]
+local function levenshtein_score(str, needle, should_cutoff, lowest_score)
+  local length, length_needle, code, result, should_break
+  local distance, distance_needle, index, index_needle, cutoff_distance
+  local longer_length = m_max(#str, #needle)
+
+  if should_cutoff and lowest_score then
+    cutoff_distance = m_ceil((1 - lowest_score) * longer_length) + 1
+  end
+
+  length = #str
+  length_needle = #needle
+  for index = 1, length do
+    cache[index] = index + 1
+  end
+
+  for index_needle = 1, length_needle do
+    code = needle[index_needle]
+    result = index_needle - 1
+    distance = index_needle - 1
+
+    for index = 1, length do
+      distance_needle = (code == str[index]) and distance or distance + 1
+      distance = cache[index]
+      result = (distance > result) and
+        ((distance_needle > result) and result + 1 or distance_needle)
+        or
+        ((distance_needle > distance) and distance + 1 or distance_needle)
+      cache[index] = result
+
+      if cutoff_distance and result > cutoff_distance then
+        return nil
+      end
+    end
+  end
+  return 1 - (result / longer_length)
+end
+
+local scores = {}
+local utf_needle = split_into_utf8_bytes(needle)
+local lowest_score, utf_word, longer_length, score
+local should_cutoff = false
+
+-- main loop.
+for i = 1, #haystacks do
+  if haystack_includes_needle_char(haystacks[i], utf_needle) then
+    utf_word = split_into_utf8_bytes(haystacks[i])
+    
+    if #utf_word >= #utf_needle then
+      longer_length = #utf_word
+
+      if s_find(haystacks[i], needle) then
+        score = #utf_needle * (1 / longer_length)
+      else
+        score = levenshtein_score(utf_word, utf_needle, should_cutoff, lowest_score)
+      end
+
+      if score and not(score == 0) then
+        if #scores > max_results then
+          should_cutoff = true
+          t_sort(
+            scores,
+            function(a,b)
+              return a.score > b.score
+            end
+          )
+          lowest_score = scores[max_results].score
+          if score > lowest_score then
+            scores[#scores + 1] = {score = score, idx = i}
+          end
+        else
+          scores[#scores + 1] = {score = score, idx = i}
+        end
+      end
+    end
+  end
+
+end
+
+t_sort(
+  scores,
+  function(a,b)
+    return a.score > b.score
+  end
+)
+
+local result = {}
+local output_length = m_min(#scores, max_results)
+
+for i = 1, output_length do
+  local item = {}
+  item['match'] = scores[i].score
+  item['haystack'] = haystacks[scores[i].idx]
+  if key_type == 'zset' then
+    item['score'] = opt_data[scores[i].idx]
+  elseif key_type == 'hash' then
+    item['field'] = opt_data[scores[i].idx]
+  end
+  result[#result + 1] = item
+end
+
+local text = cjson.encode(result)
+
+return(text)
+

data/redis-asm.gemspec

@@ -0,0 +1,26 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'redis/asm/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "redis-asm"
+  spec.version       = Redis::Asm::VERSION
+  spec.authors       = ["Masato Yamaguchi"]
+  spec.email         = ["karateka2000@gmail.com"]
+  spec.summary       = "Fast fuzzy string search on Redis using Lua. UTF-8 Ready."
+  spec.description   = "Fast ASM(Approximate String Matching) by calucuating edit distance within the collecitons such as ZSET, HASH, LIST, SET on Redis using Lua script. It provides you to search multi-byte characters correctly, because it recognizes lead-byte of UTF-8 strings."
+  spec.homepage      = "http://github.com/krt/redis-asm"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec"
+  spec.add_dependency 'redis', '~> 3.0'
+  spec.add_dependency 'digest/sha1'
+end

data/spec/redis/asm/asm_spec.rb

@@ -0,0 +1,129 @@
+require 'spec_helper'
+require 'json'
+require 'yaml'
+
+REDIS_PORT = ENV['REDIS_PORT'] || 6379
+REDIS_HOST = ENV['REDIS_HOST'] || 'localhost'
+
+redis = Redis.new(:host => REDIS_HOST, :port => REDIS_PORT)
+asm = Redis::Asm.new(redis)
+
+SKEY = 'redis:asm:testing:set'
+ZKEY = 'redis:asm:testing:zset'
+HKEY = 'redis:asm:testing:hash'      
+LKEY = 'redis:asm:testing:list'
+
+describe Redis::Asm do
+
+  before :all do
+    test_data = File.read(File.expand_path('../test_data.txt', __FILE__))
+      .split("\n")
+    i = 0
+    zdata = test_data.map{|item| i += 1; [i, item]}
+    i = 0
+    hdata = test_data.inject({}){|ha, k| i += 1; ha.merge(i=>k)}
+
+    redis.pipelined do |r|
+      redis.sadd SKEY, test_data
+      redis.zadd ZKEY, zdata
+      redis.mapped_hmset HKEY, hdata
+      test_data.each{|item| redis.rpush LKEY,item}
+    end
+  end
+
+  after :all do
+    redis.del ZKEY
+    redis.del HKEY
+    redis.del SKEY
+    redis.del LKEY
+  end
+
+  it 'has a version number' do
+    expect(Redis::Asm::VERSION).not_to be nil
+  end
+
+  it 'responds to search method' do
+    expect(asm.respond_to?(:search)).to eq(true)
+  end
+
+  context 'execute fuzzy searching on Redis SET or LIST' do
+    let(:result_set)  {JSON.parse(asm.search(SKEY, 'example'))}
+    let(:result_list) {JSON.parse(asm.search(LKEY, 'example'))}
+
+    it "result has exactly matched string" do
+      expect(result_set.first).to eq({"haystack"=>"example", "match"=>1})
+      expect(result_list.first).to eq({"haystack"=>"example", "match"=>1})
+    end
+
+    it "result has fuzzy matched string" do
+      expect(result_set[1]).to eq({"haystack"=>"samples", "match"=>0.5})
+      expect(result_list[1]).to eq({"haystack"=>"samples", "match"=>0.5})
+    end
+
+    it "result size must be default limit(10)" do
+      expect(result_set.size).to eq 10
+      expect(result_list.size).to eq 10
+    end
+  end
+
+  context 'execute fuzzy searching on Redis SET or LIST using multi-byte string' do
+    let(:result_set)  {JSON.parse(asm.search(SKEY, '東京都'))}
+    let(:result_list) {JSON.parse(asm.search(LKEY, '東京都'))}
+
+    it "result has exactly matched string" do
+      expect(result_set.first).to eq({"haystack"=>"東京都", "match"=>1})
+      expect(result_list.first).to eq({"haystack"=>"東京都", "match"=>1})
+    end
+
+    it "result has fuzzy matched string" do
+      expect(result_set[1]).to eq({"haystack"=>"京都府", "match"=>0.33333333333333})
+      expect(result_list[1]).to eq({"haystack"=>"京都府", "match"=>0.33333333333333})
+    end
+
+    it "result size must be matched item count" do
+      expect(result_set.size).to eq 2
+      expect(result_list.size).to eq 2
+    end
+  end
+
+  context 'execute fuzzy searching on Redis ZSET or HASH' do
+    let(:result_zset) {JSON.parse(asm.search(ZKEY, 'example'))}
+    let(:result_hash) {JSON.parse(asm.search(HKEY, 'example'))}
+
+    it "result has exactly matched string, zset has 'score' and hash has 'field'" do
+      expect(result_zset.first).to eq({"haystack"=>"example", "score"=>"114", "match"=>1})
+      expect(result_hash.first).to eq({"haystack"=>"example", "field"=>"114", "match"=>1})
+    end
+
+    it "result has fuzzy matched string, zset has 'score' and hash has 'field'" do
+      expect(result_zset[1]).to eq({"haystack"=>"samples", "score"=>"119", "match"=>0.5})
+      expect(result_hash[1]).to eq({"haystack"=>"samples", "field"=>"119", "match"=>0.5})
+    end
+
+    it "result size must be default limit(10)" do
+      expect(result_zset.size).to eq 10
+      expect(result_hash.size).to eq 10
+    end
+  end
+
+  context 'execute fuzzy searching on Redis ZSET or HASH using multi-byte string' do
+    let(:result_zset) {JSON.parse(asm.search(ZKEY, '東京都'))}
+    let(:result_hash) {JSON.parse(asm.search(HKEY, '東京都'))}
+
+    it "result has exactly matched string, zset has 'score' and hash has 'field'" do
+      expect(result_zset.first).to eq({"haystack"=>"東京都", "score"=>"126", "match"=>1})
+      expect(result_hash.first).to eq({"haystack"=>"東京都", "field"=>"126", "match"=>1})
+    end
+
+    it "result has fuzzy matched string, zset has 'score' and hash has 'field'" do
+      expect(result_zset[1]).to eq({"haystack"=>"京都府", "score"=>"125", "match"=>0.33333333333333})
+      expect(result_hash[1]).to eq({"haystack"=>"京都府", "field"=>"125", "match"=>0.33333333333333})
+    end
+
+    it "result size must be matched item count" do
+      expect(result_zset.size).to eq 2
+      expect(result_hash.size).to eq 2
+    end
+  end
+
+end

data/spec/redis/asm/test_data.txt

@@ -0,0 +1,131 @@
+1ab2cd34ef5g6
+a
+aa
+aah
+aahed
+aahing
+aahs
+aal
+aalii
+aaliis
+aals
+aardvark
+aardvarks
+aardwolf
+aardwolves
+aargh
+aarrgh
+aarrghh
+aarti
+aartis
+aas
+aasvogel
+aasvogels
+ab
+aba
+abac
+abaca
+abacas
+abaci
+aback
+abacs
+abacterial
+abactinal
+abactinally
+abactor
+abactors
+abacus
+abacuses
+abaft
+abaka
+abakas
+abalone
+abalones
+abamp
+abampere
+abamperes
+abamps
+aband
+abanded
+abanding
+abandon
+abandoned
+abandonedly
+abandonee
+abandonees
+abandoner
+abandoners
+abandoning
+abandonment
+abandonments
+abandons
+abandonware
+abandonwares
+abands
+abapical
+abas
+abase
+abased
+abasedly
+abasement
+abasements
+abaser
+abasers
+abases
+abash
+abashed
+abashedly
+abashes
+abashing
+abashless
+abashment
+abashments
+abasia
+abasias
+abasing
+abask
+abatable
+abate
+abated
+abatement
+abatements
+abater
+abaters
+abates
+abating
+abatis
+abatises
+abator
+abators
+abattis
+abattises
+abattoir
+abattoirs
+abc
+abcdefg
+ac
+axc
+b
+bc
+cat
+cow
+difference
+distance
+example
+frankenstein
+javawasneat
+kitten
+levenshtein
+samples
+scalaisgreat
+sitting
+sturgeon
+urgently
+xabxcdxxefxgx
+京都府
+東京都
+弊社佐藤
+弊社と致しましては
+貴社におかれましては
+因為我是中國人所以我會說中文
+因為我是英國人所以我會說英文

data/spec/spec_helper.rb

@@ -0,0 +1,3 @@
+$LOAD_PATH.unshift File.expand_path('../../lib', __FILE__)
+require 'redis'
+require 'redis/asm'

metadata

@@ -0,0 +1,135 @@
+--- !ruby/object:Gem::Specification
+name: redis-asm
+version: !ruby/object:Gem::Version
+  version: '0.1'
+platform: ruby
+authors:
+- Masato Yamaguchi
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-01-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: redis
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: digest/sha1
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Fast ASM(Approximate String Matching) by calucuating edit distance within
+  the collecitons such as ZSET, HASH, LIST, SET on Redis using Lua script. It provides
+  you to search multi-byte characters correctly, because it recognizes lead-byte of
+  UTF-8 strings.
+email:
+- karateka2000@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/redis-asm.rb
+- lib/redis/asm.rb
+- lib/redis/asm/version.rb
+- lib/redis_asm.lua
+- redis-asm.gemspec
+- spec/redis/asm/asm_spec.rb
+- spec/redis/asm/test_data.txt
+- spec/spec_helper.rb
+homepage: http://github.com/krt/redis-asm
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+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: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Fast fuzzy string search on Redis using Lua. UTF-8 Ready.
+test_files:
+- spec/redis/asm/asm_spec.rb
+- spec/redis/asm/test_data.txt
+- spec/spec_helper.rb