Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
identities (0) - 17 freq identitie (1) - 17 freq identifies (1) - 5 freq identified (2) - 16 freq entities (2) - 15 freq identityis (2) - 1 freq identifiet (2) - 1 freq identifie (2) - 1 freq densities (2) - 1 freq dentition (3) - 1 freq denties (3) - 2 freq quantities (3) - 3 freq densitie (3) - 1 freq identifeed (3) - 2 freq deities (3) - 2 freq destinies (3) - 1 freq immensities (3) - 1 freq identifin' (3) - 1 freq amenities (3) - 4 freq aidentitee (3) - 1 freq identity' (3) - 2 freq identifee (3) - 5 freq identity (3) - 162 freq ideologies (4) - 4 freq prentices (4) - 1 freq |
identities (0) - 17 freq identityis (2) - 1 freq identifies (2) - 5 freq identitie (2) - 17 freq densities (3) - 1 freq entities (3) - 15 freq quantities (4) - 3 freq identity (4) - 162 freq denties (4) - 2 freq identity' (4) - 2 freq aidentitee (4) - 1 freq identified (4) - 16 freq dentition (4) - 1 freq identifie (4) - 1 freq identifiet (4) - 1 freq densitie (5) - 1 freq dentures (5) - 6 freq dentit (5) - 3 freq deinties (5) - 2 freq dentists (5) - 1 freq destinies (5) - 1 freq identifeed (5) - 2 freq identifee (5) - 5 freq ditties (5) - 1 freq amenities (5) - 4 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 - ITNTTS identities - 17 freq |
IDENTITIES |
Time to execute Levenshtein function - 0.202672 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.419010 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.027845 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.037457 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.000857 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. |