Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement better BKTree distance #38

Open
oddcoder opened this issue Oct 27, 2019 · 0 comments
Open

Implement better BKTree distance #38

oddcoder opened this issue Oct 27, 2019 · 0 comments
Labels
Rtrees https://github.com/oddcoder/rair/tree/master/rtrees

Comments

@oddcoder
Copy link
Member

Typically we would need proper Damerau–Levenshtein distance, or better a normalized one! But these algorithms are cruel they work with -1 based arrays so we need to create our own data type first that can shift base index in standard vectors delegate all vec functionality.
@oddcoder oddcoder added the Rtrees https://github.com/oddcoder/rair/tree/master/rtrees label Oct 27, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Rtrees https://github.com/oddcoder/rair/tree/master/rtrees
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@oddcoder