| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bernard (0) - 5 freq bernards (1) - 1 freq leonard (2) - 63 freq gerard (2) - 2 freq byrnand (2) - 1 freq garnard (2) - 1 freq reynard (2) - 3 freq gerrard (2) - 1 freq birnand (2) - 2 freq bernam (2) - 1 freq bernard's (2) - 2 freq bernagh (2) - 1 freq beard (2) - 54 freq for'ard (3) - 2 freq derned (3) - 5 freq herald (3) - 33 freq bedford (3) - 1 freq bussard (3) - 1 freq burner (3) - 3 freq beards (3) - 12 freq buzzard (3) - 3 freq werna (3) - 13 freq leonardo (3) - 3 freq weyward (3) - 1 freq errand (3) - 5 freq |
bernard (0) - 5 freq bernards (2) - 1 freq reynard (3) - 3 freq garnard (3) - 1 freq birnand (3) - 2 freq byrnand (3) - 1 freq cornyard (4) - 2 freq borned (4) - 1 freq birned (4) - 1 freq burners (4) - 7 freq byornar (4) - 13 freq braird (4) - 3 freq barcardi (4) - 1 freq borraed (4) - 8 freq burner (4) - 3 freq burned (4) - 31 freq brand (4) - 51 freq breird (4) - 1 freq gerard (4) - 2 freq bernard's (4) - 2 freq bernagh (4) - 1 freq leonard (4) - 63 freq gerrard (4) - 1 freq beard (4) - 54 freq bernam (4) - 1 freq |
SoundEx code - B656 barnhourie - 1 freq byornar - 13 freq braemar - 27 freq bernard's - 2 freq burners - 7 freq burners' - 1 freq brainer - 1 freq barnardo's - 1 freq brammer - 7 freq bairn-rhyme - 2 freq burner - 3 freq brannèrt - 1 freq bernard - 5 freq bairn-reft - 1 freq bairn-rhymes - 4 freq burner-o-cuddies - 1 freq bairn-rape - 1 freq berneyardis - 1 freq bremner's - 1 freq bremner - 3 freq broony-red - 1 freq broony-reid - 1 freq brianmoore - 1 freq brooners - 1 freq braemargathering - 1 freq brianr - 3 freq bremmer - 1 freq bremners - 1 freq bairnrhymes - 10 freq bernards - 1 freq brianwr - 1 freq bernardjmolloy - 1 freq |
MetaPhone code - BRNRT brannèrt - 1 freq bernard - 5 freq broony-red - 1 freq broony-reid - 1 freq |
BERNARD |
| Time to execute Levenshtein function - 0.254335 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.421224 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.027939 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.037630 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.000835 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. |