| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| survives (0) - 9 freq survive (1) - 69 freq survived (1) - 37 freq screives (2) - 7 freq survivals (2) - 1 freq survivor (2) - 2 freq survivin (2) - 5 freq sarvices (2) - 5 freq skreives (2) - 1 freq survivan (2) - 1 freq surfies (2) - 2 freq survivors (2) - 8 freq surviv (2) - 1 freq survival (2) - 25 freq services (2) - 66 freq shaives (3) - 1 freq furiver (3) - 1 freq stovies (3) - 37 freq suive (3) - 1 freq wurries (3) - 2 freq furgiven (3) - 1 freq suffixes (3) - 2 freq scrieves (3) - 14 freq spurdies (3) - 3 freq services' (3) - 1 freq |
survives (0) - 9 freq survive (2) - 69 freq survived (2) - 37 freq survivors (3) - 8 freq survival (3) - 25 freq survivan (3) - 1 freq services (3) - 66 freq surviv (3) - 1 freq survivals (3) - 1 freq survivor (3) - 2 freq survivin (3) - 5 freq sarvices (3) - 5 freq screives (4) - 7 freq sarves (4) - 2 freq sairvices (4) - 5 freq skreives (4) - 1 freq serves (4) - 26 freq surfies (4) - 2 freq surveys (4) - 10 freq curves (5) - 10 freq servans (5) - 4 freq skreivens (5) - 2 freq sarvints (5) - 10 freq irvines (5) - 1 freq servetus (5) - 2 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 - SRFFS survives - 9 freq |
SURVIVES |
| Time to execute Levenshtein function - 0.252408 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.441100 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.031284 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.042210 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.000930 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. |