Skip to content

mwotton/string-similarity

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

string-similarity

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.

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published