| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bellabeg (0) - 1 freq bellied (3) - 3 freq bella' (3) - 1 freq bellies (3) - 22 freq bellie (3) - 6 freq bellas (3) - 1 freq belle (3) - 17 freq yellaer (3) - 1 freq ceolbeg (3) - 1 freq belhaven (3) - 2 freq bellowed (3) - 2 freq belle' (3) - 1 freq ballater (3) - 10 freq meelbeg (3) - 1 freq bernabeu (3) - 1 freq bellower (3) - 1 freq yellaes (3) - 2 freq bella (3) - 96 freq ballade (3) - 3 freq belles (3) - 1 freq belang (3) - 86 freq bella's (3) - 5 freq belated (3) - 6 freq fellae (3) - 40 freq yellae (3) - 55 freq |
bellabeg (0) - 1 freq bulldog (5) - 3 freq bellany (5) - 1 freq bella's (5) - 5 freq belang (5) - 86 freq ballade (5) - 3 freq bulldeug (5) - 1 freq bullybeef (5) - 1 freq bellises (5) - 1 freq blawbag (5) - 1 freq bellyboley (5) - 1 freq ballboy (5) - 2 freq bullying (5) - 4 freq bellae'd (5) - 1 freq bella (5) - 96 freq belles (5) - 1 freq bellas (5) - 1 freq belle (5) - 17 freq bulldug (5) - 2 freq bellie (5) - 6 freq bellies (5) - 22 freq bellied (5) - 3 freq bella' (5) - 1 freq bellowed (5) - 2 freq ceolbeg (5) - 1 freq |
SoundEx code - B412 boolie-backit - 1 freq balbogie - 2 freq beliefs - 24 freq blobs - 4 freq bulbs - 8 freq bellabeg - 1 freq believes - 18 freq bulbous - 4 freq bleeps - 1 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 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 - BLBK bellabeg - 1 freq blawbag - 1 freq |
BELLABEG |
| Time to execute Levenshtein function - 0.247603 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.365015 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.028276 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.038565 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.000910 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. |