MAC → MCC, KN → N, K → C, PH, PF → FF, SCH → SSS Our word does not begin with MAC Move to next step
Our word does not begin with KN Move to next step
Our word does not begin with K Move to next step
Our word does not begin with PH Move to next step
Our word does not begin with PH Move to next step
Our word does not begin with SCH Move to next step
Translate last characters of name
EE → Y, IE → Y, DT, RT, RD, NT, ND → D Our word does not end with EE move to next step
Our word does not end with IE move to next step
Our word does not end with DT move to next step
Our word does not end with FT move to next step
Our word does not end with RD move to next step
Our word does not end with NT move to next step
Our word does not end with ND move to next step
First character of key
First character of ALGEBRA is A Use this as our key
EV → AF else A, E, I, O, U → A
Zero instances of EV in LGEBRA Move on to next step.
1 instance of the letter E in LGEBRA Our translation becomes LGABRA Zero instances of I in LGABRA Move on to next step.
Zero instances of O in LGABRA Move on to next step.
Zero instances of U in LGABRA Move on to next step.
Q → G, Z → S, M → N
Zero instances of Q in LGABRA Move on to next step.
Zero instances of Z in LGABRA Move on to next step.
Zero instances of M in LGABRA Move on to next step.
KN → N, K → C
Zero instances of KN in LGABRA Move on to next step.
Zero instances of K in LGABRA Move on to next step.
SCH → SSS, PH → FF
Zero instances of SCH in LGABRA Move on to next step.
Zero instances of PH in LGABRA Move on to next step.
H →
If previous or next is non-vowel Use previous
W → If previous is vowel, A.
Zero instances of EW in LGABRA Move on to next step.
Zero instances of IW in LGABRA Move on to next step.
Zero instances of OW in LGABRA Move on to next step.
Zero instances of UW in LGABRA Move on to next step.
Add current to key
If current ≠ last key character (remove duplicate letters). No duplicate letter patterns Move to next step
If last character is S, remove it.
Our word does not end with S move to next step
If last characters = AY, use Y.
Our word does not end with AY move to next step
If last character is A, remove it.
LGABRA translates to LGABR
Append translated key to value
From step 3 (removed first character)
ALGABR
What is the Answer?
ALGABR
How does the Phonetic Algorithms Calculator work?
Given a name, this calculator translates a name to one of the following 3 phonetic algorithms:
* Soundex
* Metaphone
* New York State Identification and Intelligence System (NYSIIS) This calculator has 1 input.
What 12 concepts are covered in the Phonetic Algorithms Calculator?
NYSIIS
New York State Information and Intelligence Systems. A phonetic coding algorithm
algorithm
A process to solve a problem in a set amount of time
consonant
Sounds which are blocked by the tongue, teeth, or lips in some way. B, C, D, F, H, G, J, K, L, M, N, P, Q, R, S, T, V, W, X, Y, Z
consonant
Sounds which are blocked by the tongue, teeth, or lips in some way. B, C, D, F, H, G, J, K, L, M, N, P, Q, R, S, T, V, W, X, Y, Z
metaphone
a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation
phonetic
a branch of linguistics that studies how humans produce and perceive sounds
phonetic algorithm
n algorithm for indexing of words by their pronunciation
soundex
a coded surname index (using the first letter of the last name and three digits) based on the way a name sounds rather than the way it is spelled
syllable
An uninterrupted segment of sound which is formed by the opening and closing of the mouth to form vowels.
syllable
An uninterrupted segment of sound which is formed by the opening and closing of the mouth to form vowels.
vowel
A sound the is produced when the mouth is open and not blocked by the lips, teeth, or tongue a, e, i, o, u
vowel
A sound the is produced when the mouth is open and not blocked by the lips, teeth, or tongue a, e, i, o, u
Example calculations for the Phonetic Algorithms Calculator
