String Distance Software System
Jump to navigation
Jump to search
A String Distance Software System is a software system (that applies a string distance measure.
- Example(s):
- See: Text Clustering System.
References
2008
- http://alias-i.com/lingpipe/demos/tutorial/stringCompare/read-me.html
- QUOTE: String comparison attempts to measure the similarity between strings. This is useful for applications ranging from database deduplication and record linkage to terminology extraction, spell checking, and k-nearest-neighbors classifiers.
In this tutorial, we demonstrate the ways in which string comparisons are used in LingPipe.
- QUOTE: String comparison attempts to measure the similarity between strings. This is useful for applications ranging from database deduplication and record linkage to terminology extraction, spell checking, and k-nearest-neighbors classifiers.
2003
- http://search.cpan.org/~kcivey/Text-Brew-0.02/lib/Text/Brew.pm
- QUOTE: This module implements the Brew edit distance that is very close to the dynamic programming technique used for the Wagner-Fischer (and so for the Levenshtein) edit distance. Please look at the module references below. For more information about the Brew edit distance see: <http://ling.ohio-state.edu/~cbrew/795M/string-distance.html>
2002
- http://www.merriampark.com/ld.htm
- QUOTE: The purpose of this short essay is to describe the Levenshtein distance algorithm and show how it can be implemented in three different programming languages.