| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| identifying (0) - 1 freq identifyin (1) - 4 freq identifyin' (1) - 3 freq identifin' (2) - 1 freq identifie (3) - 1 freq identifiet (3) - 1 freq identifies (3) - 5 freq identityis (3) - 1 freq identified (3) - 16 freq identify (3) - 22 freq identifeein (3) - 1 freq identifeeit (4) - 2 freq destroying (4) - 4 freq identity (4) - 162 freq unifying (4) - 1 freq identity' (4) - 2 freq intensifyin (4) - 1 freq enticing (4) - 1 freq identitie (4) - 17 freq identities (4) - 17 freq identifeed (4) - 2 freq mentioning (4) - 2 freq ideentify (4) - 1 freq identifee (4) - 5 freq denying (4) - 3 freq |
identifying (0) - 1 freq identifyin' (2) - 3 freq identifyin (2) - 4 freq identifin' (3) - 1 freq identifeein (4) - 1 freq identified (5) - 16 freq identify (5) - 22 freq identifiet (5) - 1 freq identifie (5) - 1 freq identifies (5) - 5 freq identifeed (6) - 2 freq mentioning (6) - 2 freq denying (6) - 3 freq enticing (6) - 1 freq identifee (6) - 5 freq ideentify (6) - 1 freq destroying (6) - 4 freq identifeeit (6) - 2 freq identityis (6) - 1 freq denoting (6) - 1 freq unifying (6) - 1 freq tenting (7) - 1 freq donating (7) - 2 freq venturing (7) - 2 freq dentition (7) - 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 - ITNTFYNK identifying - 1 freq |
IDENTIFYING |
| Time to execute Levenshtein function - 0.379721 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.657569 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.027885 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.087280 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.000933 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. |