This is the edit-distance Reference Manual, version 1.0.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 04:51:25 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
edit-distance
Compute edit distance between sequences.
Ben Lambert <belambert@mac.com>
CC-BY-4.0
1.0.0
src
(module).
Modules are listed depth-first from the system components tree.
edit-distance/src
edit-distance
(system).
package.lisp
(file).
distance.lisp
(file).
interface.lisp
(file).
print.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
edit-distance/edit-distance.asd
edit-distance/src/package.lisp
edit-distance/src/distance.lisp
edit-distance/src/interface.lisp
edit-distance/src/print.lisp
edit-distance/src/distance.lisp
package.lisp
(file).
src
(module).
get-path-from-bp-table
(function).
levenshtein-distance
(function).
levenshtein-distance-fast
(function).
edit-distance/src/interface.lisp
distance.lisp
(file).
src
(module).
diff
(function).
distance
(function).
format-diff
(function).
insertions-and-deletions
(function).
print-diff
(function).
compute-alignment
(function).
compute-insertions-and-deletions
(function).
edit-distance
(function).
sequence-diff
(function).
edit-distance/src/print.lisp
interface.lisp
(file).
src
(module).
print-differences
(function).
Packages are listed by definition order.
edit-distance
common-lisp
.
diff
(function).
distance
(function).
format-diff
(function).
insertions-and-deletions
(function).
print-diff
(function).
compute-alignment
(function).
compute-insertions-and-deletions
(function).
edit-distance
(function).
get-path-from-bp-table
(function).
levenshtein-distance
(function).
levenshtein-distance-fast
(function).
print-differences
(function).
sequence-diff
(function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Print a human readable ’diff’ of the two sequences to the given stream (standard out by default). Optionally prefixes and suffixes of each line can be printed for easier identification and analysis.
Print a human readable ’diff’ of the two sequences to the given stream (standard out by default). Optionally prefixes and suffixes of each line can be printed for easier identification and analysis.
Return a cons that points to two lists. The first is a list of the insertions; The second is a list of deletions.
Given a back-pointer table, return a representation of the shortest path.
Compute the Levenshtein distance between two sequences. If return path is t, returns the return path. O/w just returns the distance.
Just like the previous version, but also return the number of *matches*.
This is pretty fast now... It looks like most of the time taken is in applying the test (e.g. string-equal)
some non-negligible part of it is taken by the MAKE-ARRAY calls and GC’ing those...
Given a ’path’ as produced by the above function LEVENSTEIN-DISTANCE function above,
print the differences in the format of the ’align’ program.
The prefix and suffix args allow the caller to supply a string to print before, and
after each.
Print a human readable ’diff’ of the two sequences to the given stream (standard out by default). Optionally prefixes and suffixes of each line can be printed for easier identification and analysis.
Jump to: | C D E F G I L P S |
---|
Jump to: | C D E F G I L P S |
---|
Jump to: | D E F I M P S |
---|
Jump to: | D E F I M P S |
---|