| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| topher (0) - 1 freq topper (1) - 12 freq tother (1) - 1 freq tocher (1) - 25 freq stopper (2) - 2 freq tapper (2) - 1 freq tether (2) - 18 freq tipper (2) - 14 freq tougher (2) - 3 freq other (2) - 530 freq toner (2) - 1 freq taper (2) - 4 freq totier (2) - 1 freq to'oer (2) - 2 freq tothe (2) - 2 freq posher (2) - 1 freq topped (2) - 1 freq totter (2) - 2 freq t'other (2) - 1 freq copper (2) - 22 freq touer (2) - 60 freq toker (2) - 1 freq tooter (2) - 4 freq rocher (2) - 5 freq tapner (2) - 2 freq |
topher (0) - 1 freq tother (2) - 1 freq tocher (2) - 25 freq topper (2) - 12 freq topgear (3) - 1 freq cipher (3) - 1 freq tither (3) - 202 freq ther (3) - 111 freq tther (3) - 6 freq tyocher (3) - 1 freq tapner (3) - 2 freq touther (3) - 1 freq ticher (3) - 3 freq tapper (3) - 1 freq taper (3) - 4 freq tether (3) - 18 freq tougher (3) - 3 freq other (3) - 530 freq tipper (3) - 14 freq thur (4) - 376 freq ayther (4) - 3 freq thyr (4) - 6 freq thar (4) - 102 freq aither (4) - 140 freq their (4) - 5043 freq |
SoundEx code - T160 thievery - 1 freq tverie - 2 freq tver - 3 freq tipper - 14 freq tvery - 2 freq topiary - 2 freq tapper - 1 freq tvver - 1 freq tibur - 2 freq tiber - 1 freq topper - 12 freq tea-barra - 1 freq taiver - 2 freq tuber - 1 freq taper - 4 freq tobar - 2 freq tfar - 1 freq the-fore - 1 freq twa-fower - 1 freq topher - 1 freq twofur - 1 freq tabor - 1 freq tfvoeor - 1 freq tvroy - 1 freq |
MetaPhone code - TFR tougher - 3 freq dover - 15 freq duffer - 6 freq differ - 135 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq tverie - 2 freq tver - 3 freq tvery - 2 freq daffery - 2 freq tvver - 1 freq devour' - 1 freq dover' - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq taiver - 2 freq devour - 7 freq tfar - 1 freq devoir - 1 freq difer - 2 freq dfr - 2 freq topher - 1 freq dwfywri - 1 freq tvroy - 1 freq |
TOPHER |
| Time to execute Levenshtein function - 0.197992 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.364191 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.029764 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.038076 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.000842 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. |