| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leaflets (2) - 10 freq leftley (2) - 3 freq liftet (3) - 17 freq leemeets (3) - 1 freq listless (3) - 1 freq leets (3) - 18 freq beetles (3) - 2 freq tentles (3) - 2 freq refleks (3) - 1 freq refters (3) - 1 freq teetles (3) - 1 freq hertless (3) - 11 freq efters (3) - 1 freq legless (3) - 3 freq pellets (3) - 5 freq deftness (3) - 2 freq liltless (3) - 1 freq left's (3) - 1 freq lempets (3) - 2 freq leetle (3) - 2 freq gentles (3) - 1 freq settlet (3) - 2 freq lethers (3) - 1 freq leaflet (3) - 11 freq lyftet (3) - 2 freq |
leaflets (3) - 10 freq leftley (4) - 3 freq leftovers (5) - 3 freq leftist (5) - 1 freq ootlets (5) - 6 freq leaflet (5) - 11 freq left's (5) - 1 freq leftowers (5) - 3 freq outlets (5) - 1 freq lifeless (5) - 7 freq flets (5) - 7 freq lyttle's (5) - 2 freq cutlets (5) - 3 freq leafless (5) - 4 freq liltless (5) - 1 freq lyftet (5) - 2 freq listless (5) - 1 freq liftet (5) - 17 freq lift's (6) - 2 freq liftin's (6) - 1 freq felties (6) - 1 freq lentils (6) - 2 freq fillets (6) - 3 freq fleets (6) - 3 freq toilets (6) - 32 freq |
SoundEx code - L134 loftily - 4 freq leftley - 3 freq lapdul - 1 freq lifetilt - 1 freq |
MetaPhone code - LFTLTS |
LEFTLETS leaflet - 11 freq leafletin - 3 freq leftlets - freq leafleting - 1 freq leafleted - freq |
| Time to execute Levenshtein function - 0.235156 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.404845 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.028468 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.044516 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.001481 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. |