Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
survivors (0) - 6 freq survivor (1) - 2 freq survivals (2) - 1 freq survives (2) - 9 freq servitors (2) - 1 freq survival (3) - 25 freq surviving (3) - 2 freq purveyors (3) - 2 freq screivers (3) - 33 freq surviv (3) - 1 freq survivan (3) - 1 freq survived (3) - 36 freq survive (3) - 69 freq skreivars (3) - 16 freq servitours (3) - 1 freq screivars (3) - 43 freq suitors (3) - 4 freq servitor (3) - 2 freq survivin (3) - 5 freq strikers (4) - 6 freq furriners (4) - 2 freq slivvers (4) - 3 freq scrivens (4) - 1 freq slivers (4) - 5 freq scurrilous (4) - 2 freq |
survivors (0) - 6 freq survivor (2) - 2 freq servitors (3) - 1 freq survives (3) - 9 freq survivals (3) - 1 freq servitours (4) - 1 freq survivin (5) - 5 freq screivars (5) - 43 freq servers (5) - 1 freq skreivars (5) - 16 freq slevvurs (5) - 1 freq slivvers (5) - 3 freq servitor (5) - 2 freq surviving (5) - 2 freq purveyors (5) - 2 freq survival (5) - 25 freq survive (5) - 69 freq surviv (5) - 1 freq screivers (5) - 33 freq survivan (5) - 1 freq survived (5) - 36 freq drivers (6) - 23 freq luvvers (6) - 1 freq surveyar (6) - 1 freq 'reivers (6) - 1 freq |
SoundEx code - S611 survive - 69 freq survived - 36 freq surviving - 2 freq survivors - 6 freq survival - 25 freq survivor - 2 freq survives - 9 freq survivin - 5 freq scrapheap - 1 freq survivan - 1 freq surviv - 1 freq survivals - 1 freq €™surviving - 1 freq skerrypiper - 1 freq scribepedersen - 1 freq |
MetaPhone code - SRFFRS survivors - 6 freq |
SURVIVORS |
Time to execute Levenshtein function - 0.206915 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.375816 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.027490 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.037193 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.000829 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. |