| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bellower (0) - 1 freq bellowed (1) - 2 freq bellow (2) - 3 freq follower (2) - 8 freq belltooer (2) - 1 freq mellowed (2) - 2 freq blower (2) - 2 freq billowed (2) - 1 freq bellows (2) - 6 freq bellises (3) - 1 freq followed (3) - 140 freq empower (3) - 2 freq sallowed (3) - 1 freq belther (3) - 1 freq bestowe (3) - 1 freq bulldozer (3) - 2 freq belle' (3) - 1 freq i'lower (3) - 1 freq belter (3) - 34 freq lower (3) - 57 freq teller (3) - 1 freq ballater (3) - 10 freq bellied (3) - 3 freq fellows (3) - 1 freq billowit (3) - 1 freq |
bellower (0) - 1 freq bellowed (2) - 2 freq bellows (3) - 6 freq billowed (3) - 1 freq blower (3) - 2 freq bellow (3) - 3 freq belltooer (3) - 1 freq follower (3) - 8 freq bueller (4) - 1 freq ballater (4) - 10 freq billows (4) - 1 freq billowit (4) - 1 freq billowy (4) - 1 freq billowin (4) - 3 freq mellowed (4) - 2 freq walloper (5) - 6 freq blooter (5) - 9 freq beyler (5) - 1 freq followeq (5) - 1 freq feller (5) - 1 freq seller (5) - 11 freq heller (5) - 3 freq belloch (5) - 3 freq allowed (5) - 126 freq yellaer (5) - 1 freq |
SoundEx code - B460 biler - 8 freq bellower - 1 freq boiler - 4 freq blearie - 5 freq blair' - 1 freq blair - 61 freq bleery - 1 freq blur - 12 freq bleary - 7 freq blare - 3 freq blurr - 1 freq beyler - 1 freq b'iler - 1 freq blirry - 1 freq blurry - 7 freq bueller - 1 freq baler - 4 freq byler - 3 freq bolero - 2 freq blear - 3 freq blue-ray - 1 freq bluer - 1 freq biyler - 1 freq blower - 2 freq €˜blawearie - 1 freq blawearie - 2 freq bliree - 1 freq balr - 1 freq blauweerie - 1 freq |
MetaPhone code - BLWR bellower - 1 freq blower - 2 freq €˜blawearie - 1 freq blawearie - 2 freq blauweerie - 1 freq |
BELLOWER |
| Time to execute Levenshtein function - 0.222946 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.373340 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.027241 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.037675 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.000815 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. |