| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| delcarin (0) - 1 freq declarin (2) - 13 freq decayin (2) - 1 freq delayin (2) - 3 freq relaxin (3) - 6 freq deecernin (3) - 1 freq declarit (3) - 3 freq decidin (3) - 17 freq belchin (3) - 2 freq welcomin (3) - 8 freq clearin (3) - 27 freq deludin (3) - 1 freq degradin (3) - 3 freq decern (3) - 2 freq demeanin (3) - 3 freq bearin (3) - 28 freq securin (3) - 1 freq delegatin (3) - 1 freq wearin (3) - 196 freq deavin (3) - 8 freq deaein (3) - 1 freq delytin (3) - 1 freq sedarin (3) - 1 freq searin (3) - 4 freq deklain (3) - 1 freq |
delcarin (0) - 1 freq deliverin (4) - 15 freq decern (4) - 2 freq delayin (4) - 3 freq declarin (4) - 13 freq decayin (4) - 1 freq flarin (5) - 3 freq dellin (5) - 5 freq uncarin (5) - 3 freq deleeverin (5) - 1 freq decin (5) - 2 freq darin (5) - 5 freq daarin (5) - 1 freq dennerin (5) - 2 freq devoorin (5) - 2 freq dealin (5) - 30 freq glarin (5) - 7 freq deliveran (5) - 2 freq kelterin (5) - 1 freq deckin (5) - 2 freq deliveren (5) - 1 freq delvin (5) - 3 freq deleiverin (5) - 1 freq discern (5) - 7 freq dilderan (5) - 1 freq |
SoundEx code - D426 delcarin - 1 freq dalserf - 1 freq |
MetaPhone code - TLKRN tallowquairn - 1 freq delcarin - 1 freq |
DELCARIN |
| Time to execute Levenshtein function - 0.201177 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.379978 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.027872 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.037178 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.000903 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. |