| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spaeman (0) - 1 freq spaekan (1) - 32 freq spaceman (1) - 1 freq spae-man (1) - 1 freq spaemen (1) - 3 freq spaein (2) - 3 freq staemin (2) - 1 freq spaekin (2) - 114 freq pieman (2) - 4 freq seaman (2) - 4 freq staeyan (2) - 1 freq spaellan (2) - 1 freq soleman (2) - 2 freq draeman (2) - 4 freq sweeman (2) - 3 freq sae-an (2) - 1 freq faeman (2) - 1 freq swaeran (2) - 1 freq spammin (2) - 1 freq someman (2) - 1 freq saemin (2) - 1 freq spearman (2) - 1 freq spankan (2) - 1 freq snawman (2) - 10 freq scheman (2) - 1 freq |
spaeman (0) - 1 freq spaemen (1) - 3 freq spaekan (2) - 32 freq spaceman (2) - 1 freq spae-man (2) - 1 freq spammin (3) - 1 freq saemin (3) - 1 freq sweeman (3) - 3 freq spean (3) - 2 freq soleman (3) - 2 freq sieman (3) - 1 freq spearman (3) - 1 freq someman (3) - 1 freq staemin (3) - 1 freq seaman (3) - 4 freq pieman (3) - 4 freq spaein (3) - 3 freq spaekin (3) - 114 freq shipman (4) - 3 freq spearmen (4) - 2 freq seemon (4) - 17 freq spaken (4) - 4 freq steaman (4) - 2 freq spiein (4) - 1 freq poemin (4) - 1 freq |
SoundEx code - S155 spinnin - 55 freq seeven-hunner - 1 freq seeven-an-a-hauf - 1 freq spennin - 21 freq spammin - 1 freq spannin - 4 freq spennen - 1 freq shipment - 1 freq subhuman - 1 freq spaemen - 3 freq spinin' - 1 freq shipman - 3 freq spinnan - 3 freq spawnin - 1 freq sofnan - 1 freq shipmen - 1 freq spae-man - 1 freq spaeman - 1 freq spennan - 1 freq €œspawnin - 1 freq spinning - 9 freq spumantis - 1 freq speanin - 1 freq spinnin' - 2 freq |
MetaPhone code - SPMN spammin - 1 freq spaemen - 3 freq spae-man - 1 freq spaeman - 1 freq |
SPAEMAN |
| Time to execute Levenshtein function - 0.209789 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.333804 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.028976 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.037809 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.000927 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. |