| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lisent (0) - 1 freq lisen (1) - 1 freq listent (1) - 10 freq likent (1) - 2 freq lozent (2) - 1 freq wident (2) - 2 freq absent (2) - 12 freq ladent (2) - 1 freq liket (2) - 4 freq wisest (2) - 2 freq tisen (2) - 1 freq listen (2) - 491 freq leent (2) - 26 freq eident (2) - 47 freq liet (2) - 4 freq mient (2) - 3 freq aipent (2) - 1 freq liken (2) - 5 freq risen (2) - 17 freq livert (2) - 1 freq lippent (2) - 13 freq livet (2) - 1 freq lint (2) - 17 freq lissen (2) - 10 freq plaisent (2) - 1 freq |
lisent (0) - 1 freq listent (2) - 10 freq likent (2) - 2 freq lisen (2) - 1 freq isnt (3) - 2 freq lament (3) - 22 freq lent (3) - 38 freq aksent (3) - 4 freq listenit (3) - 1 freq list (3) - 193 freq leistent (3) - 3 freq assent (3) - 2 freq lowsent (3) - 2 freq sent (3) - 546 freq disnt (3) - 1 freq resent (3) - 3 freq listet (3) - 1 freq lint (3) - 17 freq listit (3) - 7 freq plaisent (3) - 1 freq leent (3) - 26 freq absent (3) - 12 freq ladent (3) - 1 freq lozent (3) - 1 freq leist (4) - 3 freq |
SoundEx code - L253 locomotive - 4 freq legend - 92 freq likent - 2 freq loaksmiths - 1 freq legends - 36 freq lucendo - 1 freq loosened - 3 freq legendary - 15 freq leisn't - 1 freq lisent - 1 freq lowsint - 1 freq leigend - 1 freq leigends - 1 freq legendiry - 1 freq lessened - 1 freq lichened - 2 freq likened - 1 freq lowsened - 2 freq legend'ry - 1 freq lassie-in-waitin - 4 freq lossiemouth - 3 freq lissened - 1 freq locomotive' - 1 freq lokomotywa' - 1 freq lozent - 1 freq lowsent - 2 freq locumtenand - 3 freq lossiemooth - 1 freq lossiemouth-museum - 1 freq likeamadgiraffe - 1 freq legianet - 1 freq lucyhunterb - 5 freq lesmit - 1 freq lyceumtheatre - 1 freq legends-need - 1 freq |
MetaPhone code - LSNT lucendo - 1 freq loosened - 3 freq leisn't - 1 freq lisent - 1 freq lowsint - 1 freq lessened - 1 freq lowsened - 2 freq lissened - 1 freq lozent - 1 freq lowsent - 2 freq |
LISENT |
| Time to execute Levenshtein function - 0.234037 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.407049 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.027375 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.037322 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.000876 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. |