| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leaflets (0) - 10 freq leaflet (1) - 11 freq leafless (1) - 4 freq leafletin (2) - 3 freq leemets (3) - 1 freq selfless (3) - 3 freq yearless (3) - 1 freq tablets (3) - 7 freq eagles (3) - 11 freq headless (3) - 1 freq leafleting (3) - 1 freq legless (3) - 3 freq laavets (3) - 1 freq leagues (3) - 19 freq pallets (3) - 7 freq deafens (3) - 1 freq leaches (3) - 3 freq eaglet (3) - 14 freq lempets (3) - 2 freq eagle's (3) - 4 freq refleks (3) - 1 freq lawless (3) - 4 freq leafiness (3) - 1 freq easles (3) - 2 freq wallets (3) - 1 freq |
leaflets (0) - 10 freq leafless (2) - 4 freq leaflet (2) - 11 freq leafletin (3) - 3 freq flets (4) - 7 freq deflects (5) - 1 freq lofts (5) - 1 freq leafs (5) - 43 freq chalets (5) - 1 freq haffets (5) - 6 freq pellets (5) - 5 freq leets (5) - 18 freq flats (5) - 20 freq ladles (5) - 2 freq hamlets (5) - 1 freq mallets (5) - 5 freq flits (5) - 8 freq lifts (5) - 40 freq lufts (5) - 2 freq lifeless (5) - 7 freq fleets (5) - 3 freq faults (5) - 3 freq reflekts (5) - 1 freq leemeets (5) - 1 freq feefles (5) - 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 - LFLTS leaflets - 10 freq |
LEAFLETS |
| Time to execute Levenshtein function - 0.190828 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.346191 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.027309 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.038080 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.000821 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. |