| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bitterly (0) - 9 freq latterly (2) - 4 freq buttery (2) - 24 freq jittery (2) - 3 freq utterly (2) - 21 freq butterfly (2) - 7 freq sisterly (2) - 1 freq mitherly (2) - 3 freq battery (2) - 25 freq britherly (2) - 1 freq bitter (2) - 112 freq attery (3) - 1 freq titter (3) - 1 freq biter (3) - 1 freq fitters (3) - 3 freq beverly (3) - 3 freq bitey (3) - 1 freq buttered (3) - 19 freq yitter (3) - 1 freq butter (3) - 134 freq bitterest (3) - 1 freq dithery (3) - 1 freq fatherly (3) - 1 freq better (3) - 1 freq bittersie (3) - 2 freq |
bitterly (0) - 9 freq battery (3) - 25 freq bitter (3) - 112 freq latterly (3) - 4 freq butterfly (3) - 7 freq buttery (3) - 24 freq utterly (3) - 21 freq bettert (4) - 2 freq butteret (4) - 1 freq betterin (4) - 3 freq butterie (4) - 7 freq batters (4) - 8 freq betters (4) - 6 freq butterig (4) - 1 freq bettered (4) - 4 freq batter (4) - 74 freq buttert (4) - 7 freq batterit (4) - 1 freq battered (4) - 37 freq battell (4) - 1 freq butterin (4) - 2 freq better' (4) - 3 freq batterin (4) - 28 freq bittle (4) - 1 freq bittersie (4) - 2 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.415161 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.916082 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.091205 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.099972 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.000877 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. |