| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| burnfit (0) - 10 freq burnit (1) - 1 freq burtit (2) - 1 freq burnie (2) - 16 freq burnet (2) - 2 freq burnett (2) - 14 freq burnt (2) - 90 freq burnist (2) - 1 freq barfit (2) - 4 freq burn't (2) - 1 freq unfit (2) - 1 freq turnit (2) - 27 freq burstit (2) - 1 freq burnin (2) - 131 freq burit (2) - 1 freq murnit (2) - 1 freq barefit (2) - 13 freq bunnit (2) - 1 freq bungin (3) - 3 freq curnie (3) - 6 freq urgit (3) - 1 freq burstin (3) - 43 freq girnit (3) - 1 freq burneen (3) - 2 freq muirfit (3) - 1 freq |
burnfit (0) - 10 freq burnit (2) - 1 freq burnist (3) - 1 freq barfit (3) - 4 freq burn't (3) - 1 freq burnt (3) - 90 freq barefit (3) - 13 freq burnett (3) - 14 freq burnet (3) - 2 freq barnet (4) - 3 freq burtit (4) - 1 freq benifit (4) - 1 freq birnt (4) - 1 freq burntoot (4) - 1 freq barefuit (4) - 10 freq brandit (4) - 5 freq bare-fit (4) - 5 freq brankit (4) - 1 freq bunnit (4) - 1 freq burstit (4) - 1 freq turnit (4) - 27 freq unfit (4) - 1 freq burnie (4) - 16 freq burnin (4) - 131 freq burit (4) - 1 freq |
SoundEx code - B651 brainwayve - 1 freq brainwaive - 3 freq brambles - 6 freq broon-padded - 1 freq brain-power - 1 freq bramble - 1 freq brainwave - 4 freq birnable - 1 freq burnieboozle - 1 freq bairn-born - 1 freq bairn-fowk - 1 freq bairn-pouer - 1 freq bairn-bed - 1 freq beeryin-place - 1 freq breem-besom - 1 freq burnhaven - 1 freq barmbrack - 1 freq 'broon-beard' - 1 freq broon-beard - 1 freq broomfield - 1 freq bairnfowk - 1 freq bairn-prince - 1 freq burnfit - 10 freq barnbrack - 2 freq brianbengal - 28 freq burnbanksy - 1 freq bryanb - 1 freq bernabeu - 1 freq bournville - 1 freq brwombat - 1 freq bernypol - 1 freq burnbraeweather - 1 freq broomfieldkeith - 1 freq baronboar - 1 freq |
MetaPhone code - BRNFT burnfit - 10 freq |
BURNFIT |
| Time to execute Levenshtein function - 0.171543 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.339505 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.027609 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.037190 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.000859 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. |