| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| biddable (0) - 7 freq birnable (2) - 1 freq riddance (3) - 4 freq lik'able (3) - 1 freq sizeable (3) - 4 freq i'table (3) - 1 freq tradable (3) - 1 freq wirkable (3) - 1 freq diddle (3) - 14 freq bible (3) - 93 freq ddale (3) - 1 freq visable (3) - 1 freq hiddle (3) - 10 freq hiddae (3) - 3 freq disable (3) - 1 freq fiddle (3) - 52 freq piddle (3) - 3 freq riddle (3) - 32 freq likeable (3) - 2 freq liddle (3) - 1 freq liable (3) - 4 freq sitable (3) - 2 freq beddal (3) - 4 freq widdae (3) - 1 freq winnable (3) - 1 freq |
biddable (0) - 7 freq beddal (4) - 4 freq birnable (4) - 1 freq liddle (5) - 1 freq piddle (5) - 3 freq riddle (5) - 32 freq middle (5) - 491 freq baddiel (5) - 1 freq biddie (5) - 1 freq bearable (5) - 5 freq fiddle (5) - 52 freq tiddle (5) - 1 freq disable (5) - 1 freq diddle (5) - 14 freq tradable (5) - 1 freq bible (5) - 93 freq ddale (5) - 1 freq hiddle (5) - 10 freq hiddil (6) - 2 freq €œdouble (6) - 1 freq buddie (6) - 28 freq siddenly (6) - 17 freq biddin (6) - 30 freq bidding (6) - 4 freq meddle (6) - 9 freq |
SoundEx code - B314 beautiful - 128 freq beautifully - 3 freq byoo-ootiful - 4 freq beauti-ful - 3 freq biddable - 7 freq beau-ootiful - 7 freq bedevilled - 1 freq body-builder - 1 freq 'beautiful - 2 freq bedivvils - 1 freq bootpolish - 1 freq beautifulmumsie - 1 freq bottybolingoli - 1 freq |
MetaPhone code - BTBL biddable - 7 freq |
BIDDABLE |
| Time to execute Levenshtein function - 0.186003 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.326449 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.027446 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.036896 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.000964 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. |