Implementing BK-Tree for spell correction

mantono / DuplicateSearcher

Identification of Duplicate Tickets in Issue Tracking Systems for Software Development

0 stars 0 forks source link

Implementing BK-Tree for spell correction #34

Closed mantono closed 8 years ago

mantono commented 8 years ago

Implements the data structure BK-Tree which is now used in SpellCorrector and LevenshteinDistance. This reduces the execution time dramatically and lowers time complexity from O(n) to about O(log n) which is a major improvement.

Closes #33 .