| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utterly (0) - 21 freq uttered (2) - 10 freq utteran (2) - 1 freq buttery (2) - 24 freq uttert (2) - 1 freq utter (2) - 63 freq €œutterly (2) - 1 freq attery (2) - 1 freq butterfly (2) - 7 freq utterin (2) - 3 freq guttery (2) - 3 freq bitterly (2) - 9 freq latterly (2) - 4 freq cuttitly (3) - 2 freq erly (3) - 3 freq ferly (3) - 20 freq queerly (3) - 1 freq ainerly (3) - 2 freq teely (3) - 1 freq sisterly (3) - 1 freq tery (3) - 1 freq futtered (3) - 1 freq cheerly (3) - 1 freq sudderly (3) - 1 freq uthers (3) - 1 freq |
utterly (0) - 21 freq attery (3) - 1 freq utterin (3) - 3 freq latterly (3) - 4 freq bitterly (3) - 9 freq utter (3) - 63 freq uttered (3) - 10 freq uttert (3) - 1 freq utteran (3) - 1 freq etter (4) - 2 freq atterie (4) - 4 freq easterly (4) - 4 freq atter (4) - 1 freq actorly (4) - 2 freq otter (4) - 3 freq aesterly (4) - 2 freq otters (4) - 3 freq etterin (4) - 1 freq butterfly (4) - 7 freq €œutterly (4) - 1 freq buttery (4) - 24 freq otteris (4) - 1 freq guttery (4) - 3 freq mutterin (5) - 40 freq buttert (5) - 7 freq |
SoundEx code - U364 utterly - 21 freq €œutterly - 1 freq |
MetaPhone code - UTRL utterly - 21 freq €œutterly - 1 freq |
UTTERLY |
| Time to execute Levenshtein function - 0.176084 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.334749 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.027450 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.038239 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.000942 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. |