| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uneco (0) - 2 freq unco (1) - 328 freq uneo (1) - 1 freq unesco (1) - 9 freq useco (1) - 1 freq sneck (2) - 42 freq nece (2) - 1 freq uncos (2) - 3 freq neo (2) - 1 freq unca (2) - 12 freq unce (2) - 7 freq nebo (2) - 1 freq deco (2) - 1 freq unecan (2) - 1 freq nec (2) - 2 freq unyo (2) - 1 freq eco (2) - 2 freq uno (2) - 1 freq necp (2) - 1 freq neck (2) - 328 freq uner (2) - 2 freq unich (2) - 1 freq nero (2) - 1 freq 'unco (2) - 2 freq inco (2) - 1 freq |
uneco (0) - 2 freq unco (1) - 328 freq unca (2) - 12 freq unce (2) - 7 freq inco (2) - 1 freq nece (2) - 1 freq nec (2) - 2 freq unesco (2) - 9 freq uneo (2) - 1 freq useco (2) - 1 freq oncy (3) - 4 freq nc (3) - 5 freq ounce (3) - 5 freq nice (3) - 426 freq incy (3) - 1 freq necd (3) - 2 freq nuce (3) - 1 freq inc (3) - 4 freq enc (3) - 1 freq eunice (3) - 1 freq ync (3) - 1 freq nyc (3) - 1 freq onc (3) - 1 freq nac (3) - 4 freq unto (3) - 8 freq |
SoundEx code - U520 unco - 328 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 2 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 - 328 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 |
UNECO |
| Time to execute Levenshtein function - 0.197002 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.358249 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.064051 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.070475 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.000969 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. |