| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yerlins (0) - 1 freq perlins (1) - 3 freq yearlins (1) - 1 freq yorlins (1) - 3 freq yealins (1) - 1 freq yirlins (1) - 1 freq derlins (1) - 1 freq herdins (2) - 3 freq erling (2) - 1 freq yellin (2) - 13 freq feelins (2) - 76 freq yiblins (2) - 1 freq herrins (2) - 2 freq weelins (2) - 1 freq yirdlins (2) - 1 freq darlins (2) - 4 freq merlin (2) - 6 freq yerkin (2) - 4 freq yearnins (2) - 1 freq ferlies (2) - 61 freq healins (2) - 1 freq erlines (2) - 2 freq nearlins (2) - 6 freq eerins (2) - 6 freq peelins (2) - 4 freq |
yerlins (0) - 1 freq yorlins (1) - 3 freq yirlins (1) - 1 freq yearlins (1) - 1 freq perlins (2) - 3 freq erlines (2) - 2 freq derlins (2) - 1 freq yealins (2) - 1 freq dealins (3) - 5 freq yerns (3) - 1 freq birlins (3) - 1 freq errins (3) - 1 freq peelins (3) - 4 freq ceilins (3) - 8 freq erline (3) - 1 freq yorlin's (3) - 2 freq airlines (3) - 1 freq railins (3) - 22 freq yorlin (3) - 12 freq eerins (3) - 6 freq heilins (3) - 1 freq eilins (3) - 4 freq norlins (3) - 1 freq yrlind (3) - 1 freq weelins (3) - 1 freq |
SoundEx code - Y645 year-lang - 3 freq yorlins - 3 freq yorlin - 12 freq yerlins - 1 freq yorlin's - 2 freq yearlins - 1 freq yrlind - 1 freq yirlins - 1 freq yreland - 1 freq |
MetaPhone code - YRLNS yorlins - 3 freq yerlins - 1 freq yorlin's - 2 freq yearlins - 1 freq yirlins - 1 freq |
YERLINS |
| Time to execute Levenshtein function - 0.271743 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.383863 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.027528 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.041393 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.000940 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. |