| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| identical (0) - 19 freq idiotical (2) - 1 freq 'dental (3) - 1 freq sceptical (3) - 3 freq adenoidal (3) - 1 freq identity (3) - 162 freq identity' (3) - 2 freq poetical (3) - 3 freq retical (3) - 1 freq identifie (3) - 1 freq ineetial (3) - 1 freq identify (3) - 22 freq identifee (3) - 5 freq creitical (3) - 5 freq dental (3) - 7 freq identitie (3) - 17 freq ceenical (3) - 3 freq vertical (3) - 21 freq denial (3) - 14 freq 'entice (4) - 1 freq meistical (4) - 1 freq lentil (4) - 5 freq sentinel (4) - 5 freq dentily (4) - 1 freq identifyin (4) - 4 freq |
identical (0) - 19 freq idiotical (3) - 1 freq dental (4) - 7 freq creitical (5) - 5 freq identifee (5) - 5 freq identitie (5) - 17 freq vertical (5) - 21 freq dentily (5) - 1 freq denial (5) - 14 freq identify (5) - 22 freq ceenical (5) - 3 freq fanatical (5) - 4 freq identity (5) - 162 freq adenoidal (5) - 1 freq ineetial (5) - 1 freq identity' (5) - 2 freq 'dental (5) - 1 freq identifie (5) - 1 freq retical (5) - 1 freq poetical (5) - 3 freq aidentitee (6) - 1 freq iainnicol (6) - 16 freq intil (6) - 549 freq enticin (6) - 1 freq identityis (6) - 1 freq |
SoundEx code - I353 identity - 162 freq ideentify - 1 freq identified - 16 freq identifeed - 2 freq identical - 19 freq identitie - 17 freq identity' - 2 freq identities - 17 freq identityis - 1 freq identifies - 5 freq identifeeit - 2 freq identify - 22 freq i'dundy - 1 freq identifyin' - 3 freq identitydhriv - 1 freq identifin' - 1 freq identifyin - 4 freq identifiable - 3 freq identification - 1 freq identifee - 5 freq identificational - 1 freq identifeein - 1 freq identifie - 1 freq identifying - 1 freq idiomatic - 3 freq identifiet - 1 freq idomatic - 1 freq idontevenknowyou - 1 freq |
MetaPhone code - ITNTKL identical - 19 freq |
IDENTICAL |
| Time to execute Levenshtein function - 0.188898 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.356358 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.027575 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.042117 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.000875 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. |