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

Look into generating spelling candidates in order of Levenshtein similarity to the query term #10

Open

dylon opened this issue Mar 22, 2014 · 0 comments

Assignees

Labels

Milestone

Member

dylon commented Mar 22, 2014

Dijkstra's single-source, shortest path algorithm, yo!

dylon added this to the 3.0 milestone

dylon added the enhancement label

dylon self-assigned this

dylon modified the milestones: 2.0, 3.0, 4.0

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment