| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boggles (0) - 3 freq bogles (1) - 23 freq toggles (1) - 1 freq boggle (1) - 1 freq goggles (1) - 10 freq juggles (2) - 1 freq toggle (2) - 1 freq doggies (2) - 1 freq weggles (2) - 1 freq baggies (2) - 7 freq buggies (2) - 3 freq coagles (2) - 1 freq muggles (2) - 3 freq boatles (2) - 6 freq bottles (2) - 115 freq boggie (2) - 4 freq wiggles (2) - 2 freq bangles (2) - 3 freq coggies (2) - 1 freq bogle' (2) - 1 freq bogle (2) - 45 freq bobbles (2) - 1 freq moggies (2) - 1 freq bogies (2) - 3 freq bogils (2) - 2 freq |
boggles (0) - 3 freq goggles (2) - 10 freq boggle (2) - 1 freq bogles (2) - 23 freq toggles (2) - 1 freq jiggles (3) - 2 freq bogils (3) - 2 freq giggles (3) - 6 freq waggles (3) - 1 freq bangles (3) - 3 freq bungles (3) - 1 freq bugles (3) - 1 freq wiggles (3) - 2 freq baggies (3) - 7 freq buggies (3) - 3 freq weggles (3) - 1 freq muggles (3) - 3 freq juggles (3) - 1 freq buggers (4) - 31 freq biggans (4) - 6 freq goggle (4) - 1 freq foggies (4) - 2 freq googlies (4) - 1 freq biggars (4) - 2 freq joggled (4) - 1 freq |
SoundEx code - B242 bauchles - 4 freq bassless - 1 freq bogles - 23 freq bessie-like - 1 freq big-league - 1 freq buikless - 1 freq backless - 1 freq buccleuch - 9 freq buckles - 2 freq bos'll's - 1 freq boggles - 3 freq bushels - 1 freq beaujolais - 1 freq bugles - 1 freq bugloss - 1 freq bacillus - 1 freq boswells - 1 freq bogils - 2 freq beiklik - 1 freq bucolic - 1 freq backlash - 1 freq bjlyq - 1 freq bowieglastonbury - 1 freq bikelists - 1 freq buzlakd - 1 freq bagels - 1 freq bglsxg - 1 freq bscglasgowfc - 1 freq |
MetaPhone code - BKLS bogles - 23 freq buikless - 1 freq backless - 1 freq buckles - 2 freq boggles - 3 freq bugles - 1 freq bugloss - 1 freq |
BOGGLES |
| Time to execute Levenshtein function - 0.225647 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.355040 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.028199 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.038224 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.000933 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. |