Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
briefly (0) - 18 freq breefly (1) - 1 freq brieflie (2) - 1 freq briefin (2) - 2 freq brief (2) - 37 freq bristly (2) - 1 freq crieffy (2) - 1 freq briskly (2) - 3 freq briefs (2) - 2 freq chiefly (2) - 5 freq frienly (2) - 5 freq briefed (2) - 2 freq bienly (2) - 7 freq drily (3) - 1 freq freely (3) - 28 freq freffly (3) - 1 freq braally (3) - 1 freq brickle (3) - 1 freq boily (3) - 1 freq birly (3) - 10 freq brally (3) - 4 freq barely (3) - 96 freq driffle (3) - 1 freq grief'll (3) - 1 freq blindly (3) - 1 freq |
briefly (0) - 18 freq breefly (1) - 1 freq brieflie (2) - 1 freq briefs (3) - 2 freq briefed (3) - 2 freq briefin (3) - 2 freq brief (3) - 37 freq firefly (4) - 1 freq braidly (4) - 8 freq brolly (4) - 15 freq braaly (4) - 42 freq bumfly (4) - 1 freq bor-fly (4) - 1 freq bref (4) - 1 freq brel (4) - 2 freq brill (4) - 12 freq rifle (4) - 24 freq trifle (4) - 12 freq bridle (4) - 12 freq bravely (4) - 8 freq buirdly (4) - 3 freq bairnly (4) - 1 freq brawly (4) - 36 freq broadly (4) - 2 freq bridal (4) - 4 freq |
SoundEx code - B614 barraful'll - 1 freq barraful - 1 freq bravely - 8 freq birblin - 1 freq birples - 1 freq briefly - 18 freq borrow-foo'll - 1 freq bravelies - 2 freq bearable - 5 freq barrowful - 2 freq überfließt - 1 freq bor-fly - 1 freq brieflie - 1 freq breefly - 1 freq |
MetaPhone code - BRFL barraful - 1 freq bravely - 8 freq briefly - 18 freq borrow-foo'll - 1 freq barrowful - 2 freq bor-fly - 1 freq brieflie - 1 freq breefly - 1 freq |
BRIEFLY |
Time to execute Levenshtein function - 0.200779 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.389013 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.027274 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.039323 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.001130 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. |