| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nuanced (0) - 2 freq nuances (1) - 3 freq nuance (1) - 3 freq dunced (2) - 10 freq ranced (2) - 1 freq anced (2) - 1 freq chanced (2) - 6 freq scanced (2) - 10 freq nance (2) - 7 freq enhanced (2) - 2 freq lanced (2) - 3 freq glanced (2) - 27 freq danced (2) - 57 freq wanced (2) - 3 freq pranced (2) - 5 freq stanced (2) - 2 freq duncer (3) - 6 freq quanter (3) - 4 freq braced (3) - 1 freq stances (3) - 4 freq funned (3) - 2 freq chance (3) - 548 freq stance (3) - 28 freq planted (3) - 31 freq wance (3) - 328 freq |
nuanced (0) - 2 freq nuances (2) - 3 freq nuance (2) - 3 freq lanced (3) - 3 freq enhanced (3) - 2 freq anoonced (3) - 2 freq nance (3) - 7 freq wanced (3) - 3 freq danced (3) - 57 freq dunced (3) - 10 freq ranced (3) - 1 freq anced (3) - 1 freq minced (4) - 2 freq fancied (4) - 31 freq annunced (4) - 2 freq nonces (4) - 2 freq boonced (4) - 20 freq fenced (4) - 7 freq pounced (4) - 1 freq noticed (4) - 227 freq bounced (4) - 12 freq funcied (4) - 7 freq nouriced (4) - 1 freq noncey (4) - 1 freq nuncy (4) - 1 freq |
SoundEx code - N523 non-stop - 5 freq newington - 3 freq non-starter - 1 freq non-shaetlan - 1 freq non-gà idhealtachd - 1 freq nimsht - 1 freq nonstop - 1 freq non-scots-speakers - 1 freq namaste - 2 freq €˜namaste - 1 freq non-standard - 2 freq non-standardness - 1 freq €œnamaste - 1 freq non-scots - 3 freq nine-stanza - 1 freq nuanced - 2 freq nanicht - 1 freq nonstandard - 1 freq |
MetaPhone code - NNST nuanced - 2 freq |
NUANCED |
| Time to execute Levenshtein function - 0.345930 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.590025 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.028089 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.069841 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.000903 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. |