Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
necessity (0) - 7 freq necessitie (2) - 1 freq needcessity (2) - 10 freq decessit (2) - 1 freq necessitat (2) - 2 freq necessary (2) - 26 freq necessitate (3) - 1 freq recession (3) - 3 freq necessear (3) - 1 freq necessair (3) - 2 freq necessarily (3) - 15 freq recessive (3) - 1 freq secession (3) - 1 freq necessitats (3) - 1 freq necessar (3) - 88 freq necessities (3) - 2 freq necessarly (3) - 1 freq density (4) - 4 freq incressit (4) - 2 freq deceit (4) - 5 freq faceility (4) - 1 freq blessit (4) - 9 freq obesity (4) - 8 freq accessin (4) - 5 freq intensity (4) - 6 freq |
necessity (0) - 7 freq necessitie (2) - 1 freq necessary (3) - 26 freq necessitat (3) - 2 freq decessit (3) - 1 freq needcessity (3) - 10 freq necessities (4) - 2 freq necessair (4) - 2 freq necessar (4) - 88 freq necessear (4) - 1 freq necessitate (4) - 1 freq incressit (5) - 2 freq needcessitie (5) - 1 freq nedecessitie (5) - 1 freq focussit (5) - 1 freq nicest (5) - 6 freq necessarly (5) - 1 freq secession (5) - 1 freq necessarily (5) - 15 freq necessitats (5) - 1 freq recession (5) - 3 freq recessive (5) - 1 freq 'necessar (6) - 1 freq increasit (6) - 2 freq nicety (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 |
NECESSITY |
Time to execute Levenshtein function - 0.181652 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.372020 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.029579 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.039112 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.001109 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. |