| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ee-brow (0) - 2 freq ee-broo (1) - 6 freq eyebrow (2) - 1 freq eebroo (2) - 6 freq ee-broos (2) - 4 freq eyebroo (3) - 5 freq be-bop (3) - 1 freq eebrous (3) - 3 freq ee-aw (3) - 1 freq ee-ers (3) - 1 freq ee-are (3) - 2 freq epbbow (3) - 1 freq eco-trow (3) - 1 freq brow (3) - 10 freq see-trou (3) - 1 freq eenow (3) - 1 freq hebrew (3) - 19 freq eyebrows (3) - 9 freq ee-baws (3) - 1 freq eebroos (3) - 20 freq nerrow (3) - 1 freq ebro (3) - 1 freq elbow (3) - 18 freq re-bop (3) - 1 freq embro (3) - 86 freq |
ee-brow (0) - 2 freq ee-broo (2) - 6 freq ee-broos (3) - 4 freq eyebrow (3) - 1 freq hebrew (4) - 19 freq eebroo (4) - 6 freq brow (4) - 10 freq braw (5) - 1229 freq ebro (5) - 1 freq embro (5) - 86 freq elbow (5) - 18 freq i'braw (5) - 1 freq unbraw (5) - 2 freq e-braes (5) - 1 freq eebroos (5) - 20 freq brew (5) - 30 freq keybrod (5) - 1 freq see-trowe (5) - 1 freq nerrow (5) - 1 freq ee-baws (5) - 1 freq ee-are (5) - 2 freq ee-aw (5) - 1 freq eebrous (5) - 3 freq eyebroo (5) - 5 freq epbbow (5) - 1 freq |
SoundEx code - E160 ever - 879 freq every - 799 freq efer - 1 freq euphoria - 4 freq 'every - 5 freq evri - 13 freq evir - 4 freq eebroo - 6 freq eevory - 2 freq everee - 1 freq evry - 12 freq ev'ry - 6 freq ee-broo - 6 freq eber - 3 freq evvir' - 1 freq evvir - 5 freq ewvir - 1 freq eyebroo - 5 freq ee-brow - 2 freq every- - 1 freq everywye - 2 freq eviry - 1 freq everie - 4 freq effray - 1 freq effair - 1 freq ebro - 1 freq efir - 1 freq effeir - 1 freq efr - 1 freq €™ever - 1 freq efier - 1 freq ebr - 1 freq eyebrow - 1 freq eever - 2 freq evviry - 1 freq |
MetaPhone code - EBR eebroo - 6 freq ee-broo - 6 freq eber - 3 freq ee-brow - 2 freq ebro - 1 freq ebr - 1 freq |
EE-BROW |
| Time to execute Levenshtein function - 0.251148 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.364418 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.027992 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.036855 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.000844 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. |