| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leaflets (2) - 10 freq leaflet (2) - 11 freq leafletin (2) - 3 freq beleted (3) - 1 freq deleted (3) - 4 freq depleted (3) - 1 freq deflated (3) - 9 freq reflected (3) - 12 freq leathered (3) - 4 freq leafleting (3) - 1 freq leemeted (3) - 15 freq leafless (3) - 4 freq leeted (3) - 1 freq deflected (3) - 2 freq lifted (4) - 99 freq leaned (4) - 40 freq learned (4) - 79 freq hearkened (4) - 1 freq retweeted (4) - 5 freq haeted (4) - 1 freq meerceted (4) - 1 freq swaeted (4) - 1 freq meandered (4) - 3 freq eagled (4) - 1 freq leeed (4) - 1 freq |
leaflets (3) - 10 freq leafletin (3) - 3 freq leaflet (3) - 11 freq deflated (4) - 9 freq lufted (5) - 5 freq flyted (5) - 2 freq lifted (5) - 99 freq fleeted (5) - 3 freq lfted (5) - 1 freq fluted (5) - 1 freq leeted (5) - 1 freq deflected (5) - 2 freq reflected (5) - 12 freq depleted (5) - 1 freq deleted (5) - 4 freq beleted (5) - 1 freq leafless (5) - 4 freq inflated (5) - 4 freq leafleting (5) - 1 freq leemeted (5) - 15 freq vaulted (6) - 1 freq filleted (6) - 1 freq saluted (6) - 2 freq resulted (6) - 1 freq levelled (6) - 4 freq |
SoundEx code - L143 lea-field - 1 freq levelled - 4 freq liability - 5 freq labelled - 13 freq leaflets - 10 freq leafletin - 3 freq luvvult - 1 freq leaflet - 11 freq labelt - 2 freq levelt - 1 freq livelihoods - 2 freq label't - 2 freq labellt - 1 freq l'evolution - 1 freq level-heiditness - 1 freq levellt - 1 freq livelihood - 1 freq labellit - 1 freq love-letter - 1 freq leafleting - 1 freq |
MetaPhone code - LFLTT |
LEAFLETED leaflet - 11 freq leafletin - 3 freq leftlets - freq leafleting - 1 freq leafleted - freq |
| Time to execute Levenshtein function - 0.217817 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.371696 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.029419 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.040186 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.001518 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. |