| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| survivin (0) - 5 freq surviving (1) - 2 freq survivan (1) - 1 freq surviv (2) - 1 freq survivor (2) - 2 freq survin (2) - 1 freq survives (2) - 9 freq survival (2) - 25 freq survived (2) - 37 freq survive (2) - 69 freq servicin (2) - 1 freq surveyin (2) - 5 freq skreivin (2) - 16 freq scrivin (2) - 3 freq strivin (2) - 6 freq screivin (2) - 67 freq sereivin (2) - 2 freq furnisin (3) - 1 freq pruivin (3) - 5 freq skreivins (3) - 1 freq scriven (3) - 2 freq skreivit (3) - 11 freq curvin (3) - 5 freq surlin (3) - 1 freq firgivin (3) - 1 freq |
survivin (0) - 5 freq survivan (1) - 1 freq surviving (2) - 2 freq servicin (3) - 1 freq sereivin (3) - 2 freq survived (3) - 37 freq surveyin (3) - 5 freq survive (3) - 69 freq survival (3) - 25 freq surviv (3) - 1 freq survivor (3) - 2 freq survives (3) - 9 freq survin (3) - 1 freq sarvin (4) - 22 freq skivvin (4) - 1 freq shivvin (4) - 2 freq survation (4) - 4 freq servin (4) - 36 freq sivvin (4) - 1 freq serievin (4) - 2 freq scrivin (4) - 3 freq skreivin (4) - 16 freq screivin (4) - 67 freq strivin (4) - 6 freq shriven (5) - 1 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 - SRFFN survivin - 5 freq survivan - 1 freq |
SURVIVIN |
| Time to execute Levenshtein function - 0.228050 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.385610 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.028656 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.037848 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.001046 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. |