| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unce (0) - 7 freq dunce (1) - 27 freq uce (1) - 1 freq ance (1) - 72 freq unca (1) - 12 freq once (1) - 129 freq ounce (1) - 5 freq uncle (1) - 275 freq une (1) - 4 freq wunce (1) - 1 freq unco (1) - 328 freq use (2) - 466 freq yncw (2) - 1 freq puce (2) - 1 freq cce (2) - 1 freq enye (2) - 1 freq runcie (2) - 1 freq stce (2) - 1 freq mune (2) - 60 freq umae (2) - 1 freq urie (2) - 1 freq bounce (2) - 23 freq ce (2) - 7 freq nice (2) - 426 freq ounces (2) - 1 freq |
unce (0) - 7 freq once (1) - 129 freq ounce (1) - 5 freq unca (1) - 12 freq unco (1) - 328 freq ance (1) - 72 freq oonce (2) - 2 freq eunice (2) - 1 freq uneco (2) - 2 freq inco (2) - 1 freq nice (2) - 426 freq eence (2) - 319 freq incy (2) - 1 freq inc (2) - 4 freq nuce (2) - 1 freq enc (2) - 1 freq eince (2) - 1 freq nece (2) - 1 freq ync (2) - 1 freq onc (2) - 1 freq yince (2) - 391 freq nc (2) - 5 freq aince (2) - 459 freq uce (2) - 1 freq uncle (2) - 275 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 - UNS uneasy - 18 freq unis - 2 freq unease - 6 freq unce - 7 freq un's - 1 freq unsee - 1 freq |
UNCE |
| Time to execute Levenshtein function - 0.223366 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.351882 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.027539 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.036757 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.000918 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. |