| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yammerin (0) - 7 freq dammerin (1) - 1 freq yammering (1) - 1 freq yammerin' (1) - 3 freq yawmerin (1) - 1 freq hammerin (1) - 18 freq nummerin (2) - 6 freq zimmerin (2) - 1 freq haimmerin (2) - 6 freq hammeran (2) - 1 freq haimerin (2) - 1 freq simmerin (2) - 7 freq yammer (2) - 5 freq vimmerin (2) - 1 freq yammers (2) - 3 freq yatterin (2) - 4 freq timmerin (2) - 4 freq yammert (2) - 1 freq yammered (2) - 8 freq hemmerin (2) - 7 freq banterin (3) - 1 freq wammlin (3) - 6 freq stammering (3) - 1 freq waterin (3) - 7 freq lumberin (3) - 1 freq |
yammerin (0) - 7 freq yawmerin (2) - 1 freq yammerin' (2) - 3 freq hammerin (2) - 18 freq yammering (2) - 1 freq dammerin (2) - 1 freq yammers (3) - 3 freq vimmerin (3) - 1 freq yammert (3) - 1 freq hemmerin (3) - 7 freq yammer (3) - 5 freq yammered (3) - 8 freq timmerin (3) - 4 freq haimmerin (3) - 6 freq zimmerin (3) - 1 freq hammeran (3) - 1 freq nummerin (3) - 6 freq haimerin (3) - 1 freq simmerin (3) - 7 freq admeirin (4) - 1 freq admirin (4) - 22 freq cameron (4) - 127 freq yatterin (4) - 4 freq immersin (4) - 1 freq almeron (4) - 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 |
YAMMERIN |
| Time to execute Levenshtein function - 0.199082 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.433065 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.027948 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.044784 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.001184 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. |