This Java project contains a BK-tree implementation that uses Levenstein's distance to sort the nodes,implemented using dynamic programming. The source code is located at GitHub.
JComplete.java is the entry point. It should be initialized with a directory file that contains one word per line. JCompleteTextField expands the javafx TextField adding the ability to autocomplete based on a JComplete object. More details and examples to follow.
