| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| byodnar (0) - 2 freq byornar (1) - 13 freq byordnar (1) - 82 freq brodgar (2) - 6 freq byorduar (2) - 1 freq byordhar (2) - 1 freq by-ordnar (2) - 4 freq byordar (2) - 1 freq byordmar (2) - 1 freq byordinar (2) - 79 freq boddam (3) - 23 freq yona (3) - 12 freq odhar (3) - 1 freq borna (3) - 1 freq broona (3) - 1 freq coodnae (3) - 52 freq sonar (3) - 1 freq soodna (3) - 7 freq by-ordinar (3) - 19 freq byordinair (3) - 2 freq byordinary (3) - 1 freq yonner (3) - 67 freq coodna (3) - 71 freq ornar (3) - 4 freq bynear (3) - 2 freq |
byodnar (0) - 2 freq byordnar (2) - 82 freq byornar (2) - 13 freq byordinar (3) - 79 freq bynear (4) - 2 freq ordnar (4) - 114 freq byordinary (4) - 1 freq byordinair (4) - 2 freq bydan (4) - 1 freq byordmar (4) - 1 freq byordhar (4) - 1 freq brodgar (4) - 6 freq by-ordnar (4) - 4 freq byordar (4) - 1 freq byorduar (4) - 1 freq badder (5) - 5 freq bonnier (5) - 24 freq brianr (5) - 3 freq dooner (5) - 2 freq donor (5) - 7 freq bydand (5) - 1 freq bodin (5) - 1 freq binary (5) - 4 freq doner (5) - 2 freq baidan (5) - 1 freq |
SoundEx code - B356 boddimer - 1 freq boddimer's - 2 freq €œbête-noir - 1 freq byodnar - 2 freq btinher - 1 freq |
MetaPhone code - BYTNR byodnar - 2 freq |
BYODNAR |
| Time to execute Levenshtein function - 0.192139 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.339435 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.027673 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.044202 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.000923 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. |