| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessary (0) - 26 freq necessar (1) - 89 freq necessarly (1) - 1 freq necessarily (2) - 15 freq 'necessar (2) - 1 freq unnecessary (2) - 1 freq necessear (2) - 1 freq necessity (2) - 7 freq necessair (2) - 2 freq unnecessar (3) - 5 freq emissary (3) - 2 freq accessory (3) - 2 freq necessairily (3) - 2 freq neccesar (3) - 1 freq newerday (4) - 1 freq recess (4) - 3 freq secretary (4) - 18 freq 'essay (4) - 1 freq leebrary (4) - 4 freq teressa (4) - 1 freq secintary (4) - 1 freq glossary (4) - 15 freq recesses (4) - 4 freq nectar (4) - 9 freq needcessity (4) - 10 freq |
necessary (0) - 26 freq necessar (1) - 89 freq necessair (2) - 2 freq necessarly (2) - 1 freq necessear (2) - 1 freq necessity (3) - 7 freq unnecessary (3) - 1 freq necessarily (3) - 15 freq 'necessar (3) - 1 freq neccesar (4) - 1 freq necessairily (4) - 2 freq accessory (4) - 2 freq unnecessar (4) - 5 freq ancestry (5) - 6 freq necessitie (5) - 1 freq emissary (5) - 2 freq necessarilie (5) - 1 freq wannecessar (6) - 1 freq newess (6) - 1 freq secession (6) - 1 freq recessive (6) - 1 freq necessitate (6) - 1 freq necessitat (6) - 2 freq ancestor (6) - 16 freq nasser (6) - 1 freq |
SoundEx code - N226 necessary - 26 freq necessar - 89 freq necessair - 2 freq necessarly - 1 freq necessarilie - 1 freq necessarily - 15 freq neccesar - 1 freq necessear - 1 freq necessairily - 2 freq 'necessar - 1 freq nezijuiyir - 1 freq |
MetaPhone code - NSSR necessary - 26 freq necessar - 89 freq necessair - 2 freq necessear - 1 freq 'necessar - 1 freq |
NECESSARY |
| Time to execute Levenshtein function - 0.202900 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.340837 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.027477 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.037724 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.000936 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. |