Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
survive (0) - 69 freq surviv (1) - 1 freq survived (1) - 37 freq survives (1) - 9 freq scrive (2) - 1 freq sereive (2) - 1 freq service (2) - 198 freq survivor (2) - 2 freq skreive (2) - 9 freq survival (2) - 25 freq strive (2) - 8 freq survivin (2) - 5 freq servile (2) - 1 freq sarvice (2) - 5 freq furgive (2) - 4 freq suive (2) - 1 freq furtive (2) - 2 freq screive (2) - 70 freq survin (2) - 1 freq survivan (2) - 1 freq surmise (2) - 3 freq cursive (2) - 2 freq surfies (3) - 2 freq serve (3) - 72 freq murine (3) - 1 freq |
survive (0) - 69 freq surviv (1) - 1 freq survives (2) - 9 freq survived (2) - 37 freq survivin (3) - 5 freq servile (3) - 1 freq survival (3) - 25 freq survivan (3) - 1 freq sarvice (3) - 5 freq survin (3) - 1 freq sereive (3) - 1 freq survivor (3) - 2 freq service (3) - 198 freq surveyed (4) - 5 freq sarve (4) - 10 freq sereived (4) - 1 freq scrive (4) - 1 freq sarvin (4) - 22 freq servit (4) - 8 freq surveys (4) - 10 freq servaice (4) - 1 freq survey (4) - 33 freq servin (4) - 36 freq sairvice (4) - 7 freq serve (4) - 72 freq |
SoundEx code - S611 survive - 69 freq survived - 37 freq surviving - 2 freq survivors - 8 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 - SRFF survive - 69 freq surviv - 1 freq |
SURVIVE |
Time to execute Levenshtein function - 0.212353 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.414440 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.028016 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.039860 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.000898 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. |