| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| byornar (0) - 13 freq byordar (1) - 1 freq byordnar (1) - 81 freq byodnar (1) - 2 freq byordinar (2) - 79 freq ornar (2) - 4 freq byordmar (2) - 1 freq borna (2) - 1 freq byorduar (2) - 1 freq byordhar (2) - 1 freq by-ordnar (2) - 4 freq born's (3) - 1 freq borneo (3) - 3 freq boreas (3) - 2 freq borra (3) - 2 freq boran (3) - 2 freq born (3) - 324 freq briar (3) - 1 freq byordinair (3) - 1 freq broona (3) - 1 freq sonar (3) - 1 freq yonner (3) - 67 freq forfar (3) - 10 freq bruar (3) - 5 freq bernard (3) - 5 freq |
byornar (0) - 13 freq byodnar (2) - 2 freq byordnar (2) - 81 freq byordar (2) - 1 freq borna (3) - 1 freq burner (3) - 3 freq byorduar (3) - 1 freq ornar (3) - 4 freq byordinar (3) - 79 freq borrae (4) - 10 freq birnam (4) - 1 freq horner (4) - 2 freq bernam (4) - 1 freq brainer (4) - 1 freq barbar (4) - 29 freq brora (4) - 15 freq corner (4) - 317 freq sorner (4) - 3 freq byordinary (4) - 1 freq brianr (4) - 3 freq braar (4) - 1 freq braernar (4) - 1 freq burnan (4) - 7 freq borne (4) - 13 freq byrne (4) - 6 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 - BYRNR byornar - 13 freq |
BYORNAR |
| Time to execute Levenshtein function - 0.204971 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.334633 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.031380 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.050677 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.000828 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. |