| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roars (0) - 22 freq soars (1) - 5 freq doars (1) - 3 freq coars (1) - 1 freq roart (1) - 74 freq oars (1) - 25 freq rears (1) - 2 freq roals (1) - 1 freq voars (1) - 3 freq roar's (1) - 19 freq roaks (1) - 8 freq boars (1) - 3 freq roads (1) - 98 freq roar (1) - 81 freq hoags (2) - 1 freq foar (2) - 1 freq friars (2) - 4 freq yours (2) - 166 freq ours (2) - 16 freq rotas (2) - 2 freq rowes (2) - 10 freq boers (2) - 1 freq wears (2) - 53 freq rogers (2) - 6 freq goads (2) - 30 freq |
roars (0) - 22 freq rears (1) - 2 freq roaks (2) - 8 freq boars (2) - 3 freq roads (2) - 98 freq rorys (2) - 1 freq roar's (2) - 19 freq rairs (2) - 3 freq roar (2) - 81 freq voars (2) - 3 freq doars (2) - 3 freq coars (2) - 1 freq soars (2) - 5 freq roart (2) - 74 freq roals (2) - 1 freq oars (2) - 25 freq roarie (3) - 2 freq sars (3) - 1 freq roogs (3) - 2 freq errs (3) - 1 freq orras (3) - 1 freq poors (3) - 30 freq hours (3) - 114 freq coarse (3) - 67 freq croas (3) - 1 freq |
SoundEx code - R620 roars - 22 freq rairs - 3 freq rears - 2 freq rehearse - 3 freq roar's - 19 freq rowers - 3 freq rerek - 1 freq rewirk - 1 freq rorys - 1 freq rohres - 1 freq rur's - 2 freq rer's - 1 freq rurick - 1 freq re-org - 1 freq roorooyes - 1 freq |
MetaPhone code - RRS roars - 22 freq rairs - 3 freq rears - 2 freq roar's - 19 freq rorys - 1 freq rohres - 1 freq rur's - 2 freq rer's - 1 freq |
ROARS |
| Time to execute Levenshtein function - 0.340195 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.674572 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.027180 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.067869 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.000823 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. |