| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unca (0) - 12 freq uncan (1) - 57 freq unce (1) - 7 freq unco (1) - 325 freq anaa (2) - 20 freq nsa (2) - 1 freq gca (2) - 1 freq incy (2) - 1 freq fca (2) - 1 freq sica (2) - 2 freq uea (2) - 1 freq incas (2) - 1 freq une (2) - 4 freq uffa (2) - 3 freq munna (2) - 2 freq nck (2) - 1 freq occa (2) - 1 freq luca (2) - 6 freq nva (2) - 2 freq undo (2) - 1 freq onc (2) - 1 freq unis (2) - 3 freq hnc (2) - 1 freq unrcz (2) - 1 freq gnc (2) - 1 freq |
unca (0) - 12 freq unce (1) - 7 freq unco (1) - 325 freq inco (2) - 1 freq nc (2) - 5 freq inc (2) - 4 freq ounce (2) - 4 freq onc (2) - 1 freq enc (2) - 1 freq uneco (2) - 2 freq once (2) - 123 freq oncia (2) - 1 freq incy (2) - 1 freq ance (2) - 69 freq incaa (2) - 1 freq oncy (2) - 4 freq ync (2) - 1 freq uncan (2) - 57 freq bca (3) - 1 freq unich (3) - 1 freq boca (3) - 3 freq ncs (3) - 2 freq buncy (3) - 1 freq 'ca (3) - 2 freq n'a (3) - 2 freq |
SoundEx code - U520 unco - 325 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 3 freq unease - 6 freq 'unco - 2 freq unce - 7 freq unhook - 1 freq unesco - 9 freq un's - 1 freq 'unesco - 3 freq unwise - 1 freq unk - 1 freq -ung - 1 freq uneco - 2 freq unich - 1 freq €œunco - 1 freq €™uang - 2 freq umwyys - 1 freq ung - 1 freq unsee - 1 freq |
MetaPhone code - UNK unco - 325 freq unca - 12 freq unique - 52 freq 'unco - 2 freq unk - 1 freq -ung - 1 freq uneco - 2 freq €œunco - 1 freq €™uang - 2 freq ung - 1 freq |
UNCA |
| Time to execute Levenshtein function - 0.216191 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.354333 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.030777 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.037928 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.003243 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. |