Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
year-en (0) - 1 freq yearn (2) - 1 freq learnen (2) - 1 freq near-on (2) - 2 freq hearken (2) - 28 freq yarken (2) - 2 freq rear-enn (2) - 1 freq yearnin (2) - 1 freq derken (3) - 1 freq tearie (3) - 1 freq bearer (3) - 7 freq year'd (3) - 1 freq lgarden (3) - 1 freq seamen (3) - 5 freq yeirsel (3) - 2 freq beaten (3) - 20 freq gearin (3) - 2 freq hearkent (3) - 2 freq gearie (3) - 4 freq yarked (3) - 9 freq hearer (3) - 1 freq fearie (3) - 2 freq year-lang (3) - 3 freq eaten (3) - 31 freq yarder (3) - 1 freq |
year-en (0) - 1 freq yearnin (3) - 1 freq near-on (3) - 2 freq yarken (3) - 2 freq yearn (3) - 1 freq yernan (4) - 1 freq rearan (4) - 1 freq yarnin (4) - 18 freq earnin (4) - 8 freq road-en (4) - 3 freq roaren (4) - 6 freq rearin (4) - 8 freq yet-an (4) - 2 freq earrin (4) - 1 freq aren (4) - 3 freq readeen (4) - 1 freq yarnan (4) - 3 freq yarkin (4) - 4 freq earn (4) - 41 freq yerkin (4) - 4 freq readien (4) - 1 freq bee-en (4) - 2 freq yarn (4) - 49 freq year-roon (4) - 1 freq arden (4) - 2 freq |
SoundEx code - Y650 yairn - 32 freq yarn - 49 freq yearn - 1 freq year-en - 1 freq year-roon - 1 freq yirn - 3 freq 'yairn - 1 freq |
MetaPhone code - YRN yairn - 32 freq yarn - 49 freq yearn - 1 freq year-en - 1 freq yirn - 3 freq 'yairn - 1 freq |
YEAR-EN |
Time to execute Levenshtein function - 0.215603 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.389816 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.032552 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.038326 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.000834 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. |