| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leafletin (0) - 3 freq leafleting (1) - 1 freq leaflets (2) - 10 freq leaflet (2) - 11 freq leetin (3) - 5 freq leafless (3) - 4 freq lealtie (3) - 9 freq deafenin (3) - 3 freq reflectin (3) - 22 freq leatherin (3) - 6 freq deflectin (3) - 1 freq leafin (3) - 3 freq leimitin (4) - 1 freq leenin (4) - 8 freq dealin (4) - 30 freq leavin (4) - 187 freq refleckin (4) - 4 freq beatin (4) - 34 freq leadin (4) - 67 freq leanin (4) - 49 freq teetin (4) - 10 freq gealin (4) - 1 freq oafferin (4) - 1 freq deletion (4) - 1 freq leaf-lik (4) - 1 freq |
leafletin (0) - 3 freq leafleting (2) - 1 freq leaflet (3) - 11 freq leaflets (3) - 10 freq inflatin (5) - 1 freq fleitin (5) - 1 freq deflation (5) - 1 freq luftin (5) - 2 freq fleetin (5) - 20 freq liltin (5) - 6 freq flitin (5) - 1 freq liftin (5) - 75 freq flytin (5) - 35 freq fleatin (5) - 1 freq reflectin (5) - 22 freq leafless (5) - 4 freq lealtie (5) - 9 freq leetin (5) - 5 freq deflectin (5) - 1 freq leafin (5) - 3 freq affectin (6) - 2 freq bleatin (6) - 7 freq levellin (6) - 5 freq resultin (6) - 7 freq salutin (6) - 1 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 - LFLTN leafletin - 3 freq |
LEAFLETIN leaflet - 11 freq leafletin - 3 freq leftlets - freq leafleting - 1 freq leafleted - freq |
| Time to execute Levenshtein function - 0.254097 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.641820 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.028231 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.070135 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.001257 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. |