| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unbiddan (0) - 1 freq unbidden (1) - 6 freq unloddan (2) - 1 freq noddan (3) - 1 freq nahddan (3) - 1 freq oonbidden (3) - 1 freq inbidin (3) - 5 freq undoan (3) - 2 freq bidden (3) - 36 freq bidan (3) - 9 freq biddin (3) - 30 freq buddan (3) - 1 freq unwindin (3) - 2 freq loddan (4) - 1 freq unmovan (4) - 1 freq mindan (4) - 7 freq unkind (4) - 2 freq knidgin (4) - 2 freq unpickin (4) - 1 freq widdas (4) - 1 freq untidy (4) - 1 freq riddin (4) - 1 freq noaddin (4) - 5 freq unicorn (4) - 61 freq unbiased (4) - 3 freq |
unbiddan (0) - 1 freq unbidden (1) - 6 freq oonbidden (3) - 1 freq unloddan (3) - 1 freq bidden (4) - 36 freq buddan (4) - 1 freq noddan (4) - 1 freq inbidin (4) - 5 freq nahddan (4) - 1 freq biddin (4) - 30 freq noddin (5) - 39 freq beddin (5) - 16 freq onybiddy (5) - 8 freq noaddin (5) - 5 freq embeddin (5) - 1 freq buddin (5) - 11 freq unwindin (5) - 2 freq undoan (5) - 2 freq bidan (5) - 9 freq annidder (6) - 3 freq biddie (6) - 1 freq whiddin (6) - 1 freq affbidden (6) - 1 freq wuiddin (6) - 1 freq unboadied (6) - 1 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 9 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unfathomably - 1 freq unbitter - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbothered - 1 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UNBTN unbidden - 6 freq unbutton - 2 freq unbiddan - 1 freq |
UNBIDDAN |
| Time to execute Levenshtein function - 0.468703 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.903586 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.076742 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.039959 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.000895 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. |