| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| survives (0) - 9 freq survive (1) - 69 freq survived (1) - 36 freq skreives (2) - 1 freq survivor (2) - 2 freq surfies (2) - 2 freq survivals (2) - 1 freq sarvices (2) - 5 freq screives (2) - 6 freq services (2) - 66 freq survival (2) - 25 freq survivin (2) - 5 freq surviv (2) - 1 freq survivors (2) - 6 freq survivan (2) - 1 freq skreived (3) - 2 freq sunties (3) - 2 freq arrives (3) - 16 freq suites (3) - 2 freq scrived (3) - 2 freq scrivens (3) - 1 freq screiver (3) - 8 freq skrieves (3) - 3 freq wurries (3) - 2 freq furgiven (3) - 1 freq |
survives (0) - 9 freq survive (2) - 69 freq survived (2) - 36 freq survivin (3) - 5 freq survival (3) - 25 freq survivan (3) - 1 freq services (3) - 66 freq survivors (3) - 6 freq surviv (3) - 1 freq survivals (3) - 1 freq survivor (3) - 2 freq sarvices (3) - 5 freq screives (4) - 6 freq sairvices (4) - 5 freq sarves (4) - 2 freq serves (4) - 26 freq surveys (4) - 10 freq surfies (4) - 2 freq skreives (4) - 1 freq screivers (5) - 33 freq drives (5) - 27 freq services' (5) - 1 freq sevices (5) - 1 freq sereive (5) - 1 freq rivvies (5) - 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 - SRFFS survives - 9 freq |
SURVIVES |
| Time to execute Levenshtein function - 0.506628 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 - 1.200791 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.093272 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.106985 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.001149 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. |