| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bagels (0) - 1 freq baters (2) - 2 freq ingels (2) - 2 freq boatels (2) - 1 freq baals (2) - 2 freq bowels (2) - 9 freq baets (2) - 6 freq babel's (2) - 1 freq labels (2) - 6 freq lapels (2) - 1 freq bales (2) - 17 freq baens (2) - 3 freq ages (2) - 153 freq balers (2) - 1 freq barely (2) - 97 freq lagers (2) - 2 freq bayes (2) - 1 freq angels (2) - 64 freq pages (2) - 132 freq bases (2) - 6 freq waels (2) - 4 freq bakes (2) - 17 freq bags (2) - 113 freq badges (2) - 11 freq babe's (2) - 1 freq |
bagels (0) - 1 freq bogils (2) - 2 freq baegers (3) - 1 freq begets (3) - 4 freq gaels (3) - 17 freq angels (3) - 64 freq bags (3) - 113 freq gels (3) - 1 freq engels (3) - 1 freq bevels (3) - 1 freq bogles (3) - 23 freq barls (3) - 1 freq bag's (3) - 2 freq bugles (3) - 1 freq bawls (3) - 5 freq balls (3) - 19 freq bogeys (3) - 1 freq boatels (3) - 1 freq bowels (3) - 9 freq bales (3) - 17 freq ingels (3) - 2 freq baals (3) - 2 freq balsa (4) - 1 freq boags (4) - 5 freq boag's (4) - 3 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 - BJLS beaujolais - 1 freq bogils - 2 freq budgells - 1 freq bagels - 1 freq |
BAGELS |
| Time to execute Levenshtein function - 0.240988 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.442580 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.027935 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.039659 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.001270 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. |