Difference between revisions of "MatchUp Object:Advanced Algorithms"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
[[MatchUp Object | [[MatchUp Object|← MatchUp Object]] | ||
{{CustomTOC}} | {{CustomTOC}} | ||
==Advanced Algorithms== | ==Advanced Algorithms== | ||
Latest revision as of 22:53, 11 March 2016
Advanced Algorithms
Click the links below for more information on the respective public advanced algorithms not developed by Melissa Data.
- N-gram - http://en.wikipedia.org/wiki/N-gram
- Winkler Distance - http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance
- Longest Common Substring Problem - http://en.wikipedia.org/wiki/Longest_common_substring_problem
- Jaccard Index - http://en.wikipedia.org/wiki/Jaccard_index
- Dice's Coefficient - http://en.wikipedia.org/wiki/Dice%27s_coefficient
- Overlap Coefficient - http://en.wikipedia.org/wiki/Overlap_coefficient
- Needleman-Wunsch Algorithm - http://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm
- Smith & Waterman Algorithm - http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm
- Double Metaphone - http://en.wikipedia.org/wiki/Double_Metaphone#Double_Metaphone