| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bogles (0) - 23 freq bogle (1) - 45 freq boggles (1) - 3 freq bugles (1) - 1 freq boles (1) - 1 freq bogle' (1) - 1 freq bogies (1) - 3 freq boglet (1) - 1 freq poles (2) - 29 freq holes (2) - 71 freq bowes (2) - 1 freq bodes (2) - 3 freq boule (2) - 3 freq boies (2) - 1 freq brogues (2) - 7 freq bogged (2) - 3 freq bodies (2) - 180 freq begley (2) - 3 freq bogey (2) - 13 freq bools (2) - 23 freq biles (2) - 14 freq bouled (2) - 1 freq bodle (2) - 3 freq byles (2) - 5 freq bores (2) - 5 freq |
bogles (0) - 23 freq bugles (1) - 1 freq bogils (2) - 2 freq boglet (2) - 1 freq bogle' (2) - 1 freq bogies (2) - 3 freq boles (2) - 1 freq bogle (2) - 45 freq boggles (2) - 3 freq angles (3) - 25 freq ingles (3) - 1 freq boolies (3) - 1 freq bougies (3) - 1 freq bowls (3) - 20 freq belles (3) - 1 freq boils (3) - 4 freq bugle (3) - 2 freq bogus (3) - 3 freq eagles (3) - 11 freq bibles (3) - 6 freq bogs (3) - 17 freq coagles (3) - 1 freq aigles (3) - 1 freq bogeys (3) - 1 freq bolas (3) - 4 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 bos'll's - 1 freq buckles - 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 - 1 freq boggles - 3 freq bugles - 1 freq bugloss - 1 freq |
BOGLES |
| Time to execute Levenshtein function - 0.183176 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.319666 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.027614 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.037026 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.000844 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. |