| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yawned (0) - 15 freq awned (1) - 27 freq fawned (1) - 1 freq yawled (1) - 1 freq dawned (1) - 14 freq pawned (1) - 2 freq yarned (1) - 2 freq yaaned (1) - 4 freq yawns (2) - 1 freq gawked (2) - 6 freq warned (2) - 36 freq yaised (2) - 238 freq damned (2) - 40 freq pawnd (2) - 1 freq yanked (2) - 6 freq pawled (2) - 1 freq fanned (2) - 9 freq yawn (2) - 12 freq bawled (2) - 27 freq gained (2) - 15 freq yalled (2) - 5 freq tanned (2) - 11 freq vaned (2) - 1 freq yapped (2) - 2 freq yased (2) - 18 freq |
yawned (0) - 15 freq awned (1) - 27 freq yaaned (2) - 4 freq yarned (2) - 2 freq waned (2) - 6 freq owned (2) - 23 freq pawned (2) - 2 freq fawned (2) - 1 freq yawled (2) - 1 freq dawned (2) - 14 freq wand (3) - 14 freq maened (3) - 1 freq aaned (3) - 1 freq yowfed (3) - 1 freq hained (3) - 27 freq cowned (3) - 9 freq wawed (3) - 1 freq ained (3) - 19 freq yawnan (3) - 2 freq earned (3) - 19 freq yowled (3) - 54 freq wined (3) - 4 freq awed (3) - 3 freq downed (3) - 5 freq rained (3) - 13 freq |
SoundEx code - Y530 yawned - 15 freq yaaned - 4 freq yont - 14 freq yin-eyed - 1 freq yyned - 2 freq ymd - 2 freq yond - 1 freq yoamed - 4 freq yent - 1 freq yinday - 1 freq ymit - 1 freq |
MetaPhone code - YNT yawned - 15 freq yaaned - 4 freq yont - 14 freq yond - 1 freq yent - 1 freq yinday - 1 freq |
YAWNED |
| Time to execute Levenshtein function - 0.183710 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.351018 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.027532 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.039072 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.000899 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. |