Changeset

An Elixir package for calculating between-list edit distances.

It can calculate both the Levenshtein distance between two lists and the actual edit steps required to go from one list to another (using the Wagner-Fischer algorithm).

iex(1)> taylor_swift_songs = [22, 15, "I Knew You Were Trouble"]
iex(2)> positive_integers = [22, 7, 15, 186, 33]

# Levenshtein.
iex(3)> Changeset.levenshtein(taylor_swift_songs, positive_integers)
3

# Edit steps.
iex(4)> Changeset.edits(taylor_swift_songs, positive_integers)
[{:insert, 7, 1}, {:substitute, 186, 3}, {:insert, 33, 4}]

iex(5)> Changeset.edits(positive_integers, taylor_swift_songs)
[{:delete, 7, 1}, {:substitute, "I Knew You Were Trouble", 2}, {:delete, 33, 4}]

# Edit steps include moves (i.e. deletions followed by insertions).
iex(6)> Changeset.edits(~w( a v e r y ), ~w( g a r v e y))
[{:insert, "g", 0}, {:move, "r", 3, 2}]

Installation

Changeset will soon be able to be installed by adding it to mix.exs:

def deps do
  [{:changeset, "~> 0.0.1"}]
end

Tests and benchmarks

Run tests:

$ mix test
Compiled lib/changeset.ex
...........

Finished in 0.1 seconds (0.08s on load, 0.03s on tests)
11 tests, 0 failures

Run benchmarks (using benchfella):

$ mix bench
Compiled lib/changeset.ex
Settings:
  duration:      1.0 s

## ChangesetBench
[15:19:11] 1/2: preterit <-> zeitgeist levenshtein distance
[15:19:13] 2/2: preterit -> zeitgeist edit steps

Finished in 3.39 seconds

## ChangesetBench
preterit <-> zeitgeist levenshtein distance         500   3250.17 µs/op
preterit -> zeitgeist edit steps                    100   12743.73 µs/op