| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wab-lake (0) - 1 freq waa-like (2) - 1 freq wallace (3) - 118 freq ablaze (3) - 5 freq cat-like (3) - 1 freq warm-like (3) - 1 freq rat-like (3) - 1 freq wean-like (3) - 1 freq blake (3) - 9 freq wab-cams (3) - 1 freq saw-like (3) - 1 freq ae-lane (3) - 2 freq waeklike (3) - 1 freq wabblie (3) - 1 freq wabble (3) - 3 freq walkt (4) - 28 freq wan-man (4) - 1 freq wangrace (4) - 1 freq jabblie (4) - 1 freq wobble (4) - 2 freq wammle (4) - 2 freq warle (4) - 1 freq swabble (4) - 1 freq wanease (4) - 1 freq wa-gang (4) - 1 freq |
wab-lake (0) - 1 freq waa-like (3) - 1 freq wean-like (4) - 1 freq wise-like (5) - 3 freq wyce-like (5) - 15 freq wabble (5) - 3 freq wabblie (5) - 1 freq wyse-like (5) - 1 freq owre-like (5) - 1 freq awfy-like (5) - 1 freq waeklike (5) - 1 freq wyce-lyke (5) - 2 freq wice-like (5) - 3 freq warm-like (5) - 1 freq blake (5) - 9 freq cat-like (5) - 1 freq rat-like (5) - 1 freq saw-like (5) - 1 freq same-lyke (6) - 1 freq och-like (6) - 1 freq sac-lik (6) - 1 freq odd-like (6) - 1 freq gay-lik (6) - 1 freq gah-lik (6) - 1 freq wabblit (6) - 1 freq |
SoundEx code - W142 wobbles - 1 freq wheeples - 1 freq weefla's - 3 freq wab-lake - 1 freq waffles - 1 freq weeflas - 3 freq whiplash - 1 freq wab-fleesh - 1 freq wabbles - 1 freq weevils - 1 freq wheipils - 1 freq wpljb - 1 freq wvfpllajhz - 1 freq |
MetaPhone code - WBLK wab-lake - 1 freq |
WAB-LAKE |
| Time to execute Levenshtein function - 0.307513 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.501856 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.029433 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.038929 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.001010 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. |