Soundex

soundex algorithm python

Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. The algorithm mainly encodes consonants; a vowel will not be encoded unless it is the first letter. Soundex is the most widely known of all phonetic algorithms Improvements to Soundex are the basis for many modern phonetic algorithms.

Algorithm

Retain the first letter of the term.
Change all occurrences of the following letters to ’0’ (zero): A, E, I, O, U, H, W, Y
Change letters to digits as follows :

B, F, P, V to 1

C, G, J, K, Q, S, X, Z to 2

D,T to 3

L to 4

M, N to 5

R to 6

Repeatedly remove one out of each pair of consecutive identical digits
Remove all zeros from the resulting string; pad the resulting string with trailing zeros and return the first four positions, which will consist of a letter followed by three digits

* Using this algorithm, both "Robert" and "Rupert" return the same string "R163" while "Rubin" yields "R150".

Code

def Soundex(name):
    name = name.upper()

    result = ''
    result += name[0]

    row = {
        'AEIOUHWY': '0',
        'BFPV': '1',
        'CGJKQSXZ': '2',
        'DT': '3',
        'L': '4',
        'MN': '5',
        'R': '6'
    }

    for word in name[1:]:
        for key in row.keys():
            if word in key:
                temp = row[key]
                if temp != result[-1]:
                    result += temp

    result = result.replace('0', '')
    result = result[:4].ljust(4, '0')
    print('Result : ', result)


if __name__ == '__main__':
    name = input('Enter YourName Or LastName : ')
    Soundex(name)

arminmehraeen/Soundex

Soundex

Algorithm

Code