| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roorooyes (0) - 1 freq footnotes (4) - 1 freq doorweys (4) - 2 freq toolboxes (4) - 3 freq grooves (4) - 1 freq soorces (4) - 15 freq oothooses (4) - 3 freq rohres (4) - 1 freq rodrigues (4) - 1 freq rorys (4) - 1 freq poorlies (4) - 1 freq brooridges (4) - 1 freq rooftops (4) - 2 freq moorcocks (4) - 1 freq ootcomes (4) - 9 freq rooftoaps (4) - 1 freq brookes (4) - 1 freq coories (4) - 5 freq boortries (4) - 1 freq rookery's (4) - 1 freq poorboy (4) - 2 freq hormones (4) - 2 freq goodbyes (4) - 3 freq oorbye (4) - 1 freq hoo-ooer (4) - 1 freq |
roorooyes (0) - 1 freq rorys (4) - 1 freq roars (5) - 23 freq toories (5) - 3 freq coories (5) - 5 freq rohres (5) - 1 freq boories (5) - 1 freq roses (6) - 102 freq roared (6) - 93 freq rigorous (6) - 1 freq ordours (6) - 2 freq roeses (6) - 1 freq roooveeers (6) - 1 freq sorries (6) - 2 freq pores (6) - 5 freq moors (6) - 6 freq curroos (6) - 2 freq roos (6) - 2 freq eoorse (6) - 2 freq rorie (6) - 3 freq tories (6) - 117 freq roons (6) - 7 freq broose (6) - 1 freq cores (6) - 3 freq roofs (6) - 11 freq |
SoundEx code - R620 roars - 23 freq rairs - 3 freq rears - 2 freq rehearse - 4 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 - RRYS roorooyes - 1 freq |
ROOROOYES |
| Time to execute Levenshtein function - 0.226284 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.383362 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.028420 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.038599 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.000943 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. |