| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| belfast (0) - 46 freq bilfawst (2) - 35 freq blast (2) - 70 freq belfastcc (2) - 1 freq brekfast (2) - 13 freq beast (2) - 141 freq ballast (2) - 4 freq belfast's (2) - 1 freq bellas (2) - 1 freq beasts (3) - 144 freq beas (3) - 3 freq becase (3) - 15 freq pleast (3) - 6 freq beast- (3) - 1 freq befa (3) - 2 freq bluest (3) - 1 freq blist (3) - 32 freq beltane (3) - 3 freq belaw (3) - 1 freq bedpost (3) - 1 freq ballant (3) - 11 freq helgas (3) - 1 freq becas (3) - 5 freq brakfast (3) - 33 freq breakfast (3) - 138 freq |
belfast (0) - 46 freq ballast (3) - 4 freq bilfawst (3) - 35 freq blast (3) - 70 freq blest (4) - 1 freq blaist (4) - 1 freq blist (4) - 32 freq ballest (4) - 3 freq bluest (4) - 1 freq bloust (4) - 1 freq blisst (4) - 19 freq beast (4) - 141 freq brekfast (4) - 13 freq bellas (4) - 1 freq belfastcc (4) - 1 freq belfast's (4) - 1 freq blatt (5) - 2 freq belies (5) - 1 freq ballat (5) - 1 freq belts (5) - 13 freq beltit (5) - 14 freq belmont (5) - 6 freq breast (5) - 12 freq delft (5) - 2 freq beluvit (5) - 7 freq |
SoundEx code - B412 boolie-backit - 1 freq balbogie - 2 freq beliefs - 22 freq blobs - 4 freq bulbs - 8 freq bellabeg - 1 freq believes - 17 freq bailiffs - 1 freq bilfawst - 35 freq belfast - 46 freq belfast's - 1 freq blawbag - 1 freq blebs - 1 freq bulovka - 3 freq blae-faced - 2 freq bouillabaisse - 1 freq bulbous - 2 freq belíeves - 1 freq blibes - 1 freq blae-backit - 1 freq beleves - 1 freq belfastpride - 1 freq belfastbooks - 2 freq belfastcc - 1 freq belfastman - 1 freq belfastblogs - 1 freq byleaveswelive - 49 freq bilbaokultura - 1 freq belfastairport - 1 freq belfastunionist - 1 freq billyvacant - 3 freq belfastbhoy - 1 freq |
MetaPhone code - BLFST bilfawst - 35 freq belfast - 46 freq blae-faced - 2 freq |
BELFAST |
| Time to execute Levenshtein function - 0.181632 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.352213 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.029044 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.038392 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.000922 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. |