| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessair (0) - 2 freq necessar (1) - 89 freq necessary (2) - 26 freq 'necessar (2) - 1 freq necessear (2) - 1 freq unnecessar (3) - 5 freq neccesar (3) - 1 freq necessity (3) - 7 freq necessitie (3) - 1 freq decessit (3) - 1 freq neermair (3) - 1 freq necessarily (3) - 15 freq necessarly (3) - 1 freq necessairily (3) - 2 freq neebir (4) - 13 freq teressa (4) - 1 freq despair (4) - 58 freq cesspit (4) - 2 freq hert-sair (4) - 7 freq nessie (4) - 11 freq recess (4) - 3 freq hertsair (4) - 3 freq deckchair (4) - 2 freq nemesis (4) - 2 freq naemair (4) - 1 freq |
necessair (0) - 2 freq necessar (1) - 89 freq necessear (2) - 1 freq necessary (2) - 26 freq 'necessar (3) - 1 freq necessitie (4) - 1 freq necessarily (4) - 15 freq necessarly (4) - 1 freq neccesar (4) - 1 freq unnecessar (4) - 5 freq necessairily (4) - 2 freq necessity (4) - 7 freq necessarilie (5) - 1 freq unnecessary (5) - 1 freq decessit (5) - 1 freq enshair (6) - 1 freq recession (6) - 3 freq wannecessar (6) - 1 freq corsair (6) - 1 freq necessitat (6) - 2 freq necessities (6) - 2 freq incessant (6) - 1 freq nucear (6) - 1 freq necessitate (6) - 1 freq secession (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 |
NECESSAIR |
| Time to execute Levenshtein function - 0.207440 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.379999 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.027635 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.039364 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.000959 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. |