Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
believes (0) - 17 freq believet (1) - 1 freq relieves (1) - 2 freq believer (1) - 4 freq believed (1) - 48 freq believers (1) - 1 freq beleves (1) - 1 freq believe (1) - 596 freq beleve (2) - 6 freq believt (2) - 1 freq beleved (2) - 2 freq beleeve (2) - 5 freq belíeves (2) - 1 freq relieve (2) - 2 freq believin (2) - 13 freq bealieve (2) - 1 freq 'believe (2) - 3 freq belies (2) - 1 freq relieved (2) - 38 freq belive (2) - 2 freq believe't (2) - 4 freq belteve (2) - 1 freq elieven (2) - 3 freq beliefs (2) - 22 freq baelieved (2) - 1 freq |
believes (0) - 17 freq beleves (1) - 1 freq relieves (2) - 2 freq believet (2) - 1 freq believers (2) - 1 freq believe (2) - 596 freq believer (2) - 4 freq believed (2) - 48 freq beliefs (3) - 22 freq belies (3) - 1 freq baelieve (3) - 6 freq believit (3) - 3 freq bealieve (3) - 1 freq baelieved (3) - 1 freq belive (3) - 2 freq believt (3) - 1 freq beleved (3) - 2 freq beleve (3) - 6 freq believin (3) - 13 freq beleeve (3) - 5 freq elves (4) - 10 freq beloved (4) - 25 freq olives (4) - 17 freq sleeves (4) - 26 freq blibes (4) - 1 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 - BLFS beliefs - 22 freq believes - 17 freq bailiffs - 1 freq belíeves - 1 freq beleves - 1 freq |
BELIEVES |
Time to execute Levenshtein function - 0.195041 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.359642 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.030719 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.045951 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.000837 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. |