| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roart (0) - 74 freq soart (1) - 47 freq roars (1) - 22 freq rogart (1) - 1 freq foart (1) - 1 freq roast (1) - 38 freq roarit (1) - 6 freq aroart (1) - 1 freq roar (1) - 81 freq roar't (1) - 1 freq boakt (2) - 1 freq doar (2) - 29 freq toalt (2) - 1 freq dort (2) - 2 freq rout (2) - 2 freq cart (2) - 7 freq skart (2) - 2 freq loat (2) - 39 freq rar (2) - 1 freq doant (2) - 2 freq mart (2) - 25 freq react (2) - 17 freq soaft (2) - 2 freq porrt (2) - 1 freq mort (2) - 3 freq |
roart (0) - 74 freq aroart (1) - 1 freq roarit (1) - 6 freq roar (2) - 81 freq roar't (2) - 1 freq rairt (2) - 1 freq rearit (2) - 1 freq soart (2) - 47 freq roars (2) - 22 freq roast (2) - 38 freq rogart (2) - 1 freq foart (2) - 1 freq rant (3) - 22 freq peart (3) - 1 freq roaran (3) - 4 freq roasty (3) - 2 freq rait (3) - 3 freq foarty (3) - 1 freq broat (3) - 14 freq sort (3) - 305 freq poort (3) - 5 freq court (3) - 153 freq rapt (3) - 1 freq rost (3) - 4 freq fart (3) - 27 freq |
SoundEx code - R630 roared - 93 freq raired - 39 freq reward - 46 freq roart - 74 freq rewaird - 8 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rearit - 1 freq reread - 2 freq rared - 2 freq rewaard - 1 freq roar'd - 1 freq ruaraidh - 10 freq rairt - 1 freq rewrite - 2 freq ruaridh - 1 freq rhuaridh - 1 freq ruariaidh - 2 freq rewrote - 1 freq rarity - 2 freq |
MetaPhone code - RRT roared - 93 freq raired - 39 freq roart - 74 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rearit - 1 freq reread - 2 freq rared - 2 freq roar'd - 1 freq ruaraidh - 10 freq rairt - 1 freq rewrite - 2 freq ruaridh - 1 freq ruariaidh - 2 freq rewrote - 1 freq rarity - 2 freq |
ROART |
| Time to execute Levenshtein function - 0.308333 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.496159 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.035973 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.071527 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.000827 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. |