dawg 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 71bacf98485657d1f57fbf1c71ee76b613a2ea69
+  data.tar.gz: 7c10810752805ab89deac3e6edd6f0e259a2c17d
+SHA512:
+  metadata.gz: 9540d8dff79f43f854271140b210f8f472c0dd4472808c9cd8e93fdb60ad40d4b8c64975d68f0e751cc456cbd00c21664a6477c20e30fcd8129a9d173803a1ad
+  data.tar.gz: 317ca1ae25bfbf511d3bb0395cf19f0505d94a0b2427b7bc7c973a15817182bdc734b80d309c8a86b8fdd47cceec25b214fb44a09817521ac8f01cd8bde0cde6

data/lib/dawg.rb

@@ -0,0 +1,161 @@
+class DawgNode
+  @@next_id = 0
+  attr_accessor :edges,:final,:id
+  def initialize
+    @id = @@next_id
+    @@next_id += 1
+    @final = false
+    @edges = {}
+  end
+
+  def to_s
+    arr = []
+    if @final
+        arr<<"1"
+    else
+        arr<<"0"
+    end
+
+    for (label, node) in @edges
+        arr << label
+        arr << node.id.to_s
+    end
+
+    arr.join("_")
+  end
+
+  def hash
+      to_s.hash
+  end
+
+  def eql?(other)
+      to_s == other.to_s
+  end
+end
+
+class Dawg
+  def initialize
+    @previousWord = ""
+    @root = DawgNode.new
+
+    # Here is a list of nodes that have not been checked for duplication.
+    @uncheckedNodes = []
+
+    # Here is a list of unique nodes that have been checked for
+    # duplication.
+    @minimizedNodes = {}
+  end
+
+  def save(filename)
+    data = Marshal.dump(self)
+    File.open(filename, 'w') { |file| file.write(data) }
+  end
+
+  def self.load(filename)
+    dawg = Marshal.load( File.open(filename).read )
+  end
+
+  def insert( word )
+    if word < @previousWord
+        raise "Error: Words must be inserted in alphabetical order."
+    end
+
+    # find common prefix between word and previous word
+    commonPrefix = 0
+    for i in 0..[word.length-1, @previousWord.length-1].min
+      break if word[i] != @previousWord[i]
+      commonPrefix += 1
+    end
+
+    # Check the uncheckedNodes for redundant nodes, proceeding from last
+    # one down to the common prefix size. Then truncate the list at that
+    # point.
+    _minimize( commonPrefix )
+
+    # add the suffix, starting from the correct node mid-way through the
+    # graph
+    if @uncheckedNodes.length == 0
+      node = @root
+    else
+      node = @uncheckedNodes[-1][2]
+    end
+
+    for letter in word.split("")[commonPrefix..-1]
+      nextNode = DawgNode.new
+      node.edges[letter] = nextNode
+      @uncheckedNodes<< [node, letter, nextNode]
+      node = nextNode
+    end
+
+    node.final = true
+    @previousWord = word
+  end
+  def finish
+    # minimize all uncheckedNodes
+    _minimize( 0 )
+  end
+
+  def _minimize(downTo)
+    # proceed from the leaf up to a certain point
+    for i in (@uncheckedNodes.length - 1).downto(downTo)
+        parent, letter, child = @uncheckedNodes[i]
+        if @minimizedNodes.has_key? child
+            # replace the child with the previously encountered one
+            parent.edges[letter] = @minimizedNodes[child]
+        else
+            # add the state to the minimized nodes.
+            @minimizedNodes[child] = child
+        end
+        @uncheckedNodes.pop
+    end
+  end
+
+  def lookup(word)
+    node = @root
+    for letter in word.split("")
+        return false if !node.edges.has_key? letter
+        node = node.edges[letter]
+    end
+    node.final
+  end
+
+  def find_similar(word)
+    node = @root
+    for letter in word.split("")
+        return [] if !node.edges.has_key? letter
+        node = node.edges[letter]
+    end
+    results = get_recuirsively_all(node)
+
+    return [word].product(results).map(&:join)
+  end
+ 
+  def get_recuirsively_all(node)
+    suffixes = []
+
+    node.edges.each do |key,value|
+      results = get_recuirsively_all(value)
+
+      # result.flatten! if result.length==2
+      results.each do |result|
+        suffixes << [[key] + [result]].flatten.join
+      end
+
+      suffixes << key if results.empty?
+
+
+    end
+    return suffixes
+  end
+  def nodeCount
+    @minimizedNodes.length
+  end
+
+  def edgeCount
+    count = 0
+    for key,node in @minimizedNodes
+      count += node.edges.length
+    end
+    count
+  end
+end

metadata

@@ -0,0 +1,45 @@
+--- !ruby/object:Gem::Specification
+name: dawg
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Maksatbek Manurov
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-05-29 00:00:00.000000000 Z
+dependencies: []
+description: Basic deterministic acyclic finite state automaton in ruby
+email:
+- maksat.mansurov@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/dawg.rb
+homepage: https://github.com/baltavay/dawg
+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: Deterministic acyclic finite state automaton
+test_files: []