| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opera (0) - 11 freq ppera (1) - 24 freq operae (1) - 1 freq operas (1) - 3 freq opera' (1) - 1 freq perm (2) - 3 freq pert (2) - 60 freq ower- (2) - 1 freq pero (2) - 1 freq sperk (2) - 3 freq open- (2) - 1 freq sperm (2) - 5 freq openta (2) - 1 freq vera (2) - 29 freq perv (2) - 3 freq ooers (2) - 11 freq oweraa (2) - 5 freq overs (2) - 2 freq opef (2) - 1 freq era (2) - 30 freq faera (2) - 3 freq orra (2) - 172 freq oyer (2) - 2 freq iper (2) - 7 freq pea (2) - 25 freq |
opera (0) - 11 freq operae (1) - 1 freq pere (2) - 1 freq peri (2) - 2 freq peru (2) - 2 freq pero (2) - 1 freq iper (2) - 7 freq ppera (2) - 24 freq operas (2) - 3 freq opera' (2) - 1 freq per (2) - 63 freq para (2) - 13 freq pouer (3) - 149 freq apert (3) - 12 freq oora (3) - 1 freq oped (3) - 1 freq ope (3) - 3 freq pire (3) - 1 freq operate (3) - 12 freq pr (3) - 21 freq perk (3) - 28 freq popery (3) - 2 freq oer (3) - 238 freq mera (3) - 2 freq ora (3) - 1 freq |
SoundEx code - O160 over - 335 freq offer - 169 freq oaffer - 1 freq o'fare - 1 freq opera - 11 freq oaffir - 5 freq opera' - 1 freq oppor - 1 freq offair - 11 freq oeuvre - 1 freq overaw - 3 freq operae - 1 freq owver - 1 freq oafur - 1 freq oaffur - 1 freq ovr - 1 freq oooveer - 1 freq oboarw - 1 freq |
MetaPhone code - OPR opera - 11 freq opera' - 1 freq oppor - 1 freq operae - 1 freq |
OPERA |
| Time to execute Levenshtein function - 0.187257 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.354557 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.029905 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.036746 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.000768 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. |