| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| february (0) - 41 freq februare (1) - 1 freq februar (1) - 29 freq feberuary (1) - 1 freq february's (2) - 1 freq februarie (2) - 2 freq estuary (3) - 3 freq feary (3) - 1 freq friary (3) - 2 freq leebrary (3) - 4 freq ruary (3) - 1 freq bruar (3) - 5 freq ferrari (3) - 3 freq leibrary (3) - 1 freq library (3) - 167 freq ferry (3) - 40 freq fullyary (4) - 1 freq brur (4) - 23 freq abruply (4) - 5 freq feathery (4) - 7 freq libary (4) - 1 freq fellay (4) - 2 freq braar (4) - 1 freq feyday (4) - 1 freq feigurs (4) - 11 freq |
february (0) - 41 freq februare (1) - 1 freq feberuary (1) - 1 freq februar (1) - 29 freq februarie (2) - 2 freq leibrary (4) - 1 freq library (4) - 167 freq ferrari (4) - 3 freq ferry (4) - 40 freq bruar (4) - 5 freq february's (4) - 1 freq leebrary (4) - 4 freq friary (4) - 2 freq furry (5) - 22 freq ferr (5) - 48 freq briar (5) - 1 freq flurry (5) - 16 freq farar (5) - 1 freq ferrer (5) - 8 freq ferrier (5) - 6 freq librar (5) - 8 freq berry (5) - 17 freq friar (5) - 1 freq brur (5) - 23 freq febreeze (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 |
FEBRUARY |
| Time to execute Levenshtein function - 0.189241 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.371869 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.029839 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.039817 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.000985 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. |