| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| survived (0) - 37 freq survive (1) - 69 freq survives (1) - 9 freq survivor (2) - 2 freq surviv (2) - 1 freq survivan (2) - 1 freq screived (2) - 39 freq sereived (2) - 1 freq scrived (2) - 3 freq survival (2) - 25 freq skreived (2) - 2 freq survivin (2) - 5 freq surmised (2) - 3 freq surveyed (2) - 5 freq survivors (3) - 8 freq strive (3) - 8 freq hurried (3) - 57 freq sublimed (3) - 1 freq survivals (3) - 1 freq scurried (3) - 5 freq revived (3) - 6 freq scribed (3) - 1 freq derived (3) - 12 freq scrieved (3) - 47 freq skreives (3) - 1 freq |
survived (0) - 37 freq survives (2) - 9 freq survive (2) - 69 freq sereived (3) - 1 freq survivin (3) - 5 freq survival (3) - 25 freq survivan (3) - 1 freq survivor (3) - 2 freq surveyed (3) - 5 freq surviv (3) - 1 freq served (4) - 75 freq revived (4) - 6 freq shuvved (4) - 2 freq skreived (4) - 2 freq scrived (4) - 3 freq surmised (4) - 3 freq screived (4) - 39 freq surviving (5) - 2 freq sarvice (5) - 5 freq screeved (5) - 2 freq servand (5) - 2 freq surfaced (5) - 3 freq snuived (5) - 3 freq skived (5) - 1 freq rived (5) - 20 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 - SRFFT survived - 37 freq |
SURVIVED |
| Time to execute Levenshtein function - 0.198465 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.340814 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.027452 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.039372 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.000916 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. |