| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| identity (0) - 165 freq identify (1) - 22 freq identity' (1) - 2 freq indentify (2) - 1 freq identityis (2) - 1 freq ideentify (2) - 1 freq density (2) - 4 freq dentit (2) - 3 freq dentily (2) - 1 freq entity (2) - 17 freq identitie (2) - 17 freq dentie (3) - 6 freq intensity (3) - 7 freq denotit (3) - 1 freq dintit (3) - 3 freq pentit (3) - 44 freq aidentitee (3) - 1 freq tentily (3) - 22 freq denties (3) - 2 freq prentit (3) - 81 freq dently (3) - 1 freq identifie (3) - 1 freq identical (3) - 19 freq identifyin (3) - 4 freq gentily (3) - 4 freq |
identity (0) - 165 freq dentit (2) - 3 freq identitie (2) - 17 freq identify (2) - 22 freq identity' (2) - 2 freq denotit (3) - 1 freq aidentitee (3) - 1 freq duntit (3) - 26 freq dintit (3) - 3 freq entity (3) - 17 freq identityis (3) - 1 freq density (3) - 4 freq ideentify (3) - 1 freq dentily (3) - 1 freq intit (4) - 11 freq identifee (4) - 5 freq rentit (4) - 6 freq eidently (4) - 16 freq denty (4) - 6 freq fentit (4) - 3 freq dauntit (4) - 3 freq dentist (4) - 46 freq duntet (4) - 1 freq quantity (4) - 8 freq identities (4) - 18 freq |
SoundEx code - I353 identity - 165 freq ideentify - 1 freq identified - 16 freq identifeed - 2 freq identical - 19 freq identitie - 17 freq identity' - 2 freq identities - 18 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 - ITNTT identity - 165 freq identitie - 17 freq identity' - 2 freq |
IDENTITY |
| Time to execute Levenshtein function - 0.209752 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.345968 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.027482 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.037064 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.000928 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. |