Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kidology (0) - 1 freq ideology (2) - 10 freq biology (2) - 13 freq ecology (3) - 3 freq hydrology (3) - 1 freq philology (3) - 1 freq apology (3) - 17 freq sofology (3) - 1 freq geology (3) - 5 freq theology (3) - 7 freq kinely (4) - 4 freq ridley (4) - 2 freq dolly (4) - 109 freq idoot (4) - 1 freq tidily (4) - 1 freq fidgy (4) - 1 freq kilbog (4) - 3 freq kidding (4) - 8 freq widely (4) - 25 freq etymology (4) - 14 freq sociology (4) - 6 freq killy (4) - 9 freq tiddly (4) - 1 freq eidols (4) - 1 freq middly (4) - 3 freq |
kidology (0) - 1 freq ideology (3) - 10 freq biology (4) - 13 freq theology (5) - 7 freq ideologie (5) - 2 freq geology (5) - 5 freq dialog (5) - 1 freq sofology (5) - 1 freq ecology (5) - 3 freq hydrology (5) - 1 freq apology (5) - 17 freq kiddy (6) - 1 freq trilogy (6) - 2 freq eulogy (6) - 4 freq idol (6) - 12 freq pedagogy (6) - 1 freq analogy (6) - 9 freq kodaline (6) - 1 freq doog (6) - 1 freq dolby (6) - 3 freq indulge (6) - 4 freq doggy (6) - 5 freq kdiouwg (6) - 1 freq kilo (6) - 1 freq kindly (6) - 49 freq |
SoundEx code - K342 kittles - 7 freq kettlespoot - 1 freq ketil's - 2 freq kettle's - 1 freq kettles - 2 freq kittle-sweeties - 1 freq kidology - 1 freq kittlesome - 8 freq kethlicks - 2 freq kethlick - 1 freq kettil-creill - 1 freq kittilskart - 8 freq |
MetaPhone code - KTLJ kidology - 1 freq |
KIDOLOGY |
Time to execute Levenshtein function - 0.211962 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.359047 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.028218 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.038326 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.000949 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. |