| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waffles (0) - 1 freq waffle (1) - 8 freq raffles (1) - 3 freq baffles (1) - 1 freq waffled (1) - 1 freq raffled (2) - 2 freq baffies (2) - 21 freq wales (2) - 39 freq ruffles (2) - 1 freq yaffle's (2) - 1 freq waffness (2) - 1 freq waggles (2) - 1 freq warbles (2) - 3 freq weffle (2) - 1 freq waddles (2) - 1 freq warsles (2) - 2 freq daffies (2) - 4 freq waffted (2) - 2 freq waffed (2) - 4 freq raffle (2) - 13 freq wabbles (2) - 1 freq baffled (2) - 4 freq wafflin (2) - 2 freq waffer (2) - 1 freq riffles (2) - 2 freq |
waffles (0) - 1 freq baffles (2) - 1 freq waffled (2) - 1 freq raffles (2) - 3 freq waffle (2) - 8 freq riffles (3) - 2 freq waffs (3) - 7 freq wiffies (3) - 1 freq weffle (3) - 1 freq wafflin (3) - 2 freq ruffles (3) - 1 freq waffness (4) - 1 freq baffle (4) - 2 freq wales (4) - 39 freq baffies (4) - 21 freq wattles (4) - 1 freq wyffis (4) - 1 freq weeflas (4) - 3 freq raffled (4) - 2 freq feefles (4) - 1 freq waffer (4) - 1 freq caffle's (4) - 1 freq warsles (4) - 2 freq waddles (4) - 1 freq warbles (4) - 3 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 - WFLS weefla's - 3 freq waffles - 1 freq weeflas - 3 freq weevils - 1 freq |
WAFFLES |
| Time to execute Levenshtein function - 0.241384 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.608542 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.029348 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.080644 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.000886 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. |