| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beinlie (0) - 1 freq beanie (2) - 1 freq feirlie (2) - 1 freq bienlie (2) - 2 freq bindie (2) - 1 freq baillie (2) - 17 freq deilie (2) - 2 freq seilie (2) - 6 freq beinly (2) - 1 freq bailie (2) - 6 freq seiklie (2) - 1 freq beinin (2) - 1 freq belie (2) - 2 freq beirie (2) - 1 freq blindlie (2) - 1 freq bairnlie (2) - 2 freq mainlie (2) - 2 freq beiklik (2) - 1 freq deidlie (2) - 7 freq bernie (2) - 2 freq beistie (2) - 1 freq ainlie (2) - 116 freq beenie (2) - 5 freq beilin (2) - 3 freq billie (2) - 33 freq |
beinlie (0) - 1 freq beinly (2) - 1 freq bienlie (2) - 2 freq binkie (3) - 1 freq billie (3) - 33 freq mainlie (3) - 2 freq bairnlie (3) - 2 freq binlid (3) - 1 freq beenie (3) - 5 freq ainlie (3) - 116 freq bellie (3) - 6 freq bonilie (3) - 1 freq bainie (3) - 1 freq beinin (3) - 1 freq baillie (3) - 17 freq bindie (3) - 1 freq belie (3) - 2 freq bailie (3) - 6 freq bendie (3) - 2 freq beannie (3) - 26 freq beanie (3) - 1 freq bille (4) - 2 freq booncie (4) - 1 freq beinn (4) - 2 freq binkee (4) - 1 freq |
SoundEx code - B540 bienlie - 2 freq bonnily - 11 freq bunnil - 8 freq bunnle - 8 freq bienly - 7 freq bunnyel - 1 freq beinly - 1 freq bummel - 1 freq bumhole - 1 freq 'boom-ho-leh' - 1 freq bonilie - 1 freq bunnel - 1 freq bonailie - 1 freq beinlie - 1 freq bonniely - 1 freq |
MetaPhone code - BNL bienlie - 2 freq bonnily - 11 freq bunnil - 8 freq bunnle - 8 freq bienly - 7 freq beinly - 1 freq bonilie - 1 freq bunnel - 1 freq bonailie - 1 freq beinlie - 1 freq bonniely - 1 freq |
BEINLIE |
| Time to execute Levenshtein function - 0.496824 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.780905 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.030997 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.085034 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.000788 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. |