| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noosted (0) - 1 freq boosted (1) - 1 freq roosted (1) - 2 freq notted (2) - 1 freq pooster (2) - 5 freq yoosed (2) - 1 freq rowsted (2) - 6 freq toosied (2) - 1 freq oosed (2) - 1 freq noted (2) - 23 freq roasted (2) - 5 freq coasted (2) - 1 freq hoosed (2) - 6 freq wooster (2) - 1 freq roosed (2) - 6 freq rousted (2) - 2 freq foisted (2) - 1 freq doobted (2) - 1 freq noosts (2) - 2 freq rooted (2) - 12 freq dooted (2) - 4 freq hoasted (2) - 7 freq hosted (2) - 3 freq frosted (2) - 9 freq hooshed (2) - 1 freq |
noosted (0) - 1 freq nested (2) - 1 freq roosted (2) - 2 freq boosted (2) - 1 freq foisted (3) - 1 freq nosed (3) - 6 freq rousted (3) - 2 freq noost (3) - 4 freq hosted (3) - 3 freq hoisted (3) - 3 freq noosts (3) - 2 freq onsteid (3) - 11 freq roasted (3) - 5 freq toasted (3) - 3 freq boasted (3) - 1 freq notted (3) - 1 freq posted (3) - 21 freq noted (3) - 23 freq coasted (3) - 1 freq hoasted (3) - 7 freq insted (3) - 5 freq lested (4) - 4 freq laisted (4) - 3 freq rusted (4) - 5 freq hasted (4) - 2 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 - NSTT nceded - 1 freq nestit - 3 freq nested - 1 freq noosted - 1 freq |
NOOSTED |
| Time to execute Levenshtein function - 0.203756 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.380882 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.029592 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.046092 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.001076 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. |