| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| februar (0) - 29 freq februare (1) - 1 freq february (1) - 41 freq februarie (2) - 2 freq feberuary (2) - 1 freq bruar (2) - 5 freq fellar (3) - 1 freq ferdir (3) - 1 freq librar (3) - 8 freq forfar (3) - 10 freq fbrubg (3) - 1 freq leebrar (3) - 1 freq featur (3) - 5 freq feba (3) - 1 freq farrar (3) - 1 freq farar (3) - 1 freq centuar (3) - 2 freq fergal (3) - 1 freq ferman (3) - 1 freq fearfae (3) - 1 freq ferfal (3) - 8 freq brurr (3) - 1 freq ferrer (3) - 8 freq zebra (3) - 4 freq ferder (3) - 10 freq |
februar (0) - 29 freq february (1) - 41 freq februare (1) - 1 freq feberuary (2) - 1 freq februarie (2) - 2 freq bruar (3) - 5 freq farrar (4) - 1 freq brur (4) - 23 freq farar (4) - 1 freq friar (4) - 1 freq ferrer (4) - 8 freq ferrari (4) - 3 freq briar (4) - 1 freq ferr (4) - 48 freq librar (4) - 8 freq braar (4) - 1 freq leebrar (4) - 1 freq ferrier (4) - 6 freq farrer (5) - 27 freq flerr (5) - 4 freq furr (5) - 12 freq fibre (5) - 8 freq freer (5) - 2 freq fairer (5) - 12 freq burr (5) - 2 freq |
SoundEx code - F166 februar - 29 freq february - 41 freq february's - 1 freq febrooir-mirk - 1 freq februarie - 2 freq februare - 1 freq feberuary - 1 freq |
MetaPhone code - FBRR februar - 29 freq february - 41 freq februarie - 2 freq februare - 1 freq feberuary - 1 freq |
FEBRUAR |
| Time to execute Levenshtein function - 0.243472 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.437327 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.027408 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.037032 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.000826 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. |