Matchcode Optimization:Consonants

From Melissa Data Wiki
Revision as of 22:58, 26 September 2018 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

← MatchUp Hub

Matchcode Optimization Navigation
Matchcode Optimization
First Component
Fuzzy Algorithms
Swap Matching
Blank Matching
Advanced Component Types
Algorithms
Accunear
Alphas
Consonants
Containment
Dice's Coefficient
Double Metaphone
Exact
Fast Near
Frequency
Frequency Near
Jaccard Similarity Coefficient
Jaro
Jaro-Winkler
Longest Common Substring (LCS)
MD Keyboard
Needleman-Wunsch
N-Gram
Numeric
Overlap Coefficient
Phonetex
Smith-Waterman-Gotoh
Soundex
UTF8 Near
Vowels


Consonants

Specifics

Only consonants will be compared. Vowels will be removed. ‘Y’ is defined as a vowel in this algorithm.

Summary

This algorithm removes vowels from the string and compares two strings based on their consonants.

Returns

Returns a match if two strings’ consonants match exactly.

Example Matchcode Component

Example Data

STRING1 STRING2 RESULT
Ron Doe Ron Doe67 Match
Lynda Dylan Unique
Tim Tom Match
Brian Ian Unique



Performance
Slower Faster
Matches
More Matches Greater Accuracy


Recommended Usage

Hybrid Deduper, where a single incoming record can quickly be evaluated independently against each record in an existing large master database.
Databases created via real-time data entry where audio likeness errors are introduced.
Databases of US and English language origin.

Not Recommended For

Database where disemvoweling was used to reduce storage space (https://en.wikipedia.org/wiki/Disemvoweling).

Do Not Use With

UTF-8 data. This algorithm was ported to MatchUp with the assumption that a character equals one byte, and therefore results may not be accurate if the data contains multi-byte characters.