| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foothert (0) - 2 freq poothert (1) - 1 freq footert (1) - 3 freq bothert (2) - 37 freq foondert (2) - 8 freq poother (2) - 5 freq pouthert (2) - 1 freq shoothert (2) - 1 freq fostert (2) - 1 freq soothern (2) - 1 freq soother (2) - 3 freq poothery (2) - 1 freq fother (2) - 4 freq foonert (2) - 17 freq footer (2) - 14 freq footers (2) - 3 freq sowthert (2) - 2 freq footery (2) - 6 freq fethert (2) - 1 freq soothart (2) - 1 freq southert (2) - 1 freq soothers (2) - 1 freq frothed (3) - 4 freq foothold (3) - 2 freq footerie (3) - 3 freq |
foothert (0) - 2 freq fethert (2) - 1 freq footert (2) - 3 freq poothert (2) - 1 freq faitherit (3) - 1 freq fother (3) - 4 freq soothart (3) - 1 freq pouthert (3) - 1 freq bothert (3) - 37 freq southert (3) - 1 freq fouthiest (4) - 1 freq bathert (4) - 11 freq faithers (4) - 85 freq faither' (4) - 5 freq weathert (4) - 1 freq withert (4) - 4 freq bithert (4) - 2 freq faytert (4) - 1 freq fathers (4) - 3 freq focherty (4) - 1 freq mithert (4) - 1 freq gathert (4) - 3 freq githert (4) - 3 freq fither (4) - 12 freq fayther (4) - 4 freq |
SoundEx code - F363 futrets - 2 freq feathered - 7 freq futrat - 10 freq featured - 9 freq foothert - 2 freq footered - 5 freq futtered - 1 freq federated - 1 freq faithered - 3 freq footert - 3 freq futret - 7 freq faidered - 1 freq futrads - 2 freq fethert - 1 freq featurt - 1 freq fittert - 1 freq futrats - 1 freq fittret - 1 freq futterat - 14 freq futterat's - 1 freq faitherit - 1 freq federation - 3 freq fitwards - 1 freq futterats - 1 freq faytert - 1 freq faitherhood - 1 freq futtret - 1 freq ftrdbbgxy - 1 freq futtritt - 1 freq futtrit - 1 freq fdrt - 1 freq |
MetaPhone code - F0RT feathered - 7 freq foothert - 2 freq faithered - 3 freq fethert - 1 freq faitherit - 1 freq |
FOOTHERT |
| Time to execute Levenshtein function - 0.533221 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 - 1.168651 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.027980 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.163396 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.001258 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. |