Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
souvenirs (0) - 6 freq souvenir (1) - 5 freq souders (3) - 1 freq hovers (4) - 3 freq seeventies (4) - 8 freq softening (4) - 1 freq souchins (4) - 1 freq touers (4) - 4 freq conveyors (4) - 2 freq stunners (4) - 1 freq someen's (4) - 1 freq spheirs (4) - 1 freq guviners (4) - 1 freq soverign (4) - 1 freq surefire (4) - 1 freq speirs (4) - 68 freq heivenis (4) - 1 freq siventies (4) - 1 freq doukers (4) - 1 freq sowens (4) - 1 freq steven's (4) - 2 freq coventry (4) - 4 freq shouers (4) - 1 freq saucers (4) - 6 freq sureness (4) - 1 freq |
souvenirs (0) - 6 freq souvenir (2) - 5 freq sevens (5) - 3 freq sorners (5) - 2 freq seivens (5) - 1 freq seniors (5) - 1 freq seevens (5) - 9 freq govnors (5) - 4 freq savers (5) - 1 freq syvers (5) - 2 freq seiventies (5) - 1 freq siventies (5) - 1 freq seventies (5) - 8 freq seeventies (5) - 8 freq souders (5) - 1 freq guviners (5) - 1 freq shoulers (6) - 6 freq saulers (6) - 1 freq luvers (6) - 12 freq squeers (6) - 1 freq saunnies (6) - 3 freq sinners (6) - 8 freq veneers (6) - 1 freq slevers (6) - 2 freq seivenths (6) - 1 freq |
SoundEx code - S156 seven-year - 2 freq souvenir - 5 freq submerged - 6 freq seiven-year - 1 freq spaniards - 1 freq submarine - 5 freq submarines - 3 freq spanner - 11 freq spanners - 5 freq shopowner - 1 freq souvenirs - 6 freq spooner - 1 freq skippin-rope - 1 freq spammers - 2 freq scvunnered - 1 freq spinner - 1 freq submerge - 1 freq spinyorra - 1 freq spaniard - 1 freq sgfwmrvscs - 1 freq |
MetaPhone code - SFNRS souvenirs - 6 freq |
SOUVENIRS |
Time to execute Levenshtein function - 0.193109 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.359094 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.031859 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.036892 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.000771 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. |