| Projects on Google Code | Results 1 - 5 of 5 |
=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
This is a suffix tree algorithm for .NET written in C#. Feel free to use it as you please!
This code was derived from Mark Nelson's article located here:
http://marknelson.us/1996/08/01/suffix-trees/
Have Fun
Quick & dirty script to generate a module that extracts the public suffix from a DNS name. See http://publicsuffix.org/
"The Porter stemming algorithm (or ‘Porter stemmer’) is a process for removing the commoner morphological and inflexional endings from words in English. Its main use is as part of a term normalisation process that is usually done when setting up Information Retrieval systems." (source: http://tarta...
This is a library for calculating the suffix tree of a string using Ukkonen's algorithm.