| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bitterly (0) - 9 freq utterly (2) - 18 freq battery (2) - 23 freq sisterly (2) - 1 freq latterly (2) - 4 freq mitherly (2) - 3 freq bitter (2) - 109 freq butterfly (2) - 7 freq britherly (2) - 1 freq buttery (2) - 24 freq jittery (2) - 3 freq witter (3) - 10 freq lottery (3) - 29 freq bitey (3) - 1 freq butter's (3) - 1 freq titters (3) - 1 freq ainerly (3) - 2 freq cattery (3) - 8 freq pottery (3) - 5 freq miserly (3) - 1 freq baitter (3) - 1 freq fittert (3) - 1 freq mitter (3) - 1 freq fitters (3) - 3 freq skittery (3) - 3 freq |
bitterly (0) - 9 freq bitter (3) - 109 freq latterly (3) - 4 freq buttery (3) - 24 freq utterly (3) - 18 freq battery (3) - 23 freq butterfly (3) - 7 freq butter (4) - 129 freq bittle (4) - 1 freq butterie (4) - 7 freq bittersie (4) - 2 freq batterin (4) - 26 freq buttert (4) - 7 freq batteren (4) - 1 freq buttered (4) - 19 freq batters (4) - 8 freq betterin (4) - 3 freq butteret (4) - 1 freq batter (4) - 68 freq battered (4) - 35 freq bettert (4) - 2 freq battert (4) - 7 freq butterin (4) - 2 freq batterit (4) - 1 freq better (4) - 1675 freq |
SoundEx code - B364 baitter-lookin - 1 freq buttérlumps - 1 freq better-like - 2 freq bitterly - 9 freq betrayal - 7 freq bedroll - 7 freq |
MetaPhone code - BTRL bitterly - 9 freq bedroll - 7 freq |
BITTERLY |
| Time to execute Levenshtein function - 0.207312 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.352294 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.027358 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.037617 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.000822 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. |