| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| survival (0) - 25 freq survivan (1) - 1 freq survivals (1) - 1 freq survivor (2) - 2 freq surgical (2) - 5 freq survive (2) - 69 freq surviv (2) - 1 freq survived (2) - 36 freq survivin (2) - 5 freq survives (2) - 9 freq surviving (3) - 2 freq serial (3) - 3 freq burial (3) - 12 freq sullivan (3) - 3 freq suicidal (3) - 3 freq survin (3) - 1 freq urinal (3) - 6 freq skreivar (3) - 18 freq survivors (3) - 6 freq surveyar (3) - 1 freq screivar (3) - 27 freq sundial (3) - 1 freq carnival (3) - 4 freq rival (3) - 14 freq arrival (3) - 23 freq |
survival (0) - 25 freq survivan (2) - 1 freq survivals (2) - 1 freq survived (3) - 36 freq survivin (3) - 5 freq surviv (3) - 1 freq survives (3) - 9 freq survivor (3) - 2 freq survive (3) - 69 freq revival (4) - 56 freq surgical (4) - 5 freq arrival (5) - 23 freq rival (5) - 14 freq surreal (5) - 8 freq surviving (5) - 2 freq servile (5) - 1 freq surveyar (5) - 1 freq shrivel (5) - 3 freq carnival (5) - 4 freq survivors (5) - 6 freq survin (5) - 1 freq serial (5) - 3 freq services (6) - 66 freq grevvel (6) - 1 freq trivial (6) - 3 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 - SRFFL survival - 25 freq |
SURVIVAL |
| Time to execute Levenshtein function - 0.192595 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.358151 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.027483 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.036909 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.000815 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. |