| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ideentify (0) - 1 freq identify (1) - 22 freq identity (2) - 162 freq indentify (2) - 1 freq dentily (3) - 1 freq identifee (3) - 5 freq identifie (3) - 1 freq identity' (3) - 2 freq identifyin (3) - 4 freq greenwife (4) - 1 freq deengir (4) - 1 freq ineetial (4) - 1 freq ingenuity (4) - 2 freq intensity (4) - 6 freq eidently (4) - 16 freq denty (4) - 6 freq inventing (4) - 1 freq deinty (4) - 1 freq entity (4) - 17 freq plentifu (4) - 2 freq identifies (4) - 5 freq dernrife (4) - 1 freq density (4) - 4 freq identifyin' (4) - 3 freq destiny (4) - 12 freq |
ideentify (0) - 1 freq identify (1) - 22 freq identifee (3) - 5 freq identifie (3) - 1 freq identity (3) - 162 freq indentify (3) - 1 freq dentily (4) - 1 freq identifyin (4) - 4 freq identifeed (5) - 2 freq identifiet (5) - 1 freq deinties (5) - 2 freq deintie (5) - 2 freq dentit (5) - 3 freq dently (5) - 1 freq identitie (5) - 17 freq identifies (5) - 5 freq denties (5) - 2 freq dentie (5) - 6 freq identified (5) - 16 freq daintily (5) - 2 freq denty (5) - 6 freq deinty (5) - 1 freq identity' (5) - 2 freq eidently (5) - 16 freq edeetion (6) - 12 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 - ITNTF ideentify - 1 freq identify - 22 freq identifee - 5 freq identifie - 1 freq |
IDEENTIFY |
| Time to execute Levenshtein function - 0.206095 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.388738 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.028097 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.040781 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.000849 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. |