| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinglassie (0) - 4 freq kinglassiet (1) - 1 freq indylassie (3) - 5 freq glashie (4) - 1 freq kintraside (4) - 8 freq kinraddie (4) - 1 freq kinglike (4) - 1 freq kinless (4) - 1 freq sunglasses (4) - 6 freq diglossia (4) - 3 freq kintra-side (4) - 3 freq fingla's (4) - 1 freq kissie (4) - 1 freq kintraeside (4) - 5 freq thatlassie (4) - 1 freq glasgie (4) - 1 freq kingship (4) - 8 freq kingoodie (4) - 1 freq glessie (4) - 3 freq kinelie (4) - 1 freq kingie (4) - 1 freq lassie (4) - 771 freq kingsize (4) - 1 freq kindlie (4) - 3 freq fingaa's (5) - 1 freq |
kinglassie (0) - 4 freq kinglassiet (2) - 1 freq kinless (5) - 1 freq indylassie (5) - 5 freq fingla's (6) - 1 freq sangless (6) - 2 freq songless (6) - 1 freq diglossia (6) - 3 freq kungles (6) - 1 freq sunglasses (6) - 6 freq kingsize (6) - 1 freq glessie (6) - 3 freq kinglike (6) - 1 freq sunglaisses (7) - 2 freq kineness (7) - 2 freq yingess (7) - 1 freq glassa (7) - 1 freq glass (7) - 80 freq 'inglis' (7) - 1 freq mingles (7) - 1 freq inglesh (7) - 3 freq kinross (7) - 6 freq ingle's (7) - 2 freq kingis (7) - 2 freq ingleesh (7) - 4 freq |
SoundEx code - K524 knuckles - 29 freq knucklin - 1 freq kingholm - 1 freq knuckle - 5 freq knockahollet - 2 freq kinglassie - 4 freq kinglassiet - 1 freq king'll - 1 freq knuckle-kaimed - 1 freq knuckledusters - 1 freq kingly - 1 freq kensalem - 1 freq knuckled - 4 freq knukkilt - 1 freq kinglike - 1 freq knackie-lyeukin - 1 freq knucklebones - 1 freq koonsuls - 1 freq knuckleheids - 1 freq kungles - 1 freq konkleuzhin - 1 freq kayenicolson - 1 freq kingswells - 4 freq knocklayd - 1 freq kenmccoll - 1 freq kmcalindon - 5 freq kmcall - 4 freq kimnicoll - 2 freq |
MetaPhone code - KNKLS congolese - 1 freq kinglassie - 4 freq kungles - 1 freq |
KINGLASSIE |
| Time to execute Levenshtein function - 0.302266 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.571352 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.027577 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.084657 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.000788 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. |