Matchcode Optimization:Soundex: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Soundex== ===Specifics=== *https://en.wikipedia.org/wiki/Soundex ===Summary=== An auditory matching algorithm originally..." |
No edit summary |
||
| Line 5: | Line 5: | ||
==Soundex== | ==Soundex== | ||
===Specifics=== | ===Specifics=== | ||
*https://en.wikipedia.org/wiki/Soundex | :*https://en.wikipedia.org/wiki/Soundex | ||
===Summary=== | ===Summary=== | ||
An auditory matching algorithm originally developed by the Department of Immigration in 1917 and later adopted by the USPS. Although the Phonetex algorithm is more accurate, the Soundex algorithm is presented for users who need to create a matchcode that emulates one from another application. | :An auditory matching algorithm originally developed by the Department of Immigration in 1917 and later adopted by the USPS. Although the Phonetex algorithm is more accurate, the Soundex algorithm is presented for users who need to create a matchcode that emulates one from another application. | ||
===Returns=== | ===Returns=== | ||
The Soundex algorithm is a string transformation and comparison-based algorithm and is performed on the keybuilding. For example, JOHNSON would be transformed to "J525" and JHNSN would also be transformed to "J525" which would then be considered a SoundEx match after evaluation. | :The Soundex algorithm is a string transformation and comparison-based algorithm and is performed on the keybuilding. For example, JOHNSON would be transformed to "J525" and JHNSN would also be transformed to "J525" which would then be considered a SoundEx match after evaluation. | ||
===Example Matchcode Component=== | ===Example Matchcode Component=== | ||
| Line 19: | Line 19: | ||
{{ExampleDataTableV1|STRING1|STRING2|RESULT | {{ExampleDataTableV1|STRING1|STRING2|RESULT | ||
|AdditionalRows= | |AdditionalRows= | ||
{{EDTRow| | {{EDTRow|Green|Johnson|Jhnsn|Match Found}} | ||
{{EDTRow| | {{EDTRow|Green|Stephenz|Stevens|Match Found}} | ||
{{EDTRow|Green|Beaumarchais|Bumarchay|Match Found}} | {{EDTRow|Green|Beaumarchais|Bumarchay|Match Found}} | ||
{{EDTRow| | {{EDTRow|White|Neumon|Pneumon|Unique}} | ||
}} | }} | ||
| Line 34: | Line 34: | ||
===Recommended Usage=== | ===Recommended Usage=== | ||
Large or enterprise level batch runs where using this algorithm will not prevent efficient clustering. Since the algorithm is performed during keybuilding, throughput will be fast. | :Large or enterprise level batch runs where using this algorithm will not prevent efficient clustering. Since the algorithm is performed during keybuilding, throughput will be fast. | ||
Databases created via real-time data entry where audio likeness errors are introduced. | :Databases created via real-time data entry where audio likeness errors are introduced. | ||
Databases of US and English language origin. | :Databases of US and English language origin. | ||
===Not Recommended For=== | ===Not Recommended For=== | ||
For real-time data entry where audio likeness errors can be introduced and accuracy is of the utmost importance, we recommend Phonetex for greater accuracy. | :For real-time data entry where audio likeness errors can be introduced and accuracy is of the utmost importance, we recommend Phonetex for greater accuracy. | ||
Databases of non-US and non-English language origin. | :Databases of non-US and non-English language origin. | ||
Fields whose content data is of type Dictionary or Quantifiable. | :Fields whose content data is of type Dictionary or Quantifiable. | ||
===Do Not Use With=== | ===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. | :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. | ||
[[Category:MatchUp Hub]] | [[Category:MatchUp Hub]] | ||
[[Category:Matchcode Optimization]] | [[Category:Matchcode Optimization]] | ||
Latest revision as of 14:31, 27 September 2018
Soundex
Specifics
Summary
- An auditory matching algorithm originally developed by the Department of Immigration in 1917 and later adopted by the USPS. Although the Phonetex algorithm is more accurate, the Soundex algorithm is presented for users who need to create a matchcode that emulates one from another application.
Returns
- The Soundex algorithm is a string transformation and comparison-based algorithm and is performed on the keybuilding. For example, JOHNSON would be transformed to "J525" and JHNSN would also be transformed to "J525" which would then be considered a SoundEx match after evaluation.
Example Matchcode Component
Example Data
STRING1 STRING2 RESULT Johnson Jhnsn Match Found Stephenz Stevens Match Found Beaumarchais Bumarchay Match Found Neumon Pneumon Unique
| Performance | |||||
|---|---|---|---|---|---|
| Slower | Faster | ||||
| Matches | |||||
| More Matches | Greater Accuracy | ||||
Recommended Usage
- Large or enterprise level batch runs where using this algorithm will not prevent efficient clustering. Since the algorithm is performed during keybuilding, throughput will be fast.
- Databases created via real-time data entry where audio likeness errors are introduced.
- Databases of US and English language origin.
Not Recommended For
- For real-time data entry where audio likeness errors can be introduced and accuracy is of the utmost importance, we recommend Phonetex for greater accuracy.
- Databases of non-US and non-English language origin.
- Fields whose content data is of type Dictionary or Quantifiable.
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.