Driven IFS and Data Analysis
IFS and the Sounds of Literature
The Soundex Algorithm is a method for converting
words into 5 digit codes.
The first two digits of the code is determined by the first letter of the word,
according to the substitution a = 11, b = 12, ...,
z = 36.
The rest of the word contributes the final three digits
of the code. First, letters are assigned numbers according to the table
letter |
coded as |
a,e,i,o,u,y,h,w |
not coded |
b,f,p,v |
1 |
c,g,j,k,q,s,x,z |
2 |
d,t |
3 |
l |
4 |
m,n |
5 |
r |
6 |
After three digits have been assigned, the rest of the word is ignored.
For short words, missing digits are filled in with 0s.
Adjacent consonants from the
same code group contribute only one digit, as do consonants from the same code group
separated by w or h.
Finally, ignore a consonant immediately following an initial
letter from the same code group.
For example, the first line of Shakespeare's Sonnet 1
From fairest creatures we desire increase
|
codes as
16650, 16623, 13636, 33000, 14260, 19526
|
Return to IFS and the Sounds of Literature.