| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utensils (0) - 4 freq tonsils (2) - 2 freq tentily (3) - 22 freq tennis (3) - 23 freq pencils (3) - 9 freq sensins (3) - 1 freq teitils (3) - 2 freq tensely (3) - 2 freq taenails (3) - 2 freq tendis (3) - 1 freq pendils (3) - 1 freq tension (3) - 32 freq tossils (3) - 1 freq 'tentily (3) - 1 freq stencil (3) - 1 freq tenses (3) - 7 freq lentils (3) - 2 freq tendrils (3) - 3 freq tensions (3) - 3 freq uneasily (3) - 4 freq strepsils (3) - 2 freq tensin (3) - 1 freq dentals (4) - 1 freq teensiest (4) - 1 freq extensive (4) - 8 freq |
utensils (0) - 4 freq tonsils (2) - 2 freq tenses (4) - 7 freq tossils (4) - 1 freq taenails (4) - 2 freq tensely (4) - 2 freq tensions (4) - 3 freq coonsels (5) - 1 freq tunnels (5) - 11 freq tinsel (5) - 12 freq theesels (5) - 1 freq ainsels (5) - 1 freq hansels (5) - 3 freq tossels (5) - 1 freq toonmils (5) - 1 freq tynsale (5) - 1 freq tonnels (5) - 1 freq tentles (5) - 2 freq tinsell (5) - 1 freq ransels (5) - 1 freq sneesls (5) - 1 freq uneasily (5) - 4 freq teitils (5) - 2 freq tendis (5) - 1 freq pendils (5) - 1 freq |
SoundEx code - U352 udny's - 1 freq utmaist - 6 freq utensils - 4 freq utmjnbvoti - 1 freq udnyquine - 3 freq utmost - 3 freq |
MetaPhone code - UTNSLS utensils - 4 freq |
UTENSILS |
| Time to execute Levenshtein function - 0.429565 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.798232 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.083031 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.038941 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.000792 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. |