| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| negotiatin (0) - 2 freq negotiation (1) - 1 freq negotiatit (1) - 2 freq negotiate (2) - 6 freq negotiates (2) - 1 freq negotiations (2) - 6 freq negotiated (2) - 2 freq negatin (3) - 1 freq negotioations (3) - 1 freq negotiators (3) - 1 freq nepotistic (3) - 1 freq seetiatit (4) - 1 freq noticin (4) - 18 freq vegetation (4) - 6 freq negation (4) - 2 freq agitatin (4) - 2 freq motivatin (4) - 2 freq neglectin (4) - 2 freq associatin (4) - 1 freq resonatin (4) - 1 freq €˜negotiations (4) - 1 freq renovatin (4) - 1 freq meditatin (4) - 4 freq seetiation (4) - 8 freq eemitatin (4) - 1 freq |
negotiatin (0) - 2 freq negotiation (1) - 1 freq negotiatit (2) - 2 freq negotiated (3) - 2 freq negotiations (3) - 6 freq negotiate (3) - 6 freq negotiates (3) - 1 freq negotioations (4) - 1 freq negatin (4) - 1 freq nettin (5) - 6 freq ingratiatin (5) - 1 freq gottin (5) - 2 freq agitatin (5) - 2 freq nottin (5) - 2 freq notation (5) - 1 freq negation (5) - 2 freq vegetation (5) - 6 freq negatit (5) - 1 freq negotiators (5) - 1 freq initiation (6) - 2 freq nominatin (6) - 1 freq inebriatin (6) - 1 freq nittin (6) - 3 freq guttin (6) - 17 freq gattin (6) - 1 freq |
SoundEx code - N233 negotiates - 1 freq nceded - 1 freq nestit - 3 freq nicht-watchie - 1 freq negotiate - 6 freq negotiations - 6 freq negotiated - 2 freq nested - 1 freq nyght'at - 1 freq negated - 2 freq noosted - 1 freq nicht-at-eenie - 2 freq new-cutted - 2 freq nochtwithstaundin - 1 freq negotiatit - 2 freq negotiation - 1 freq nicht-it - 1 freq negotioations - 1 freq €˜negotiations - 1 freq negotiatin - 2 freq negatit - 1 freq newstatesman - 4 freq negotiators - 1 freq nesstotties - 1 freq |
MetaPhone code - NKXTN negotiatin - 2 freq |
NEGOTIATIN |
| Time to execute Levenshtein function - 0.273586 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.577300 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.027417 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.073681 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.000792 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. |