| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wobblin (0) - 3 freq wabblin (1) - 5 freq gobblin (1) - 1 freq hobblin (1) - 2 freq jibblin (2) - 1 freq wobbler (2) - 1 freq wamblin (2) - 1 freq babblin (2) - 2 freq gabblin (2) - 4 freq bubblin (2) - 29 freq wabblit (2) - 1 freq yabblin (2) - 2 freq wabblie (2) - 1 freq nabblin (2) - 1 freq nibblin (2) - 7 freq wobbled (2) - 1 freq wobble (2) - 2 freq bobbin (2) - 22 freq dobbin (2) - 13 freq gorblin (2) - 2 freq fobbin (2) - 3 freq lobbyin (2) - 2 freq doublin (2) - 6 freq wobbles (2) - 1 freq dibblin (2) - 1 freq |
wobblin (0) - 3 freq wabblin (1) - 5 freq hobblin (2) - 2 freq gobblin (2) - 1 freq dibblin (3) - 1 freq wobbles (3) - 1 freq warblin (3) - 1 freq wobble (3) - 2 freq mbblin (3) - 1 freq bibblin (3) - 2 freq wobbly (3) - 6 freq nibblin (3) - 7 freq wabbin (3) - 1 freq wobbled (3) - 1 freq gabblin (3) - 4 freq bubblin (3) - 29 freq wabblit (3) - 1 freq babblin (3) - 2 freq wamblin (3) - 1 freq jibblin (3) - 1 freq wobbler (3) - 1 freq nabblin (3) - 1 freq yabblin (3) - 2 freq wabblie (3) - 1 freq goblin (4) - 9 freq |
SoundEx code - W145 wheeplin - 8 freq wavelength - 2 freq 'wavelength' - 1 freq wabblin - 5 freq wobblin - 3 freq wafflin - 2 freq wafflin' - 1 freq wufflmleny - 1 freq |
MetaPhone code - WBLN wabblin - 5 freq wobblin - 3 freq |
WOBBLIN |
| Time to execute Levenshtein function - 0.375813 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.700806 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.031682 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.078664 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.001063 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. |