Skip to content

rcdickerson/bk-tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

bk-tree

A simple BK-Tree implementation in Haskell.

The implementation of the tree structure is located in BKTree.hs. An example usage of the tree is located in SpellCorrect.hs, which uses Levenshtein distance as the tree metric to suggest spelling corrections.

For a full discussion of how this code works, see this blog post.

This implementation is freely usable under the terms of the MIT License

About

A simple BK-Tree implementation in Haskell

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published