Matchcode Optimization:Vowels

From Melissa Data Wiki
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


Vowels

Specifics

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

Summary

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

Returns

Returns a match if two strings’ vowels match exactly.

Example Matchcode Component

MCO Algorithm Vowels.png

Example Data

STRING1 STRING2 RESULT
Johnson Jhnsn Unique
Lynda Dylan Match
Smith Smith Match
Brian Ian Match



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

Gather/scatter, survivorship, or record consolidation of sensitive data.
Quantifiable data or records with proprietary keywords not associated in our knowledgebase tables.

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.