| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detoured (0) - 2 freq retoured (1) - 14 freq devoured (1) - 3 freq devored (2) - 1 freq detoxed (2) - 1 freq toured (2) - 3 freq deterred (2) - 3 freq devoored (2) - 1 freq detours (2) - 1 freq stoured (2) - 4 freq detour (2) - 7 freq decored (2) - 5 freq devolved (3) - 7 freq retired (3) - 42 freq scoured (3) - 5 freq matured (3) - 2 freq rethered (3) - 1 freq deduced (3) - 1 freq nettered (3) - 2 freq reteired (3) - 3 freq detected (3) - 1 freq douked (3) - 4 freq tethered (3) - 12 freq featured (3) - 9 freq retours (3) - 4 freq |
detoured (0) - 2 freq retoured (2) - 14 freq devoured (2) - 3 freq stoured (3) - 4 freq decored (3) - 5 freq detours (3) - 1 freq dytered (3) - 1 freq detour (3) - 7 freq detoxed (3) - 1 freq toured (3) - 3 freq devoored (3) - 1 freq deterred (3) - 3 freq devored (3) - 1 freq taured (4) - 2 freq desired (4) - 12 freq detailed (4) - 14 freq detained (4) - 1 freq touered (4) - 1 freq featured (4) - 9 freq stored (4) - 16 freq motored (4) - 1 freq daured (4) - 24 freq natured (4) - 2 freq matured (4) - 2 freq retired (4) - 42 freq |
SoundEx code - D363 detoured - 2 freq dithert - 1 freq doitert - 1 freq death-rattle-hum - 1 freq deterred - 3 freq dottert - 1 freq dehydratet - 1 freq detritus - 2 freq dytered - 1 freq duddered - 2 freq dotards - 1 freq detroit - 21 freq datartanspartan - 3 freq dhtreds - 8 freq day-the-earth-stood-still - 1 freq |
MetaPhone code - TTRT tittert - 1 freq detoured - 2 freq doitert - 1 freq tattered - 7 freq deterred - 3 freq teetered - 3 freq dottert - 1 freq tottered - 3 freq tattert - 4 freq tootered - 2 freq teddirt - 1 freq 'totey-rote' - 1 freq teddert - 2 freq dytered - 1 freq duddered - 2 freq tittered - 1 freq detroit - 21 freq tooteroooed - 3 freq |
DETOURED |
| Time to execute Levenshtein function - 0.300362 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.422254 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.028823 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.037575 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.000914 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. |