| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utterance (0) - 4 freq utterances (1) - 2 freq utteran (2) - 1 freq mutteran (3) - 4 freq uterine (3) - 1 freq cuttance (3) - 7 freq utterin (3) - 3 freq tolerance (3) - 7 freq torrance (3) - 1 freq trance (3) - 10 freq sustenance (3) - 2 freq apperance (3) - 2 freq uttering (3) - 1 freq soverance (3) - 3 freq entrance (3) - 51 freq terence (3) - 1 freq iggerance (3) - 2 freq owerance (3) - 35 freq attendance (3) - 13 freq sufferance (3) - 1 freq governance (4) - 19 freq strange (4) - 146 freq futterat's (4) - 1 freq butterflee (4) - 10 freq sttrang (4) - 1 freq |
utterance (0) - 4 freq utterances (2) - 2 freq utteran (3) - 1 freq uttering (4) - 1 freq trance (4) - 10 freq terence (4) - 1 freq torrance (4) - 1 freq entrance (4) - 51 freq tolerance (4) - 7 freq utterin (4) - 3 freq tolerence (5) - 1 freq etterin (5) - 1 freq attendance (5) - 13 freq owerance (5) - 35 freq attrac (5) - 1 freq trunce (5) - 3 freq cateraneco (5) - 9 freq apperance (5) - 2 freq iggerance (5) - 2 freq cuttance (5) - 7 freq uterine (5) - 1 freq mutteran (5) - 4 freq soverance (5) - 3 freq reuerence (6) - 1 freq attract (6) - 7 freq |
SoundEx code - U365 uterine - 1 freq uttering - 1 freq utterance - 4 freq utterances - 2 freq utteran - 1 freq utterin - 3 freq u-turns - 1 freq u-turn - 1 freq |
MetaPhone code - UTRNS utterance - 4 freq u-turns - 1 freq |
UTTERANCE |
| Time to execute Levenshtein function - 0.229302 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.371658 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.028273 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.037168 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.000905 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. |