| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rawyards (0) - 1 freq rewards (2) - 6 freq tawards (2) - 7 freq awards (2) - 35 freq halyards (2) - 1 freq twaards (3) - 1 freq onwards (3) - 19 freq inwards (3) - 7 freq cowards (3) - 5 freq lanyard (3) - 1 freq ramarks (3) - 1 freq awaard (3) - 1 freq an'ards (3) - 1 freq halyard (3) - 1 freq rudyard (3) - 2 freq radars (3) - 1 freq regards (3) - 11 freq slawards (3) - 1 freq yards (3) - 24 freq wards (3) - 30 freq nayyar's (3) - 1 freq edwards (3) - 5 freq lawyer's (3) - 1 freq graveyards (3) - 3 freq racords (3) - 4 freq |
rawyards (0) - 1 freq rewards (2) - 6 freq rewairds (3) - 1 freq awards (3) - 35 freq tawards (3) - 7 freq reward (4) - 47 freq seawards (4) - 1 freq racords (4) - 4 freq edwards (4) - 5 freq awairds (4) - 3 freq recoards (4) - 1 freq upwards (4) - 12 freq rewaard (4) - 2 freq waards (4) - 1 freq towards (4) - 170 freq retards (4) - 1 freq wards (4) - 30 freq atwards (4) - 3 freq taewards (4) - 186 freq tiwards (4) - 3 freq cowards (4) - 5 freq inwards (4) - 7 freq onwards (4) - 19 freq halyards (4) - 1 freq regards (4) - 11 freq |
SoundEx code - R632 rewards - 6 freq rewairds - 1 freq rareities - 1 freq rawyards - 1 freq |
MetaPhone code - RYRTS rawyards - 1 freq |
RAWYARDS |
| Time to execute Levenshtein function - 0.244269 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.372178 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.027769 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.038933 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.000925 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. |