Skip to main content

Soundex & Metaphone Generator

New

Compute the Soundex code and a simplified Metaphone code for one or more words — classic phonetic-matching algorithms that group similarly-sounding words together.

soundexmetaphonephonetic algorithmfuzzy matchingtext
Read the guide
Shortcuts:⌘ KSearch
WordSoundexMetaphone

Soundex and Metaphone are phonetic-matching algorithms that reduce a word to a code representing roughly how it sounds, so that words with the same code are likely pronounced alike even when spelled differently — "Robert" and "Rupert" both produce the Soundex code R163, which is the standard textbook example of the algorithm in action.

Continue with:

Frequently Asked Questions

What does a Soundex code actually represent?

It's a 4-character code (one letter followed by three digits) that groups words with similar pronunciation together by mapping consonants to digit classes based on their sound — for example, "Robert" and "Rupert" both produce the classic textbook Soundex code R163 despite being spelled very differently.

Why do some completely different-looking words get the same Soundex code?

Soundex deliberately collapses consonants that sound alike (like B, F, P, and V) into the same digit class and drops vowels almost entirely, so it can match phonetically similar names and words even when their spelling differs — this is exactly its intended purpose for tasks like matching misspelled surnames.

How is Metaphone different from Soundex?

Metaphone applies a larger, more nuanced set of English pronunciation rules (like silent letters, "PH" sounding like F, and "TH" being its own distinct sound) and produces a variable-length code rather than Soundex's fixed 4-character format, generally giving more accurate phonetic matches for English words at the cost of more complex rules.

Is this a complete implementation of the full Metaphone algorithm?

It implements the most common and impactful transformation rules from the original 1990 Metaphone algorithm (initial-letter exceptions, silent letters, common digraphs like "CH", "SH", "TH", and more), but does not cover every edge case of the full published specification.

What is this kind of phonetic matching typically used for?

Genealogy and census-record search tools use it to match surnames despite historical spelling inconsistencies, and fuzzy-search or "did you mean" features use it to suggest corrections for words that sound right but are spelled wrong.

Related Tools