| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| braid-backit (0) - 1 freq blae-backit (3) - 1 freq boolie-backit (4) - 1 freq 'laid-back' (4) - 1 freq bare-nakit (5) - 2 freq braidit (5) - 3 freq braidcast (5) - 21 freq braidcastin (5) - 15 freq reid-checkit (5) - 1 freq brawbuskit (5) - 1 freq black-back (5) - 1 freq braid-oot (5) - 1 freq black-backed (5) - 1 freq humpie-backit (5) - 1 freq humfy-backit (5) - 1 freq braithtakkin (5) - 2 freq laidback (5) - 1 freq hard-neckit (5) - 1 freq braid-spreid (5) - 1 freq brain-washin (5) - 1 freq braid-claith (5) - 1 freq jail-bait (5) - 1 freq braith-takin (5) - 1 freq wrackit (6) - 2 freq crackit (6) - 23 freq |
braid-backit (0) - 1 freq blae-backit (5) - 1 freq boolie-backit (6) - 1 freq hard-neckit (7) - 1 freq 'laid-back' (7) - 1 freq brawbuskit (8) - 1 freq humfy-backit (8) - 1 freq braid-oot (8) - 1 freq braidcast (8) - 21 freq bare-nakit (8) - 2 freq braid-claith (8) - 1 freq humpie-backit (8) - 1 freq reid-checkit (8) - 1 freq rid-brick (9) - 4 freq bruckit (9) - 3 freq reid-beirdit (9) - 1 freq hard-packed (9) - 1 freq grew-back (9) - 1 freq hardback (9) - 2 freq bracket (9) - 1 freq greased-back (9) - 1 freq brockit (9) - 2 freq braid-spreid (9) - 1 freq black-back (9) - 1 freq black-backed (9) - 1 freq |
SoundEx code - B631 birthplace - 2 freq birth-pill - 1 freq 'b-beaur-tiful - 1 freq braidbrimmed - 1 freq buird-brained - 1 freq bradbury - 1 freq broadband - 4 freq birth-fire - 1 freq birth-faither - 1 freq breid-pieces - 2 freq braid-backit - 1 freq bird-feeder - 1 freq brattbakk - 2 freq broad-hipped - 1 freq brautiful - 1 freq birdfish - 1 freq bairddavey - 2 freq bridie-fed - 1 freq |
MetaPhone code - BRTBKT braid-backit - 1 freq |
BRAID-BACKIT |
| Time to execute Levenshtein function - 0.415066 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.474503 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.028690 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.037575 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.000955 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. |