| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| february (0) - 42 freq feberuary (1) - 1 freq februar (1) - 29 freq februare (1) - 1 freq februarie (2) - 2 freq february's (2) - 1 freq feary (3) - 1 freq library (3) - 174 freq leibrary (3) - 1 freq bruar (3) - 5 freq ruary (3) - 1 freq ferrari (3) - 3 freq estuary (3) - 3 freq friary (3) - 2 freq leebrary (3) - 4 freq ferry (3) - 48 freq farar (4) - 1 freq ferly (4) - 20 freq frumpy (4) - 1 freq brucre (4) - 1 freq ferawa (4) - 1 freq deary (4) - 4 freq ferrier (4) - 6 freq ferrero (4) - 1 freq bestiary (4) - 1 freq |
february (0) - 42 freq februare (1) - 1 freq feberuary (1) - 1 freq februar (1) - 29 freq februarie (2) - 2 freq friary (4) - 2 freq leebrary (4) - 4 freq ferrari (4) - 3 freq ferry (4) - 48 freq bruar (4) - 5 freq february's (4) - 1 freq leibrary (4) - 1 freq library (4) - 174 freq ferr (5) - 48 freq friar (5) - 1 freq leebrar (5) - 1 freq farrar (5) - 1 freq briar (5) - 1 freq burry (5) - 1 freq berry (5) - 17 freq flirry (5) - 2 freq furry (5) - 23 freq librar (5) - 8 freq braar (5) - 1 freq ferrer (5) - 8 freq |
SoundEx code - F166 februar - 29 freq february - 42 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 - 42 freq februarie - 2 freq februare - 1 freq feberuary - 1 freq |
FEBRUARY |
| Time to execute Levenshtein function - 0.476677 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.889998 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.033007 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.088458 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.000917 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. |