| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utterances (0) - 2 freq utterance (1) - 4 freq attendances (3) - 5 freq entrances (3) - 1 freq utteran (3) - 1 freq owerances (3) - 1 freq traeces (4) - 1 freq apperance (4) - 2 freq entrance (4) - 49 freq sternies (4) - 1 freq references (4) - 41 freq butterflees (4) - 14 freq yatt-races (4) - 1 freq greeances (4) - 1 freq owerance (4) - 35 freq butternuts (4) - 1 freq literacies (4) - 1 freq trance (4) - 10 freq entrance's (4) - 1 freq stances (4) - 4 freq attracks (4) - 1 freq uttering (4) - 1 freq veteran's (4) - 1 freq tolerance (4) - 7 freq veterans (4) - 8 freq |
utterances (0) - 2 freq utterance (2) - 4 freq entrances (4) - 1 freq utteran (5) - 1 freq owerances (5) - 1 freq attendances (5) - 5 freq prances (6) - 1 freq terraces (6) - 4 freq tranches (6) - 1 freq attracts (6) - 2 freq veterans (6) - 8 freq interfaces (6) - 1 freq traces (6) - 6 freq torrance (6) - 1 freq clearances (6) - 12 freq appearances (6) - 9 freq frances (6) - 15 freq caterans (6) - 5 freq entranced (6) - 3 freq tolerance (6) - 7 freq quittances (6) - 1 freq terence (6) - 1 freq utterin (6) - 3 freq assurances (6) - 2 freq greeances (6) - 1 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 - UTRNSS utterances - 2 freq |
UTTERANCES |
| Time to execute Levenshtein function - 0.490640 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.994899 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.084948 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.040815 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.000948 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. |