| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| burlt (0) - 1 freq built (1) - 123 freq burly (1) - 6 freq burnt (1) - 90 freq burl (1) - 6 freq birlt (1) - 25 freq furlt (1) - 1 freq burt (1) - 2 freq hurlt (1) - 3 freq eurlt (1) - 1 freq curlt (1) - 7 freq burst (1) - 187 freq burit (1) - 1 freq burls (1) - 5 freq burds (2) - 100 freq bucklt (2) - 2 freq burde (2) - 1 freq beurla (2) - 1 freq rult (2) - 1 freq buit (2) - 32 freq lurkt (2) - 1 freq bumt (2) - 1 freq wurst (2) - 11 freq burel (2) - 1 freq fur't (2) - 2 freq |
burlt (0) - 1 freq birlt (1) - 25 freq curlt (2) - 7 freq eurlt (2) - 1 freq burls (2) - 5 freq birlit (2) - 2 freq hurlt (2) - 3 freq burst (2) - 187 freq burit (2) - 1 freq burnt (2) - 90 freq burly (2) - 6 freq burt (2) - 2 freq built (2) - 123 freq burl (2) - 6 freq furlt (2) - 1 freq birst (3) - 5 freq birl (3) - 93 freq harlt (3) - 5 freq biylt (3) - 3 freq curlit (3) - 1 freq bullet (3) - 32 freq belt (3) - 162 freq boult (3) - 1 freq buirit (3) - 12 freq mirlt (3) - 1 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 |
BURLT |
| Time to execute Levenshtein function - 0.241112 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.374078 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.034187 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.037582 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.000860 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. |