Daitch-Mokotoff Soundex

Daitch-Mokotoff Soundex (D-M Soundex) is a invented in  by genealogist, and later improved by , both of the. It is a refinement of the Russell and American algorithms designed to allow matching of  and  s with similar  but differences in spelling.

Daitch-Mokotoff Soundex is sometimes referred to as "Jewish Soundex" and "Eastern European Soundex", although the authors discourage use of these nicknames for the algorithm.

Improvements
Improvements over the older Soundex algorithms include:


 * Coded names are six digits long, resulting in greater search precision (traditional Soundex uses four characters)
 * Coded names can be stored as numeric values, which can save space in some applications (regular Soundex encodes values as alphanumeric text)
 * Several rules in the algorithm encode multiple character n-grams as single digits (American and Russell Soundex do not handle multi-character n-grams)
 * Multiple possible encodings can be returned for a single name (traditional Soundex returns only one encoding, even if the spelling of a name could potentially have multiple pronunciations)

Examples
Some examples: