| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| likent (0) - 2 freq liken (1) - 5 freq likeet (1) - 2 freq liket (1) - 4 freq lisent (1) - 1 freq ladent (2) - 1 freq likkit (2) - 2 freq libert (2) - 1 freq aipent (2) - 1 freq wizent (2) - 3 freq mient (2) - 3 freq liker (2) - 9 freq sickent (2) - 1 freq wiken (2) - 1 freq wident (2) - 2 freq likenin (2) - 2 freq listent (2) - 10 freq lint (2) - 17 freq like's (2) - 2 freq kent (2) - 1832 freq onkent (2) - 2 freq waikent (2) - 2 freq blaikent (2) - 1 freq client (2) - 2 freq likt (2) - 9 freq |
likent (0) - 2 freq liken (2) - 5 freq liket (2) - 4 freq lisent (2) - 1 freq likeet (2) - 2 freq likener (3) - 1 freq lament (3) - 22 freq likins (3) - 1 freq liking (3) - 20 freq likit (3) - 158 freq blaikent (3) - 1 freq likt (3) - 9 freq unkent (3) - 52 freq wakent (3) - 5 freq 'kent (3) - 1 freq lyket (3) - 7 freq leent (3) - 26 freq lent (3) - 38 freq lozent (3) - 1 freq waikent (3) - 2 freq likin (3) - 38 freq likened (3) - 1 freq likenin (3) - 2 freq lint (3) - 17 freq ladent (3) - 1 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 - LKNT likent - 2 freq likened - 1 freq |
LIKENT |
| Time to execute Levenshtein function - 0.227832 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.348251 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.027713 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.037811 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.000901 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. |