| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leaflet (0) - 11 freq leaflets (1) - 10 freq leafless (2) - 4 freq eaglet (2) - 14 freq leafletin (2) - 3 freq easle (3) - 2 freq lease (3) - 14 freq lealty (3) - 5 freq reachet (3) - 1 freq gealt (3) - 3 freq leeket (3) - 1 freq valet (3) - 1 freq cradlet (3) - 1 freq zealot (3) - 3 freq weffle (3) - 1 freq lealry (3) - 1 freq landet (3) - 5 freq leagues (3) - 19 freq leaves (3) - 208 freq leave't (3) - 2 freq leather (3) - 77 freq learie (3) - 1 freq liable (3) - 4 freq geeglet (3) - 1 freq leapt (3) - 11 freq |
leaflet (0) - 11 freq leaflets (2) - 10 freq leafletin (3) - 3 freq laft (4) - 27 freq aflot (4) - 2 freq levelt (4) - 1 freq leyft (4) - 1 freq lyftet (4) - 2 freq flet (4) - 30 freq deafult (4) - 2 freq leafully (4) - 1 freq leift (4) - 1 freq liftet (4) - 17 freq left (4) - 1591 freq leeft (4) - 11 freq eaglet (4) - 14 freq lealty (4) - 5 freq leafless (4) - 4 freq lesley (5) - 18 freq laet (5) - 9 freq lafter (5) - 1 freq ladle (5) - 8 freq dealt (5) - 33 freq ladle' (5) - 2 freq leafin (5) - 3 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 - LFLT lea-field - 1 freq levelled - 4 freq luvvult - 1 freq leaflet - 11 freq levelt - 1 freq levellt - 1 freq |
LEAFLET leaflet - 11 freq leafletin - 3 freq leftlets - freq leafleting - 1 freq leafleted - freq |
| Time to execute Levenshtein function - 0.191422 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.340532 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.027718 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.037117 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.001154 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. |