// Phonex - Enhanced phonetic encoding for name matching
Up to 8 characters for better differentiation.
Groups similar consonants phonetically.
Variable length codes with zero padding.
Phonex is a phonetic algorithm designed for improved name matching. It processes names by preserving the first letter, applying special combination rules (like PH�F, KN�N), grouping similar consonants, and removing vowels except when they separate consonants. The algorithm produces codes of 4-8 characters that capture the phonetic essence of names while allowing for spelling variations.
Consonant mappings: B,P,V,F � B C,K,Q,G,J � C S,Z,X � S D,T � D L � L M,N � M R � R Special combinations: PH � F, KN � N GH � removed WR � R Examples: STEPHEN � SDBM0 S-T[D]-[e]-PH[F�B]-[e]-N[M] ASHCRAFT � ASCRF0 A-S[S]-H[removed]-C[C]-R[R]-A[removed]-F[B]-T[D] KNIGHT � NCD0 KN[N]-I[removed]-GH[removed]-T[D]
Phonex is a phonetic encoding algorithm designed to improve upon earlier systems like Soundex. It provides better handling of consonant clusters, silent letters, and common spelling variations in English names.
Phonex uses more sophisticated consonant groupings, handles special letter combinations (like PH, KN, GH), produces longer codes (4-8 characters vs 4), and better preserves the phonetic structure of names.
Phonex is ideal for matching English names with spelling variations, genealogy research, customer database deduplication, and any application where phonetic name matching is important.
Phonex is optimized for English names and may not work as well with names from other languages. For non-English names, consider algorithms like Double Metaphone or Daitch-Mokotoff.