| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brianmoore (0) - 1 freq cranmore (3) - 1 freq briantodd (4) - 1 freq bryanmouat (4) - 1 freq brianwr (4) - 1 freq brianr (4) - 3 freq brianma (4) - 1 freq greenhoose (5) - 24 freq belnamore (5) - 3 freq gramaire (5) - 1 freq briganer (5) - 2 freq balintore (5) - 1 freq brandie (5) - 2 freq briganers (5) - 1 freq brian's (5) - 11 freq brak-oots (5) - 1 freq draabore (5) - 1 freq brianhu (5) - 1 freq dinsmore (5) - 2 freq rosiemoore (5) - 1 freq branxholm (5) - 2 freq transform (5) - 4 freq claymore (5) - 8 freq bangor (5) - 9 freq trianglar (5) - 2 freq |
brianmoore (0) - 1 freq cranmore (4) - 1 freq brianma (5) - 1 freq brianr (5) - 3 freq brianwr (5) - 1 freq bryanmouat (5) - 1 freq brookmyre (6) - 1 freq brammer (6) - 7 freq bringer (6) - 1 freq braemar (6) - 27 freq brander (6) - 2 freq belnamore (6) - 3 freq dromore (7) - 1 freq bremmer (7) - 1 freq brandon (7) - 2 freq rancour (7) - 2 freq barnhourie (7) - 1 freq brammle (7) - 2 freq baronboar (7) - 1 freq briant (7) - 1 freq bonjoor (7) - 2 freq kenmore (7) - 1 freq marmore (7) - 2 freq binfire (7) - 1 freq breenger (7) - 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 - BRNMR brianmoore - 1 freq |
BRIANMOORE |
| Time to execute Levenshtein function - 0.215484 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.415566 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.038321 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.051559 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.000920 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. |