| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uprora (0) - 1 freq uproar (2) - 8 freq brora (2) - 15 freq rora (2) - 2 freq aurora (2) - 10 freq up-or (2) - 1 freq oora (3) - 1 freq spron (3) - 1 freq uork (3) - 1 freq upbrak (3) - 2 freq apron (3) - 24 freq sproot (3) - 11 freq uptoon (3) - 1 freq arra (3) - 32 freq paira (3) - 1 freq flora (3) - 11 freq uimor (3) - 1 freq verra (3) - 436 freq pron (3) - 1 freq cupola (3) - 1 freq spoor (3) - 2 freq grory (3) - 1 freq smora (3) - 1 freq fora (3) - 3 freq porr (3) - 1 freq |
uprora (0) - 1 freq uproar (2) - 8 freq prior (3) - 18 freq priory (3) - 3 freq porr (3) - 1 freq perra (3) - 10 freq up-or (3) - 1 freq brora (3) - 15 freq aurora (3) - 10 freq rora (3) - 2 freq promo (4) - 2 freq terra (4) - 1 freq pior (4) - 1 freq borra (4) - 2 freq nerra (4) - 33 freq error (4) - 16 freq pore (4) - 2 freq proag (4) - 1 freq prom (4) - 8 freq pro (4) - 11 freq prood (4) - 197 freq prod (4) - 3 freq varra (4) - 1 freq opera (4) - 11 freq firra (4) - 9 freq |
SoundEx code - U166 uproar - 8 freq uprora - 1 freq |
MetaPhone code - UPRR uproar - 8 freq uprora - 1 freq |
UPRORA |
| Time to execute Levenshtein function - 0.234597 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.340681 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.027097 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.037277 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.000884 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. |