| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessar (0) - 88 freq necessary (1) - 26 freq necessair (1) - 2 freq 'necessar (1) - 1 freq necessear (1) - 1 freq neccesar (2) - 1 freq unnecessar (2) - 5 freq necessarly (2) - 1 freq teressa (3) - 1 freq necessitat (3) - 2 freq necessarily (3) - 15 freq decessit (3) - 1 freq cesar (3) - 2 freq nevermar (3) - 1 freq nectar (3) - 9 freq recess (3) - 3 freq unnecessary (3) - 1 freq nucear (3) - 1 freq newess (3) - 1 freq wannecessar (3) - 1 freq recesses (3) - 4 freq necessity (3) - 7 freq neebra (4) - 3 freq neepur (4) - 1 freq nee's (4) - 1 freq |
necessar (0) - 88 freq necessair (1) - 2 freq necessear (1) - 1 freq necessary (1) - 26 freq 'necessar (2) - 1 freq necessarly (3) - 1 freq unnecessar (3) - 5 freq neccesar (3) - 1 freq necessarily (4) - 15 freq necessity (4) - 7 freq unnecessary (4) - 1 freq decessit (5) - 1 freq necessairily (5) - 2 freq recesses (5) - 4 freq nasser (5) - 1 freq necessarilie (5) - 1 freq necessitie (5) - 1 freq accessory (5) - 2 freq naeyisser (5) - 1 freq wannecessar (5) - 1 freq nectar (5) - 9 freq ancestor (5) - 16 freq newess (5) - 1 freq recess (5) - 3 freq nucear (5) - 1 freq |
SoundEx code - N226 necessary - 26 freq necessar - 88 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 - 88 freq necessair - 2 freq necessear - 1 freq 'necessar - 1 freq |
NECESSAR |
| Time to execute Levenshtein function - 0.202903 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.391397 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.027653 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.039558 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.000834 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. |