| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forefowk (0) - 9 freq forefock (1) - 2 freq forefolk (1) - 2 freq forfock (2) - 1 freq fermfowk (2) - 2 freq foowk (3) - 1 freq forego (3) - 1 freq horsegowk (3) - 1 freq foredaw (3) - 2 freq foremost (3) - 1 freq forefront (3) - 5 freq firefox (3) - 1 freq foregone (3) - 1 freq foretoul (3) - 3 freq firework (3) - 9 freq forefit (3) - 1 freq forsook (3) - 6 freq foreword (3) - 4 freq foresaw (3) - 1 freq forenoon (3) - 6 freq moniefowk (3) - 1 freq hopefou (4) - 1 freq foreswore (4) - 1 freq freck (4) - 2 freq coreyhook (4) - 7 freq |
forefowk (0) - 9 freq forefolk (2) - 2 freq forefock (2) - 2 freq fermfowk (3) - 2 freq forfock (3) - 1 freq forefit (5) - 1 freq firework (5) - 9 freq forsook (5) - 6 freq firefox (5) - 1 freq foresaw (5) - 1 freq puirfowk (5) - 1 freq moniefowk (5) - 1 freq foredaw (5) - 2 freq foowk (5) - 1 freq bairnfowk (6) - 1 freq frock (6) - 53 freq reflek (6) - 3 freq kinfowk (6) - 1 freq froak (6) - 4 freq furrow (6) - 12 freq freeform (6) - 1 freq firewirk (6) - 2 freq fowk (6) - 3520 freq i'fowk (6) - 2 freq lawfowk (6) - 1 freq |
SoundEx code - F612 forfochen - 39 freq forefowk - 9 freq forfochten - 10 freq forbes - 10 freq fairfax - 1 freq forfochan - 5 freq forfauchelt - 1 freq ferfochen - 1 freq forfeuchten - 1 freq forbyes - 6 freq fore-paws - 2 freq fore-paas - 1 freq forfauchten - 1 freq freebies - 1 freq fair-faced - 3 freq fairfaced - 1 freq forebyes - 1 freq forfechten - 2 freq forebye's - 1 freq forfauchilt - 1 freq firebox - 1 freq forepaas - 1 freq ferfochan - 4 freq forbye's - 1 freq forfochelt - 1 freq firefighters - 1 freq freepost - 2 freq freepoast - 1 freq forefock - 2 freq forfock - 1 freq firebaws - 1 freq ffrpfvoeqw - 1 freq fairpechtoot - 6 freq furbas - 1 freq fbrubg - 1 freq firefox - 1 freq fieryfacejames - 3 freq |
MetaPhone code - FRFK forefowk - 9 freq forefock - 2 freq forfock - 1 freq |
FOREFOWK |
| Time to execute Levenshtein function - 0.196943 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.357739 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.027438 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.037765 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.000873 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. |