Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
burled (0) - 2 freq purled (1) - 1 freq gurled (1) - 10 freq birled (1) - 69 freq burley (1) - 1 freq curled (1) - 43 freq burgled (1) - 2 freq furled (1) - 11 freq buried (1) - 47 freq burned (1) - 31 freq hurled (1) - 20 freq murled (1) - 1 freq burped (1) - 2 freq gurred (2) - 8 freq mirled (2) - 2 freq burls (2) - 5 freq gurged (2) - 1 freq burden (2) - 24 freq burlt (2) - 1 freq wurked (2) - 6 freq burgle (2) - 1 freq pursed (2) - 6 freq cursed (2) - 43 freq birzed (2) - 5 freq whurled (2) - 1 freq |
burled (0) - 2 freq birled (1) - 69 freq buried (2) - 47 freq hurled (2) - 20 freq murled (2) - 1 freq furled (2) - 11 freq burped (2) - 2 freq burned (2) - 31 freq burgled (2) - 2 freq purled (2) - 1 freq gurled (2) - 10 freq burley (2) - 1 freq curled (2) - 43 freq tirled (3) - 6 freq dirled (3) - 10 freq birsed (3) - 5 freq baaled (3) - 17 freq burd (3) - 91 freq birned (3) - 1 freq bullied (3) - 15 freq marled (3) - 2 freq burel (3) - 1 freq birsled (3) - 3 freq wurld (3) - 55 freq billed (3) - 2 freq |
SoundEx code - B643 birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq brillident - 1 freq burled - 2 freq barrowload - 1 freq |
MetaPhone code - BRLT birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq burled - 2 freq barrowload - 1 freq |
BURLED |
Time to execute Levenshtein function - 0.233559 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.390841 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.028099 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.048165 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.000888 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. |