| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessitat (0) - 2 freq necessitate (1) - 1 freq necessitats (1) - 1 freq necessity (2) - 7 freq necessitie (2) - 1 freq necessities (3) - 2 freq needcessitate (3) - 1 freq necessear (3) - 1 freq decessit (3) - 1 freq necessar (3) - 89 freq veesitit (4) - 8 freq nedecessitie (4) - 1 freq 'necessar (4) - 1 freq necessair (4) - 2 freq recessive (4) - 1 freq reveisitit (4) - 1 freq secession (4) - 1 freq needcessity (4) - 10 freq necessarly (4) - 1 freq recession (4) - 3 freq necessary (4) - 26 freq needcessitates (4) - 1 freq needcessitie (4) - 1 freq nesbitt (4) - 5 freq reestit (5) - 11 freq |
necessitat (0) - 2 freq necessitate (1) - 1 freq necessitats (2) - 1 freq necessitie (3) - 1 freq necessity (3) - 7 freq necessities (4) - 2 freq needcessitate (4) - 1 freq necessar (5) - 89 freq necessear (5) - 1 freq decessit (5) - 1 freq needcessity (6) - 10 freq necessarly (6) - 1 freq necessary (6) - 26 freq needcessitates (6) - 1 freq nesbitt (6) - 5 freq needcessitie (6) - 1 freq nedecessitie (6) - 1 freq incessant (6) - 1 freq necessair (6) - 2 freq necessarilie (7) - 1 freq intresstit (7) - 1 freq cesspit (7) - 2 freq cassat (7) - 1 freq focussit (7) - 1 freq necessairily (7) - 2 freq |
SoundEx code - N223 newcastle - 24 freq nicest - 6 freq necessitie - 1 freq necessity - 7 freq necessities - 2 freq no-questions - 2 freq newscaster - 1 freq no-sae-kittle - 1 freq necessitats - 1 freq necessitate - 1 freq necessitat - 2 freq newcastle-upo-tyne - 1 freq newcastle-upon-tynne - 1 freq newskesters - 1 freq nguistics - 1 freq neccesities - 1 freq niexecutive - 1 freq nosuchthingasgermsinthe - 1 freq nicestafftho - 1 freq ngist - 2 freq nikkigate - 1 freq newcastle-upon-tyne - 1 freq |
MetaPhone code - NSSTT necessitate - 1 freq necessitat - 2 freq |
NECESSITAT |
| Time to execute Levenshtein function - 0.194427 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.366438 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.028866 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.040302 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.000942 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. |