| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-livin (0) - 1 freq conceivin (3) - 3 freq unlivin (3) - 1 freq non-votin (3) - 1 freq connivin (3) - 2 freq nonin (4) - 1 freq olivia (4) - 5 freq conlin (4) - 5 freq norlin (4) - 171 freq clean-livin (4) - 2 freq oblivion (4) - 2 freq co-bidin (4) - 1 freq moralisin (4) - 1 freq confinin (4) - 1 freq non-herdin (4) - 1 freq solvin (4) - 2 freq colvin (4) - 1 freq nobilitie (4) - 1 freq concludin (4) - 3 freq conservin (4) - 1 freq alivin (4) - 1 freq obligin (4) - 6 freq relivin (4) - 1 freq noisin (4) - 2 freq outlinin (4) - 1 freq |
non-livin (0) - 1 freq unlivin (5) - 1 freq non-votin (5) - 1 freq clean-livin (6) - 2 freq non-nation (6) - 1 freq conceivin (6) - 3 freq doun-luikin (6) - 1 freq on-line (6) - 9 freq connivin (6) - 2 freq re-leevin (7) - 1 freq involvin (7) - 10 freq on-gaein (7) - 1 freq livin (7) - 336 freq iver-lovin (7) - 1 freq fine-luikin (7) - 1 freq doon-lookin (7) - 1 freq onluikin (7) - 1 freq snuivin (7) - 1 freq elivin (7) - 1 freq unnerlinin (7) - 2 freq non-fiction (7) - 4 freq unbelievin (7) - 2 freq non-paid (7) - 1 freq conservin (7) - 1 freq doon-leukin (7) - 1 freq |
SoundEx code - N541 non-livin - 1 freq |
MetaPhone code - NNLFN non-livin - 1 freq |
NON-LIVIN |
| Time to execute Levenshtein function - 0.190483 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.368884 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.030057 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.040891 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.000912 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. |