| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feathered (0) - 7 freq weathered (1) - 3 freq heathered (1) - 1 freq leathered (1) - 4 freq featherie (2) - 1 freq featherin (2) - 2 freq tethered (2) - 12 freq featured (2) - 9 freq bathered (2) - 8 freq peuthered (2) - 1 freq festered (2) - 3 freq rethered (2) - 1 freq flattered (2) - 5 freq faithered (2) - 3 freq feathery (2) - 7 freq gethered (2) - 8 freq slathered (2) - 3 freq boathered (2) - 2 freq wathered (2) - 1 freq feather's (2) - 1 freq gathered (2) - 24 freq feather (2) - 24 freq feathers (2) - 67 freq soothered (3) - 3 freq footered (3) - 5 freq |
feathered (0) - 7 freq faithered (2) - 3 freq leathered (2) - 4 freq weathered (2) - 3 freq heathered (2) - 1 freq feathery (3) - 7 freq gethered (3) - 8 freq wathered (3) - 1 freq feather (3) - 24 freq feathers (3) - 67 freq gathered (3) - 24 freq boathered (3) - 2 freq tethered (3) - 12 freq featherin (3) - 2 freq featherie (3) - 1 freq bathered (3) - 8 freq featured (3) - 9 freq peuthered (3) - 1 freq rethered (3) - 1 freq fatherly (4) - 1 freq futtered (4) - 1 freq withered (4) - 6 freq founthered (4) - 2 freq althered (4) - 4 freq fichered (4) - 1 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 |
FEATHERED |
| Time to execute Levenshtein function - 0.892177 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.285993 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.097652 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.102054 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.001000 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. |