| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bairn-reft (0) - 1 freq bairn-saft (2) - 1 freq bairn-rape (3) - 1 freq bairn-life (3) - 2 freq bairn-bed (3) - 1 freq bairn-heid (3) - 2 freq bairn-less (3) - 1 freq bairnless (4) - 3 freq bairn-born (4) - 1 freq bairnie's (4) - 8 freq bairn-th (4) - 1 freq mairret (4) - 17 freq cairret (4) - 2 freq bairnie (4) - 70 freq bairnies (4) - 46 freq blindrift (4) - 1 freq bairnlie (4) - 2 freq faur-left (4) - 1 freq cairnet (4) - 1 freq aircraft (4) - 9 freq hairt-felt (4) - 1 freq bairned (4) - 3 freq bairn-fowk (4) - 1 freq hairnet (4) - 2 freq barnet (4) - 3 freq |
bairn-reft (0) - 1 freq bairn-saft (3) - 1 freq bairn-life (5) - 2 freq bairn-rape (5) - 1 freq blin-drift (6) - 1 freq blindrift (6) - 1 freq bairn-rhyme (6) - 2 freq bairn-less (6) - 1 freq bairn-bed (6) - 1 freq bairn-heid (6) - 2 freq barnett (7) - 1 freq bairn-like (7) - 1 freq barnet (7) - 3 freq bairnt (7) - 5 freq bare-fit (7) - 5 freq bare-fuit (7) - 1 freq barrett (7) - 1 freq bairntrock (7) - 1 freq wind-reft (7) - 1 freq bairn-fowk (7) - 1 freq faur-left (7) - 1 freq bealin-daft (7) - 1 freq aircraft (7) - 9 freq bairn-born (7) - 1 freq bairn-th (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 - BRNRFT bairn-reft - 1 freq |
BAIRN-REFT |
| Time to execute Levenshtein function - 0.234658 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.506882 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.030336 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.042059 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.000879 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. |