| Projects on Google Code | Results 1 - 4 of 4 |
=Major features=
STL-compatible, high-performance template containers and auxiliary classes useful for stringology with fine-grained low level design
=Library features=
* set & map containers with trie (digital/radix search tree) functionality - `trie_set` & `trie_map`;
* set & map containe...
c,
stl,
template,
patricia,
trie,
suffix,
tree,
maximal,
repeats,
lowest,
common,
ancestor,
levenshtein,
hamming,
distance
SDiff is a diff-like utility that uses similarity metrics to difference the statements in two versions of a Java source file.
In the mobile, the contacts are very accessed, many improvements are suggested to became this access easier: UI and Methods. In this projects, we want to introduce the use of a string edit-distance and others heuristics in strategy to find the contact.
Levenshtein Python extension and C library.
The Levenshtein Python C extension module contains functions for fast
computation of
* Levenshtein (edit) distance, and edit operations
* string similarity
* approximate median strings, and generally string averaging
* tring sequence and se...