GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.
Sign up
Fetching latest commit…
| Type | Name | Latest commit message | Commit time |
|---|---|---|---|
| Failed to load latest commit information. | |||
|
Data/List | ||
|
|
bench | ||
|
|
test | ||
|
|
.gitignore | ||
|
|
.travis.yml | ||
|
|
Guardfile | ||
|
|
LICENSE | ||
|
|
README.md | ||
|
|
Setup.hs | ||
|
|
string-similarity.cabal | ||
This is a collection of algorithms for finding the longest common substring in two documents.
The wider aim is to rate pairs (and eventually, larger sets) of documents for similarity, so that we can semi-automatically determine relationships in datasets. For the moment, just
longestSubstring ::(Eq a, Ord a) -> [a] -> [a] -> [a]
will do.