MatchUp Object:Advanced Algorithms: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[MatchUp Object|← MatchUp Object]] | |||
{{CustomTOC}} | |||
==Advanced Algorithms== | |||
Click the links below for more information on the respective public advanced algorithms not developed by Melissa Data. | |||
*[http://en.wikipedia.org/wiki/N-gram N-gram] - http://en.wikipedia.org/wiki/N-gram | |||
*[http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance Winkler Distance] - http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance | |||
http://en.wikipedia.org/wiki/N-gram | *[http://en.wikipedia.org/wiki/Longest_common_substring_problem Longest Common Substring Problem] - http://en.wikipedia.org/wiki/Longest_common_substring_problem | ||
http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance | *[http://en.wikipedia.org/wiki/Jaccard_index Jaccard Index] - http://en.wikipedia.org/wiki/Jaccard_index | ||
http://en.wikipedia.org/wiki/Longest_common_substring_problem | *[http://en.wikipedia.org/wiki/Dice%27s_coefficient Dice's Coefficient] - http://en.wikipedia.org/wiki/Dice%27s_coefficient | ||
http://en.wikipedia.org/wiki/Jaccard_index | *[http://en.wikipedia.org/wiki/Overlap_coefficient Overlap Coefficient] - http://en.wikipedia.org/wiki/Overlap_coefficient | ||
http://en.wikipedia.org/wiki/Dice%27s_coefficient | *[http://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm Needleman-Wunsch Algorithm] - http://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm | ||
http://en.wikipedia.org/wiki/Overlap_coefficient | *[http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm Smith & Waterman Algorithm] - http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm | ||
http://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm | *[http://en.wikipedia.org/wiki/Double_Metaphone#Double_Metaphone Double Metaphone] - http://en.wikipedia.org/wiki/Double_Metaphone#Double_Metaphone | ||
http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm | |||
http://en.wikipedia.org/wiki/Double_Metaphone#Double_Metaphone | |||
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