| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreicher (0) - 1 freq dreiche (1) - 1 freq dreiver (2) - 1 freq drenched (2) - 6 freq richer (2) - 15 freq dreich (2) - 1 freq heicher (2) - 30 freq preacher (2) - 20 freq dreich (2) - 158 freq dreichly (2) - 3 freq trencher (2) - 3 freq dreichest (2) - 2 freq teacher (3) - 340 freq steisher (3) - 2 freq dreech (3) - 2 freq breaches (3) - 3 freq brither (3) - 344 freq breached (3) - 5 freq streitcher (3) - 1 freq reaches (3) - 21 freq archer (3) - 9 freq dreive (3) - 4 freq fletcher (3) - 5 freq creches (3) - 1 freq screiched (3) - 3 freq |
dreicher (0) - 1 freq dreiche (2) - 1 freq preacher (3) - 20 freq dreich (3) - 158 freq richer (3) - 15 freq dreichly (3) - 3 freq treachery (4) - 3 freq archer (4) - 9 freq duncher (4) - 4 freq crichar (4) - 151 freq brocher (4) - 2 freq droich (4) - 4 freq adreich (4) - 1 freq roucher (4) - 2 freq dreucht (4) - 1 freq heicher (4) - 30 freq dreich (4) - 1 freq drenched (4) - 6 freq dreiver (4) - 1 freq dreech (4) - 2 freq trencher (4) - 3 freq denchir (4) - 1 freq dreichest (4) - 2 freq rocher (4) - 5 freq reachet (5) - 1 freq |
SoundEx code - D626 dresser - 23 freq darker - 9 freq derker - 7 freq darger - 2 freq daurker - 11 freq daurk-haired - 2 freq diregaird - 1 freq dairker - 1 freq daark-haired - 1 freq dressers - 1 freq drug-ring - 1 freq darkrife - 1 freq darg-year - 1 freq dargers - 1 freq derk-haired - 1 freq dark-hair - 1 freq dreicher - 1 freq doriccroissant - 1 freq drewjarviescomb - 7 freq derrygirls - 1 freq derekcorner - 1 freq drgarypamplin - 1 freq dragraceukbbc - 1 freq dirkrobertsonart - 1 freq drcharlesl - 1 freq |
MetaPhone code - TRXR 'treacherie - 1 freq treacherie - 4 freq treachery - 3 freq tertiary - 4 freq dreicher - 1 freq |
DREICHER dreich - 158 freq dreech - 2 freq driech - 13 freq dreichly - 3 freq dreicher - 1 freq drech - freq |
| Time to execute Levenshtein function - 0.305820 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.456322 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027455 milliseconds 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. |
Time to execute MetaPhone function - 0.036339 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000936 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |