| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forbyes (0) - 6 freq forebyes (1) - 1 freq forbye' (1) - 1 freq forbes (1) - 10 freq forbye's (1) - 1 freq forbye- (1) - 1 freq forbye (1) - 427 freq forays (2) - 2 freq for-bye (2) - 2 freq forby (2) - 491 freq forbae (2) - 1 freq forres (2) - 3 freq forbids (2) - 1 freq oorbye (2) - 1 freq fores (2) - 1 freq forebye (2) - 59 freq forkies (2) - 1 freq forges (2) - 2 freq foraye (2) - 13 freq forces (2) - 42 freq forgies (2) - 1 freq forebye's (2) - 1 freq foryet (2) - 9 freq furbye (2) - 6 freq forties (2) - 4 freq |
forbyes (0) - 6 freq forbes (1) - 10 freq forebyes (1) - 1 freq forbye (2) - 427 freq forbye- (2) - 1 freq forbye' (2) - 1 freq forbye's (2) - 1 freq forces (3) - 42 freq forgies (3) - 1 freq forges (3) - 2 freq forebye's (3) - 1 freq corbies (3) - 20 freq forkies (3) - 1 freq firbye (3) - 29 freq forties (3) - 4 freq furbye (3) - 6 freq fores (3) - 1 freq forby (3) - 491 freq furbas (3) - 1 freq forays (3) - 2 freq forebye (3) - 59 freq forbae (3) - 1 freq forres (3) - 3 freq forbids (3) - 1 freq frames (4) - 18 freq |
SoundEx code - F612 forfochen - 37 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 - FRBYS forbyes - 6 freq forebyes - 1 freq forebye's - 1 freq forbye's - 1 freq |
FORBYES |
| Time to execute Levenshtein function - 0.187272 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.352410 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.027376 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.036958 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.000882 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. |