| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rairt (0) - 1 freq raist (1) - 7 freq raird (1) - 1 freq dairt (1) - 6 freq tairt (1) - 3 freq sairt (1) - 2 freq railt (1) - 1 freq lairt (1) - 5 freq airt (1) - 297 freq rair (1) - 30 freq cairt (1) - 92 freq grairt (1) - 2 freq rairs (1) - 3 freq rait (1) - 3 freq hairt (1) - 341 freq pairt (1) - 933 freq fairt (1) - 26 freq mairt (1) - 5 freq raid (2) - 25 freq rains (2) - 27 freq haist (2) - 5 freq airth (2) - 11 freq bait (2) - 32 freq taint (2) - 2 freq paint (2) - 62 freq |
rairt (0) - 1 freq rait (2) - 3 freq rairs (2) - 3 freq grairt (2) - 2 freq hairt (2) - 341 freq pairt (2) - 933 freq mairt (2) - 5 freq fairt (2) - 26 freq cairt (2) - 92 freq roart (2) - 74 freq dairt (2) - 6 freq raist (2) - 7 freq rair (2) - 30 freq tairt (2) - 3 freq raird (2) - 1 freq airt (2) - 297 freq sairt (2) - 2 freq lairt (2) - 5 freq railt (2) - 1 freq rict (3) - 1 freq gaart (3) - 3 freq heairt (3) - 1 freq reist (3) - 8 freq faert (3) - 4 freq urafirt (3) - 1 freq |
SoundEx code - R630 roared - 93 freq raired - 39 freq reward - 47 freq roart - 74 freq rewaird - 8 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rewaard - 2 freq rarity - 3 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 rhuaridh - 1 freq ruariaidh - 2 freq rewrote - 1 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 rarity - 3 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 |
RAIRT |
| Time to execute Levenshtein function - 0.180473 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.337183 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.034225 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.037083 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.000926 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. |