Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
signify (0) - 5 freq dignify (1) - 2 freq signit (2) - 9 freq dignity (2) - 29 freq seegnify (2) - 1 freq signins (2) - 2 freq signing (2) - 12 freq signin (2) - 21 freq sinny (3) - 22 freq seignie (3) - 1 freq sanity (3) - 5 freq inimy (3) - 1 freq signifees (3) - 1 freq innimy (3) - 1 freq sign-aff (3) - 1 freq sicily (3) - 2 freq uglify (3) - 6 freq sinky (3) - 1 freq signet (3) - 3 freq signed (3) - 74 freq sniff (3) - 28 freq signage (3) - 28 freq sinnie (3) - 1 freq signifeed (3) - 1 freq siggies (3) - 1 freq |
signify (0) - 5 freq seegnify (2) - 1 freq dignify (2) - 2 freq signin (3) - 21 freq signit (3) - 9 freq signer (4) - 2 freq signifeed (4) - 1 freq signage (4) - 28 freq signed (4) - 74 freq sign (4) - 376 freq signal (4) - 30 freq signs (4) - 146 freq signt (4) - 7 freq signet (4) - 3 freq signifies (4) - 2 freq sinfu (4) - 3 freq signins (4) - 2 freq seignie (4) - 1 freq signifees (4) - 1 freq dignity (4) - 29 freq signing (4) - 12 freq signets (5) - 1 freq anglify (5) - 1 freq sinewy (5) - 1 freq synily (5) - 1 freq |
SoundEx code - S251 significant - 35 freq signeeficant - 2 freq signpostin - 7 freq signify - 5 freq sea-campion - 1 freq succumbed - 3 freq signboard - 3 freq signifies - 2 freq significance - 15 freq signeificance - 4 freq succumbs - 1 freq signboord - 1 freq succumb - 1 freq sacnfeeces - 1 freq signifees - 1 freq 'significant' - 1 freq signifeein - 1 freq sign-brods - 2 freq signbrods - 1 freq signpostit - 1 freq seignificant - 1 freq significatione - 1 freq signeificant - 2 freq seignifies - 1 freq sygnefyinge - 1 freq signifeed - 1 freq signeeficance - 1 freq seegnify - 1 freq sign-ups - 1 freq signifiecant - 1 freq signposts - 2 freq significantly - 7 freq sign-buirds - 1 freq sign-aff - 1 freq |
MetaPhone code - SKNF signify - 5 freq skinfae - 1 freq seegnify - 1 freq sconeof - 7 freq |
SIGNIFY |
Time to execute Levenshtein function - 0.242435 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.407624 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.028140 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.037133 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.000779 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. |