| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fob-wateh (0) - 1 freq fobwatch (2) - 2 freq for-weel (4) - 1 freq oblate (4) - 1 freq fowth (4) - 5 freq doomwatch (4) - 1 freq fowkgates (4) - 8 freq footpath (4) - 2 freq fowrth (4) - 2 freq low-watter (4) - 1 freq -watch (4) - 1 freq ootwith (5) - 15 freq forwart (5) - 4 freq forwarded (5) - 2 freq wor-are (5) - 1 freq socrates (5) - 3 freq beaten (5) - 20 freq moderate (5) - 5 freq forkfae (5) - 1 freq moderated (5) - 1 freq outwith (5) - 9 freq gobshite (5) - 7 freq outwale (5) - 3 freq sulwath (5) - 4 freq molocates (5) - 2 freq |
fob-wateh (0) - 1 freq fobwatch (4) - 2 freq fowth (6) - 5 freq fowrth (7) - 2 freq for-why (7) - 1 freq bawth (7) - 1 freq footpath (7) - 2 freq -watch (7) - 1 freq for-weel (7) - 1 freq fobbit (8) - 1 freq bath (8) - 98 freq bee-atch (8) - 1 freq fowt (8) - 4 freq cbeath (8) - 1 freq fourth (8) - 34 freq by-th (8) - 1 freq forsyth (8) - 4 freq obwtoz (8) - 1 freq forsooth (8) - 1 freq carnwath (8) - 3 freq foubister (8) - 2 freq i'bath (8) - 1 freq rowth (8) - 54 freq fqbwtadh (8) - 1 freq fouth (8) - 45 freq |
SoundEx code - F130 fifth - 29 freq fifty - 170 freq fuftie - 4 freq fuffed - 1 freq fifety - 1 freq fift - 14 freq fob-wateh - 1 freq fiypt - 1 freq foofed - 1 freq fibta' - 1 freq fiftay - 1 freq fiftie - 12 freq fyft - 1 freq fyftie - 1 freq fufty - 6 freq fufft - 5 freq feyfty - 1 freq foubeit - 7 freq fobbit - 1 freq feefty - 1 freq fived - 1 freq €˜fifty - 1 freq fifd - 1 freq fabbydoo - 1 freq |
MetaPhone code - FBWT fob-wateh - 1 freq |
FOB-WATEH |
| Time to execute Levenshtein function - 0.190977 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.369848 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.028954 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.038847 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.000932 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. |