| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zurich (0) - 5 freq €œrich (2) - 1 freq quaich (2) - 25 freq unich (2) - 1 freq munich (2) - 4 freq rurick (2) - 1 freq zürich (2) - 2 freq uriah (2) - 2 freq enrich (2) - 4 freq rich (2) - 192 freq curch (2) - 1 freq auroch (2) - 2 freq lurch (2) - 6 freq ulrich (2) - 1 freq eric (3) - 63 freq 'eric (3) - 1 freq burgh (3) - 18 freq africy (3) - 1 freq eric' (3) - 1 freq hich (3) - 7 freq wurc (3) - 1 freq broch (3) - 86 freq deich (3) - 1 freq burial (3) - 12 freq sirch (3) - 1 freq |
zurich (0) - 5 freq rich (3) - 192 freq curch (3) - 1 freq ulrich (3) - 1 freq enrich (3) - 4 freq auroch (3) - 2 freq lurch (3) - 6 freq arch (4) - 13 freq bourach (4) - 37 freq feerich (4) - 1 freq riche (4) - 4 freq larach (4) - 1 freq troch (4) - 13 freq suruchi (4) - 1 freq froch (4) - 1 freq zerah (4) - 1 freq dreich (4) - 159 freq azariah (4) - 2 freq perch (4) - 13 freq ruch (4) - 18 freq zarah (4) - 1 freq laroch (4) - 1 freq praich (4) - 10 freq erch (4) - 3 freq garioch (4) - 19 freq |
SoundEx code - Z620 zurich - 5 freq zürich - 2 freq zarg - 1 freq zrhokqse - 1 freq |
MetaPhone code - SRX search - 116 freq zurich - 5 freq 'search - 1 freq zürich - 2 freq sairch - 7 freq seraich - 1 freq seirch - 1 freq suruchi - 1 freq sirch - 1 freq €˜search - 1 freq sarchy - 1 freq |
ZURICH |
| Time to execute Levenshtein function - 0.192069 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.362881 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.027782 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.039991 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.000944 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. |