Cologne phonetics
Cologne phonetics is a phonetic algorithm which assigns to words a sequence of digits, the phonetic code. The aim of this procedure is that identical sounding words have the same code assigned to them. The algorithm can be used to perform a similarity search between words. For example, it is possible in a name list to find entries like "Meier" under different spellings such as "Maier", "Mayer", or "Mayr". The Cologne phonetics is related to the well known Soundex phonetic algorithm but is optimized to match the German language. The algorithm was published in 1969 by Hans Joachim Postel.
Method
The Cologne phonetics matches each letter of a word to a digit between "0" and "8". To select the appropriate digit, at most one adjacent letter is used as a context. Some rules apply specifically to the initials of words. In this way similar sounds are supposed to be assigned the same code. The letters "W" and "V" for example, are both encoded with the number "3". The phonetic code for "Wikipedia" is "3412". Unlike the Soundex code, the length of the codes from the Cologne phonetics method is not limited.Procedure
| Letter | Context | Code |
| A, E, I, J, O, U, Y | 0 | |
| H | - | |
| B | 1 | |
| P | not before H | 1 |
| D, T | not before C, S, Z | 2 |
| F, V, W | 3 | |
| P | before H | 3 |
| G, K, Q | 4 | |
| C | in the initial sound before A, H, K, L, O, Q, R, U, X | 4 |
| C | before A, H, K, O, Q, U, X except after S, Z | 4 |
| X | not after C, K, Q | 48 |
| L | 5 | |
| M, N | 6 | |
| R | 7 | |
| S, Z | 8 | |
| C | after S, Z | 8 |
| C | in initial position except before A, H, K, L, O, Q, R, U, X | 8 |
| C | not before A, H, K, O, Q, U, X | 8 |
| D, T | before C, S, Z | 8 |
| X | after C, K, Q | 8 |
That for the letter "C" the rule "SC" has priority over the rule "CH" was taken into account by the addition of "except after S, Z" in line 10 of the table. This is not explicitly mentioned in the original publication but can be inferred from the examples listed there, e.g. for "Breschnew" the code "17863" is specified.
Lowercase letters are encoded accordingly; all other characters are ignored. For the umlauts Ä, Ö, Ü, as well as ß, that are not taken into account in the conversion table, it suggests itself to match them to the vowels respective to the group S, Z.
Processing of a word is done in three steps:
- Encode letter by letter from left to right according to the conversion table.
- Remove all digits occurring more than once next to each other.
- Remove all code "0" except at the beginning.
Example
- Encode each letter: 60550750206880022
- Collapse of all multiple consecutive code digits: 6050750206802
- Remove all "0" digits: 65752682
Literature