| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessitie (0) - 1 freq necessities (1) - 2 freq necessitat (2) - 2 freq needcessitie (2) - 1 freq nedecessitie (2) - 1 freq necessitate (2) - 1 freq necessity (2) - 7 freq necessarilie (3) - 1 freq necessair (3) - 2 freq neccesities (3) - 1 freq decessit (3) - 1 freq recessive (3) - 1 freq necessitats (3) - 1 freq necessear (4) - 1 freq diversitie (4) - 1 freq chestitie (4) - 1 freq densitie (4) - 1 freq necessar (4) - 89 freq nessie (4) - 11 freq needccessities (4) - 1 freq universitie (4) - 8 freq needcessity (4) - 10 freq accessible (4) - 15 freq necessary (4) - 26 freq intensitie (4) - 1 freq |
necessitie (0) - 1 freq necessities (2) - 2 freq necessity (2) - 7 freq needcessitie (3) - 1 freq necessitat (3) - 2 freq necessitate (3) - 1 freq nedecessitie (3) - 1 freq necessair (4) - 2 freq decessit (4) - 1 freq necessary (5) - 26 freq necessar (5) - 89 freq needcessity (5) - 10 freq necessear (5) - 1 freq necessitats (5) - 1 freq neccesities (5) - 1 freq recessive (5) - 1 freq necessarilie (5) - 1 freq excessive (6) - 2 freq recession (6) - 3 freq necessairily (6) - 2 freq necessarly (6) - 1 freq focussit (6) - 1 freq secession (6) - 1 freq necessarily (6) - 15 freq necktie (6) - 1 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 - NSST nicest - 6 freq necessitie - 1 freq necessity - 7 freq |
NECESSITIE |
| Time to execute Levenshtein function - 0.271187 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.458347 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.036454 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.043105 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.000926 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. |