| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leftpeggers (0) - 106 freq leftowers (4) - 3 freq leftovers (4) - 3 freq thiggers (5) - 1 freq lecters (5) - 1 freq leftover (5) - 1 freq loggers (5) - 1 freq lethers (5) - 1 freq left-ower (5) - 1 freq refters (5) - 1 freq leipers (5) - 2 freq triggers (5) - 1 freq listeners (5) - 12 freq teigers (5) - 2 freq letters (5) - 142 freq extenders (5) - 1 freq beggers (5) - 1 freq leftower (5) - 3 freq ledgers (5) - 2 freq figgers (5) - 1 freq lepers (5) - 4 freq feengers (5) - 1 freq respecters (5) - 1 freq reengers (5) - 2 freq staggers (5) - 5 freq |
leftpeggers (0) - 106 freq leftovers (7) - 3 freq leftowers (7) - 3 freq triggers (8) - 1 freq figgers (8) - 1 freq loggers (8) - 1 freq staggers (8) - 5 freq thiggers (8) - 1 freq feengers (9) - 1 freq lepers (9) - 4 freq lecters (9) - 1 freq efters (9) - 1 freq lethers (9) - 1 freq lecturers (9) - 4 freq leidbangers (9) - 2 freq ledgers (9) - 2 freq teegers (9) - 36 freq figgurs (9) - 1 freq left-ower (9) - 1 freq teigers (9) - 2 freq listeners (9) - 12 freq leftower (9) - 3 freq leipers (9) - 2 freq refters (9) - 1 freq beggers (9) - 1 freq |
SoundEx code - L131 laptop - 25 freq luvvy-duvvy - 1 freq laptops - 1 freq luftwafe - 1 freq lovey-dovey - 1 freq lift-pod - 2 freq liftoff - 2 freq leftovers - 3 freq leftpeggers - 106 freq lbtppuaftn - 1 freq lptpyuk - 1 freq lowpitbower - 1 freq laptoap - 1 freq luftwaffe - 1 freq leftover - 1 freq laptap - 1 freq |
MetaPhone code - LFTPKRS leftpeggers - 106 freq |
LEFTPEGGERS |
| Time to execute Levenshtein function - 0.379382 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.403986 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.027439 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.037112 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.000882 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. |