| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yawmerin (0) - 1 freq yammerin (1) - 7 freq dammerin (2) - 1 freq haimerin (2) - 1 freq hammerin (2) - 18 freq yatterin (2) - 4 freq yammering (2) - 1 freq yammerin' (2) - 3 freq patterin (3) - 6 freq alterin (3) - 2 freq matterin (3) - 1 freq layerin (3) - 1 freq saberin (3) - 1 freq yammert (3) - 1 freq haverin (3) - 25 freq lowderin (3) - 1 freq daunerin (3) - 30 freq staumerin (3) - 1 freq waunerin (3) - 4 freq gatherin (3) - 9 freq yawin (3) - 1 freq balmerino (3) - 1 freq timmerin (3) - 4 freq cowerin (3) - 5 freq simmerin (3) - 7 freq |
yawmerin (0) - 1 freq yammerin (2) - 7 freq haimerin (3) - 1 freq waterin (4) - 7 freq almeron (4) - 1 freq cameron (4) - 127 freq admirin (4) - 22 freq waverin (4) - 1 freq wierin (4) - 4 freq waunerin (4) - 4 freq weerin (4) - 67 freq admeirin (4) - 1 freq yammering (4) - 1 freq yammerin' (4) - 3 freq yatterin (4) - 4 freq hammerin (4) - 18 freq dammerin (4) - 1 freq lowerin (5) - 12 freq powderin (5) - 1 freq howderin (5) - 3 freq oarderin (5) - 3 freq caperin (5) - 3 freq waveran (5) - 1 freq taperin (5) - 1 freq oafferin (5) - 1 freq |
SoundEx code - Y565 yammer-weemin - 1 freq yawmerin - 1 freq yammerin - 7 freq yammerin' - 3 freq yammering - 1 freq |
MetaPhone code - YMRN yawmerin - 1 freq yammerin - 7 freq yammerin' - 3 freq |
YAWMERIN |
| Time to execute Levenshtein function - 0.590953 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 - 1.216129 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.090594 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.098274 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.001145 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. |