Skip to content

I added a few punctuation marks, and fixed a typo in the levenshtein-distance docstring. #4

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

Open
poppingtonic wants to merge 3 commits into
base: master
Choose a base branch
from
Open

I added a few punctuation marks, and fixed a typo in the levenshtein-distance docstring. #4

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
8a6a955
Fixed typo in the levenshtein-distance docstring.
poppingtonic Nov 16, 2013
718c900
Fixed typo in the levenshtein-distance docstring.
poppingtonic Nov 16, 2013
0972ebe
Created doc folder, added paper referenced in levenshtein-distance do…
poppingtonic Nov 16, 2013
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Fixed typo in the levenshtein-distance docstring.
  • Loading branch information
@poppingtonic
poppingtonic committed Nov 16, 2013
commit 8a6a9554fb96384ceafaf4d0e5973c4567743fe1
12 changes: 6 additions & 6 deletions src/clj/clj_diff/core.clj
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,14 +84,14 @@
needed to transform one string into the other, with the allowable edit
operations being insertion, deletion and substitution of a single character.

This function works not only with strings but with any Clojure sequence.
This function works, not only with strings, but with any Clojure sequence.

Warning! Technically this function is estimating the Levenshtein distance
Warning! Technically, this function is estimating the Levenshtein distance
from a computed diff. Most of the time, it is the same as the real Levenshtein
distance but in same cases it may be larger. The reason for this is that
there may be multiple paths through an edit graph with the same edit
distance but with differing Levenshtein distance. A future improvement to
the diff algorithm whould be to find all paths and prefer the one with the
distance, but in same cases it may be larger. The reason for this is that
there may be multiple paths through an edit graph, with the same edit
distance, but with differing Levenshtein distance. A future improvement to
the diff algorithm would be to find all paths, and prefer the one with the
minimum Levenshtein distance."
([a b]
(levenshtein-distance (diff a b)))
Expand Down