| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bowsied-app (0) - 1 freq bowsier (5) - 1 freq bosied (5) - 7 freq guddled-app (5) - 1 freq lowse-up (5) - 1 freq bowsie (5) - 8 freq boozed-up (5) - 2 freq bevvied-up (5) - 1 freq rowed-up (5) - 2 freq bowdie (6) - 1 freq boulievard (6) - 1 freq bowkin-fou (6) - 1 freq rose-hip (6) - 1 freq borried (6) - 1 freq backed-up (6) - 1 freq doubled-up (6) - 3 freq trussed-up (6) - 1 freq towsie (6) - 3 freq bonxied (6) - 1 freq busied (6) - 1 freq boysadear (6) - 1 freq bowed (6) - 38 freq bowled (6) - 1 freq hoosiermama (6) - 1 freq bossed (6) - 6 freq |
bowsied-app (0) - 1 freq rowed-up (8) - 2 freq boozed-up (8) - 2 freq lowse-up (8) - 1 freq bevvied-up (8) - 1 freq backed-up (9) - 1 freq wind-up (9) - 2 freq bound-up (9) - 1 freq bosied (9) - 7 freq guddled-app (9) - 1 freq bowsie (9) - 8 freq bowsier (9) - 1 freq howkit-up (10) - 1 freq bowfed (10) - 1 freq rowein-up (10) - 1 freq bowster (10) - 12 freq growed-up (10) - 1 freq bodie-kyn (10) - 1 freq used-an (10) - 1 freq bowser's (10) - 1 freq rowed-oot (10) - 1 freq growed-ups (10) - 1 freq bowsters (10) - 2 freq bowsterous (10) - 2 freq coiled-up (10) - 1 freq |
SoundEx code - B231 back-tae-front - 4 freq bowsied-app - 1 freq bus-stap - 2 freq backed-up - 1 freq bucketfu - 1 freq backstabbins - 1 freq basketball - 4 freq basketbaw - 5 freq bus-stop - 1 freq back-step - 1 freq boozed-up - 2 freq basketbaa - 1 freq boastful - 1 freq bucketfaes - 1 freq bqdv - 1 freq bestbehaviour - 1 freq bestpainterinhawick - 2 freq bctv - 1 freq bestbehavedbat - 1 freq besutiful - 1 freq beachedbirdsurvey - 1 freq bbcoutofdoors - 3 freq bbcdebatenight - 2 freq bpgtbkn - 1 freq bgtbhlub - 1 freq backstabbers - 1 freq bestford - 1 freq |
MetaPhone code - BSTP bowsied-app - 1 freq boozed-up - 2 freq |
BOWSIED-APP |
| Time to execute Levenshtein function - 0.216220 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.378466 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.028083 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.036949 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. |