| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| secrests (0) - 1 freq secrets (1) - 39 freq secret (2) - 196 freq sacrets (2) - 1 freq secret's (2) - 1 freq crests (2) - 2 freq decreets (2) - 2 freq sweirest (3) - 2 freq secreted (3) - 1 freq sects (3) - 2 freq secent's (3) - 1 freq seckless (3) - 1 freq success (3) - 96 freq dearest (3) - 19 freq regress (3) - 1 freq recreate (3) - 1 freq secrecy (3) - 4 freq screws (3) - 22 freq recruits (3) - 6 freq saecret (3) - 1 freq crusts (3) - 12 freq secretar (3) - 29 freq scripts (3) - 3 freq sturest (3) - 1 freq streets (3) - 173 freq |
secrests (0) - 1 freq secrets (2) - 39 freq crests (3) - 2 freq sacrets (3) - 1 freq saicrets (4) - 9 freq sacrist (4) - 1 freq scripts (4) - 3 freq crusts (4) - 12 freq decreets (4) - 2 freq secret's (4) - 1 freq secret (4) - 196 freq sucess (5) - 1 freq secretars (5) - 1 freq increst (5) - 1 freq screeds (5) - 13 freq scents (5) - 4 freq spreits (5) - 2 freq chests (5) - 7 freq screams (5) - 32 freq spreets (5) - 6 freq sprets (5) - 2 freq scairts (5) - 1 freq secunts (5) - 1 freq forrests (5) - 1 freq screids (5) - 5 freq |
SoundEx code - S262 saucers - 6 freq sassers - 6 freq swaggers - 4 freq seeker's - 2 freq sacrist - 1 freq shakers - 2 freq seekers - 9 freq secrecy - 4 freq scissors - 6 freq sugars - 2 freq sojers - 54 freq seizures - 1 freq sugar-coatit - 1 freq sex-crazed - 1 freq skooshers - 1 freq secures - 1 freq skagerrak's - 1 freq segregatit - 3 freq saasers - 1 freq soger's - 1 freq shoogie-horse-flee - 2 freq shoogie-horse-stang-na - 1 freq swackeries - 1 freq saicrecy - 1 freq sikorsky - 2 freq sikkars - 1 freq segregate - 1 freq segregation - 4 freq sacrosanct - 1 freq sugarcandy - 3 freq soajers - 1 freq sookers - 2 freq secrests - 1 freq sojours - 1 freq sograsutherland - 1 freq segregation - 1 freq sugaracre - 1 freq shugriggie - 1 freq shaggers - 2 freq |
MetaPhone code - SKRSTS secrests - 1 freq |
SECRESTS |
| Time to execute Levenshtein function - 0.498631 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.881074 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.075585 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.044379 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.000807 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. |