| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| konkleuzhin (0) - 1 freq konekshin (4) - 1 freq kokushkin (5) - 1 freq unleashin (5) - 2 freq onethin (5) - 2 freq onluikin (5) - 1 freq concludin (5) - 3 freq 'oniethin (5) - 1 freq onniethin (5) - 2 freq oniethin (5) - 79 freq doon-leukin (5) - 1 freq oneythin (5) - 1 freq oneithin (5) - 1 freq oniehin (5) - 3 freq dearleukin (6) - 1 freq naecthin (6) - 1 freq compleinin (6) - 1 freq klein (6) - 5 freq inflectin (6) - 1 freq hankerin (6) - 3 freq innerleithin (6) - 1 freq non-herdin (6) - 1 freq howcleuch (6) - 4 freq rankleburn (6) - 1 freq kinkeind (6) - 7 freq |
konkleuzhin (0) - 1 freq konekshin (6) - 1 freq tinklhn (8) - 1 freq unleashin (8) - 2 freq kinlin (9) - 2 freq kunlun (9) - 4 freq pinklin (9) - 2 freq kekklin (9) - 1 freq younklin (9) - 1 freq inklin (9) - 22 freq fanklin (9) - 5 freq kennlin (9) - 5 freq kneelin (9) - 19 freq kinleen (9) - 1 freq meiklejohn (9) - 1 freq kecklin (9) - 11 freq kindleen (9) - 1 freq tinklin (9) - 4 freq rinklin (9) - 3 freq kindlin (9) - 5 freq rankleburn (9) - 1 freq onniethin (9) - 2 freq oniethin (9) - 79 freq doon-leukin (9) - 1 freq innerleithin (9) - 1 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 - KNKLSHN konkleuzhin - 1 freq |
KONKLEUZHIN |
| Time to execute Levenshtein function - 0.227580 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.369846 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.026750 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.037732 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.000824 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. |