| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| negotiated (0) - 2 freq negotiate (1) - 6 freq negotiates (1) - 1 freq negotiatin (2) - 2 freq negotiatit (2) - 2 freq negotiation (3) - 1 freq negated (3) - 2 freq negotiators (3) - 1 freq relocated (4) - 1 freq emaciated (4) - 2 freq estimated (4) - 1 freq negatit (4) - 1 freq mediated (4) - 2 freq notioned (4) - 1 freq penetrated (4) - 1 freq associated (4) - 10 freq besotted (4) - 3 freq negotiations (4) - 6 freq neglected (4) - 6 freq notted (4) - 1 freq hesitated (4) - 11 freq negatives (4) - 3 freq negates (4) - 1 freq negate (4) - 2 freq nepotistic (4) - 1 freq |
negotiated (0) - 2 freq negotiates (2) - 1 freq negotiate (2) - 6 freq negotiatit (3) - 2 freq negotiatin (3) - 2 freq negated (4) - 2 freq negotiation (4) - 1 freq notted (5) - 1 freq negatit (5) - 1 freq agitated (5) - 6 freq negotiators (5) - 1 freq notified (6) - 2 freq negate (6) - 2 freq negates (6) - 1 freq infatuated (6) - 1 freq ingited (6) - 1 freq negatives (6) - 3 freq nominated (6) - 2 freq noticed (6) - 227 freq negative (6) - 41 freq neglected (6) - 6 freq hesitated (6) - 11 freq besotted (6) - 3 freq notioned (6) - 1 freq gutted (6) - 32 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 - NKXTT negotiated - 2 freq negotiatit - 2 freq |
NEGOTIATED |
| Time to execute Levenshtein function - 0.178530 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.341427 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.027701 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.037154 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.000916 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. |