| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bearable (0) - 5 freq parable (2) - 54 freq unbearable (2) - 2 freq arable (2) - 8 freq venerable (3) - 1 freq warkable (3) - 1 freq reliable (3) - 5 freq peaceable (3) - 2 freq merble (3) - 2 freq unbeatable (3) - 2 freq tradable (3) - 1 freq desirable (3) - 4 freq memorable (3) - 10 freq adorable (3) - 8 freq meeracle (3) - 5 freq tea-table (3) - 1 freq seeable (3) - 1 freq barnacle (3) - 1 freq beanpole (3) - 1 freq debatable (3) - 1 freq biddable (3) - 7 freq tenable (3) - 1 freq deeable (3) - 1 freq enable (3) - 4 freq kennable (3) - 3 freq |
bearable (0) - 5 freq unbearable (3) - 2 freq arable (3) - 8 freq parable (3) - 54 freq bramble (4) - 1 freq adorable (4) - 8 freq birnable (4) - 1 freq marble (4) - 20 freq barbie (4) - 3 freq bauble (4) - 3 freq babble (4) - 2 freq variable (4) - 5 freq merble (4) - 2 freq barbed (5) - 4 freq brawl (5) - 1 freq bumble (5) - 2 freq barley (5) - 31 freq birsle (5) - 1 freq braaly (5) - 42 freq hereablo (5) - 1 freq bible (5) - 93 freq beurla (5) - 1 freq brawly (5) - 36 freq gorble (5) - 2 freq barbs (5) - 1 freq |
SoundEx code - B614 barraful'll - 1 freq barraful - 1 freq bravely - 8 freq birblin - 1 freq birples - 1 freq briefly - 18 freq borrow-foo'll - 1 freq bravelies - 2 freq bearable - 5 freq barrowful - 2 freq überfließt - 1 freq bor-fly - 1 freq brieflie - 1 freq breefly - 1 freq |
MetaPhone code - BRBL bearable - 5 freq |
BEARABLE |
| Time to execute Levenshtein function - 0.289407 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.414461 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.027037 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.036843 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.000816 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. |