Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
identified (0) - 16 freq identifiet (1) - 1 freq identifie (1) - 1 freq identifeed (1) - 2 freq identifies (1) - 5 freq identifee (2) - 5 freq identifin' (2) - 1 freq identities (2) - 17 freq identitie (2) - 17 freq unidentified (2) - 1 freq identifeein (3) - 1 freq identifyin (3) - 4 freq settified (3) - 1 freq setified (3) - 2 freq identify (3) - 22 freq intensified (3) - 1 freq identifying (3) - 1 freq identifeeit (3) - 2 freq identifyin' (3) - 3 freq magnified (4) - 2 freq destinies (4) - 1 freq ventired (4) - 4 freq destined (4) - 12 freq clessified (4) - 3 freq idealised (4) - 1 freq |
identified (0) - 16 freq identifeed (1) - 2 freq identifies (2) - 5 freq identifie (2) - 1 freq identifiet (2) - 1 freq identifee (3) - 5 freq unidentified (3) - 1 freq identifyin (4) - 4 freq identifeeit (4) - 2 freq identifeein (4) - 1 freq identify (4) - 22 freq identitie (4) - 17 freq identifin' (4) - 1 freq identities (4) - 17 freq settified (5) - 1 freq ideentify (5) - 1 freq notified (5) - 2 freq setified (5) - 2 freq identifyin' (5) - 3 freq dented (5) - 2 freq identifying (5) - 1 freq unified (6) - 3 freq identical (6) - 19 freq setifeed (6) - 1 freq gratified (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 - ITNTFT identified - 16 freq identifeed - 2 freq identifeeit - 2 freq identifiet - 1 freq |
IDENTIFIED |
Time to execute Levenshtein function - 0.195111 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.365252 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.027271 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.041550 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.000888 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. |