Add train/2 and add_weight/4 implementations to Markov Chain
* train/2 takes a chain and a list of words to train them on * add_weight/4 takes a chain, a list of words (the key), the word it points to, and an optional increment which will increment the value of a weight, or insert the weight. Signed-off-by: Alek Ratzloff <alekratz@gmail.com>
This commit is contained in:
@@ -1,35 +1,45 @@
|
|||||||
defmodule Omnibot.Contrib.Markov.Chain do
|
defmodule Omnibot.Contrib.Markov.Chain do
|
||||||
alias Omnibot.{Contrib.Markov.Chain, Util}
|
alias Omnibot.Contrib.Markov.Chain
|
||||||
|
|
||||||
@enforce_keys [:order]
|
@enforce_keys [:order]
|
||||||
defstruct order: 2, chain: []
|
defstruct order: 2, chain: []
|
||||||
|
|
||||||
def train(%Chain {chain: chain, order: order}, words) when is_list(words) do
|
def train(chain, words) when is_list(words) do
|
||||||
|
order = chain.order
|
||||||
|
|
||||||
Enum.filter(words, &(String.length(&1) > 0))
|
Enum.filter(words, &(String.length(&1) > 0))
|
||||||
|> Enum.chunk_every(order + 1, 1) # this gives us a "sliding window" effect
|
|> Enum.chunk_every(order + 1, 1) # this gives us a "sliding window" effect
|
||||||
|> Enum.reduce(chain, &case Enum.split(words, order) do
|
|> Enum.reduce(chain, &case Enum.split(&1, order) do
|
||||||
{words, []} -> if length(&1) == order,
|
{words, []} -> if length(words) == order,
|
||||||
# Null case for the chain; this is an "end" state
|
# Null case for the chain; this is an "end" state
|
||||||
do: train_one(%Chain {chain: &2, order: order}, words, nil)
|
do: add_weight(&2, words, nil)
|
||||||
# else: TODO ? train [a, nil] -> b ?
|
# else: TODO ? train [a, nil] -> b ?
|
||||||
{words, [next]} ->
|
{words, [next]} ->
|
||||||
train_one(%Chain {chain: &2, order: order}, words, next)
|
add_weight(&2, words, next)
|
||||||
end
|
end
|
||||||
)
|
)
|
||||||
end
|
end
|
||||||
|
|
||||||
def train_one(%Chain {chain: _chain, order: _order}, _key, _value) do
|
#def lookup(%Chain {chain: chain, order: order}, key) do
|
||||||
end
|
# if length(key) != order, do: raise(ArgumentError, message: "invalid key (length #{length(key)} vs. order #{order})")
|
||||||
|
# case Util.binary_search(chain, key) do
|
||||||
|
# {_index, value} -> value[word]
|
||||||
|
# nil -> nil
|
||||||
|
# end
|
||||||
|
#end
|
||||||
|
|
||||||
def lookup(%Chain {chain: chain, order: order}, key) do
|
def add_weight(%Chain {chain: chain, order: order}, key, word, increment \\ 1) do
|
||||||
if length(key) != order, do: raise(ArgumentError, message: "invalid key (length #{length(key)} vs. order #{order})")
|
if length(key) != order, do: raise(ArgumentError, message: "invalid key (length #{length(key)} vs. order #{order})")
|
||||||
case Util.binary_search(chain, key) do
|
chain = case Enum.find_index(chain, fn {listkey, _} -> listkey == key end) do
|
||||||
{_index, value} -> value
|
# Insert weight
|
||||||
nil -> nil
|
nil -> [{key, %{word => increment}} | chain]
|
||||||
|
# Update weight
|
||||||
|
index -> List.update_at(
|
||||||
|
chain,
|
||||||
|
index,
|
||||||
|
fn {key, mapping} -> {key, Map.update(mapping, word, increment, &(&1 + increment))} end
|
||||||
|
)
|
||||||
end
|
end
|
||||||
end
|
%Chain{chain: chain, order: order}
|
||||||
|
|
||||||
def put(%Chain {chain: _chain, order: _order}, _key, _value) do
|
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
|||||||
@@ -2,11 +2,32 @@ defmodule MarkovChainTest do
|
|||||||
use ExUnit.Case
|
use ExUnit.Case
|
||||||
alias Omnibot.Contrib.Markov.Chain
|
alias Omnibot.Contrib.Markov.Chain
|
||||||
|
|
||||||
test "chain train_one works correctly" do
|
test "chain train works correctly" do
|
||||||
chain = %Chain {order: 2}
|
chain = %Chain {order: 2}
|
||||||
|> Chain.train_one(["foo", "bar"], "baz")
|
|> Chain.train(~w(foo bar baz))
|
||||||
#assert chain.chain == [
|
assert chain.chain == [
|
||||||
#{["foo", "bar"], {"baz", 1}}
|
{["bar", "baz"], %{nil => 1}},
|
||||||
#]
|
{["foo", "bar"], %{"baz" => 1}},
|
||||||
|
]
|
||||||
|
end
|
||||||
|
|
||||||
|
test "chain add_weight works correctly" do
|
||||||
|
chain = %Chain {order: 2}
|
||||||
|
|> Chain.add_weight(["foo", "bar"], "baz")
|
||||||
|
assert chain.chain == [
|
||||||
|
{["foo", "bar"], %{"baz" => 1}}
|
||||||
|
]
|
||||||
|
|
||||||
|
chain = chain |> Chain.add_weight(["foo", "bar"], "baz", 2)
|
||||||
|
|
||||||
|
assert chain.chain == [
|
||||||
|
{["foo", "bar"], %{"baz" => 3}}
|
||||||
|
]
|
||||||
|
|
||||||
|
chain = chain |> Chain.add_weight(["foo", "bar"], "qux")
|
||||||
|
|
||||||
|
assert chain.chain == [
|
||||||
|
{["foo", "bar"], %{"baz" => 3, "qux" => 1}}
|
||||||
|
]
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
|||||||
Reference in New Issue
Block a user