FSharpx.BKTree.(List | ByteString).distance short examples

bktree_distance_example.fs

(*
Reference: http://en.wikipedia.org/wiki/Levenshtein_distance#Example

kitten → sitten (substitution of 's' for 'k')
sitten → sittin (substitution of 'i' for 'e')
sittin → sitting (insertion of 'g' at the end).
*)

open FSharpx.DataStructures
open FSharpx.ByteString

// List
let kitten = "kitten".ToCharArray() |> Array.toList
let sitting = "sitting".ToCharArray() |> Array.toList
assert(BKTree.List.distance kitten sitting = 3)

// ByteString
let kitten = "kitten" |> ByteString.ofString
let sitting = "sitting" |> ByteString.ofString
assert(BKTree.ByteString.distance kitten sitting = 3)