rubykov 0.2.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 9827c73272cba93ae8557afe9cd9158175f5710c
-  data.tar.gz: 3cafc24fa4870f60450dae6d2a5aa692ee3f72c7
+  metadata.gz: be1de15771cfa1694a274b2ad2659c565c0898f1
+  data.tar.gz: 1cc4d87fbacfeeaeebf0ad8c32e15cff7887e480
 SHA512:
-  metadata.gz: b62a34df1580d94914ca0fe4bb171ba5d7449857e3f7323d72958930a912e9b69e67664eb23ce1b7562f14168890a8b46c549d754848951eaa94998ee875074f
-  data.tar.gz: bc3f35303e83992f01ec220d032a70371682e4a173912807219a34cd924f1416defc62cdf014bb30ffccf9fbb3b2abb42cf8371b0264659ad0637f4490945545
+  metadata.gz: 0fcc4cd9b24f2185c2ee429fbf37de51c0ef8ec0efd5c117afb42632a0d34662131e48c056b01496d682f663ea636cee1b5774b1ea89ca1d06f854de5e19236b
+  data.tar.gz: bfa02c7f821816395aaf2266fdb85cd94ce798453121fda7d73ebd3fb3912ec9b44c48e8b6684920a3ac7cff20d55ef0ffd983644ae99b24da980d987434aed3

data/lib/rubykov.rb

@@ -1,2 +1,4 @@
 require 'rubykov/markov_model'
 require 'rubykov/text_generator'
+require 'rubykov/hidden_markov_model'
+require 'rubykov/word_generator'

data/lib/rubykov/hidden_markov_model.rb

@@ -0,0 +1,58 @@
+module Rubykov
+  class HiddenMarkovModel
+    def initialize(states, observations, start_probability, transition_probabilities, emission_probabilities)
+      @states = states
+      @observations = observations
+      @start_probability = start_probability
+      @transition_probabilities = transition_probabilities
+      @observation_probabilities = emission_probabilities
+    end
+
+    def most_likely_state_sequence(observation_sequence)
+      max_probabilities(observation_sequence).map(&:first)
+    end
+
+    def most_likely_state_sequence_probability(observation_sequence)
+      max_probabilities(observation_sequence).last.last
+    end
+
+    private
+
+    def max_probabilities(observation_sequence)
+      compute_viterbi_probabilities(observation_sequence.map(&:to_sym)).map do |probability|
+        probability.max_by { |k,v| v }
+      end
+    end
+
+    def compute_viterbi_probabilities(observations)
+      state_max_probabilities = []
+
+      observations.each_with_index do |observation, index|
+        state_max_probabilities[index] = {}
+        @states.each do |state|
+          state_max_probabilities[index][state] = 0
+          state_max_probabilities.first[state] = @start_probability[state] * @observation_probabilities[state][observations.first]
+        end
+      end
+
+      observations[1..-1].each_with_index do |observation, index|
+        @states.each do |state|
+          max_probability = state_max_probabilities[index].map { |previous_state, previous_probability| @transition_probabilities[previous_state][state] * previous_probability }.max
+          state_max_probabilities[index+1][state] = @observation_probabilities[state][observation] * max_probability
+        end
+      end
+
+      state_max_probabilities
+    end
+
+    def sample(probability_distribution)
+      random_value = rand
+
+      probability_ranges = probability_distribution.inject([0]) do |memo, p|
+        memo << p.last + memo.last
+      end
+
+      probability_distribution[probability_ranges.rindex { |x| x <= random_value }].first
+    end
+  end
+end

data/lib/rubykov/word_generator.rb

@@ -0,0 +1,44 @@
+module Rubykov
+  class WordGenerator < MarkovModel
+    def initialize(order, training_data)
+      super(order, training_data)
+    end
+
+    def train(training_data)
+      add_data_to_model(training_data)
+    end
+
+    def word
+      chain.to_a.join('').capitalize
+    end
+
+    private
+
+    def massage_training_data(training_data)
+      training_data.map { |datum| datum.downcase.split('') + ['\n'] }
+    end
+
+    def add_data_to_model(training_data)
+      massage_training_data(training_data).each do |datum|
+        super(datum)
+      end
+    end
+
+    def chain_enumerator(seed_state = states.sample)
+      Enumerator.new do |output|
+        current_state = seed_state
+        current_state.each do |word|
+          output << word
+        end
+
+        loop do
+          break if @representation[current_state].nil?
+          next_letter = @representation[current_state].sample
+          break if next_letter == '\\n'
+          output << next_letter
+          current_state = current_state.last(@order-1) + [next_letter]
+        end
+      end
+    end
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rubykov
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors:
 - Evan Hemsley
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-12-10 00:00:00.000000000 Z
+date: 2017-07-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
@@ -38,8 +38,10 @@ extra_rdoc_files: []
 files:
 - README.md
 - lib/rubykov.rb
+- lib/rubykov/hidden_markov_model.rb
 - lib/rubykov/markov_model.rb
 - lib/rubykov/text_generator.rb
+- lib/rubykov/word_generator.rb
 - license.md
 homepage: https://gitlab.com/ehemsley/rubykov
 licenses:
@@ -61,7 +63,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.2.2
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: Sensible, easy Markov models in Ruby.