| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| seanymphs (0) - 1 freq sea-nymphs (1) - 1 freq nymphs (3) - 4 freq skeanachs (4) - 2 freq sumphs (4) - 8 freq seanmcm (4) - 1 freq sean's (4) - 1 freq sea-maws (4) - 4 freq nymph (4) - 2 freq seamaws (4) - 2 freq seamus (4) - 3 freq spanyie's (4) - 1 freq stamps (4) - 14 freq swamps (4) - 2 freq seams (4) - 6 freq woodnymphs (4) - 1 freq seanie (5) - 4 freq teacups (5) - 9 freq seems (5) - 533 freq team's (5) - 4 freq scandals (5) - 1 freq jamph (5) - 1 freq campos (5) - 1 freq wean''s (5) - 1 freq sanns (5) - 3 freq |
seanymphs (0) - 1 freq sea-nymphs (2) - 1 freq nymphs (4) - 4 freq sumphs (5) - 8 freq swamps (6) - 2 freq woodnymphs (6) - 1 freq nymph (6) - 2 freq stamps (6) - 14 freq sisyphus (7) - 4 freq stomps (7) - 1 freq samples (7) - 2 freq snaps (7) - 25 freq snps (7) - 2 freq srumphies (7) - 1 freq stamachs (7) - 2 freq snp's (7) - 1 freq snhs (7) - 3 freq saumples (7) - 1 freq sundup's (7) - 1 freq snips (7) - 2 freq stumps (7) - 9 freq snipes (7) - 3 freq sumph (7) - 21 freq sumps (7) - 1 freq blumphs (7) - 3 freq |
SoundEx code - S551 smimoff - 1 freq snomob - 1 freq swimmin-pool - 1 freq scaninavia - 2 freq scaninavians - 1 freq seanymphs - 1 freq sea-nymphs - 1 freq simonfromharlow - 24 freq simonblackwell - 1 freq simonhibs - 26 freq seaninhpoet - 1 freq |
MetaPhone code - SNMFS seanymphs - 1 freq sea-nymphs - 1 freq |
SEANYMPHS |
| Time to execute Levenshtein function - 0.222148 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.343721 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.027458 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.038038 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.000907 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. |