| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| befreendit (0) - 1 freq defreend (3) - 1 freq befriend (3) - 1 freq defendit (3) - 2 freq percentit (4) - 1 freq beforewedie (4) - 1 freq breirdit (4) - 2 freq beardit (4) - 2 freq decreeit (4) - 1 freq fendit (4) - 11 freq 'freend' (4) - 1 freq defendin (4) - 9 freq boyfreend (4) - 1 freq unfreendly (4) - 1 freq ereepit (4) - 1 freq treedit (4) - 1 freq bendit (4) - 2 freq pretendit (4) - 6 freq beheidit (4) - 6 freq neerendin (4) - 1 freq be-friended (4) - 1 freq freends' (4) - 1 freq blendit (4) - 3 freq brandit (4) - 5 freq breenie (4) - 1 freq |
befreendit (0) - 1 freq befriend (4) - 1 freq defreend (5) - 1 freq brandit (5) - 5 freq boyfreend (5) - 1 freq defendit (5) - 2 freq freendly (6) - 36 freq freendlie (6) - 3 freq beirdit (6) - 1 freq offendit (6) - 10 freq brendin (6) - 1 freq breardit (6) - 2 freq breidit (6) - 1 freq boyfriend (6) - 39 freq boyfriends (6) - 2 freq freends (6) - 181 freq unfreends (6) - 3 freq breingit (6) - 1 freq blendit (6) - 3 freq freend (6) - 153 freq breengt (6) - 1 freq breirdit (6) - 2 freq bendit (6) - 2 freq beforewedie (6) - 1 freq fendit (6) - 11 freq |
SoundEx code - B165 boyfriend - 39 freq befriend - 1 freq beforehand - 1 freq bavarian - 3 freq be-friended - 1 freq boyfriend's - 1 freq beforehaun - 1 freq boyfriends - 2 freq boy-freend's - 1 freq befreendit - 1 freq boyfrien - 1 freq boyfreend - 1 freq bew-prents - 1 freq bufferin - 1 freq bobbrown - 2 freq bovverin - 1 freq |
MetaPhone code - BFRNTT be-friended - 1 freq befreendit - 1 freq |
BEFREENDIT freen - 220 freq friend - 87 freq freens - 241 freq friends - 79 freq freends - 181 freq freend - 153 freq freendly - 36 freq freenship - 14 freq freendship - 15 freq freenly - 22 freq freen's - 10 freq girlfreend - 4 freq freen' - 2 freq unfreends - 3 freq freends-and-faimly - 2 freq freendlie - 3 freq freendlier - 2 freq freenships - 3 freq befreendit - 1 freq |
| Time to execute Levenshtein function - 0.233700 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.421044 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.029542 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.038599 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.001048 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. |