| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rewrite (0) - 2 freq rewrote (1) - 1 freq rewritten (2) - 3 freq reprise (2) - 1 freq rearit (2) - 1 freq rewire (2) - 2 freq awrite (2) - 36 freq reerie (2) - 4 freq 'awrite (2) - 5 freq recite (2) - 9 freq regrate (2) - 1 freq respite (2) - 4 freq write (2) - 403 freq reunite (2) - 1 freq fearite (2) - 1 freq 'write (2) - 1 freq weewrite (2) - 3 freq ayewrite (2) - 2 freq drearie (3) - 1 freq rowtit (3) - 3 freq reute (3) - 1 freq €œwhite (3) - 1 freq eyrie (3) - 6 freq reidie (3) - 2 freq cerise (3) - 1 freq |
rewrite (0) - 2 freq rewrote (1) - 1 freq regrate (3) - 1 freq write (3) - 403 freq ayewrite (3) - 2 freq 'awrite (3) - 5 freq weewrite (3) - 3 freq 'write (3) - 1 freq rewire (3) - 2 freq rearit (3) - 1 freq awrite (3) - 36 freq wrate (4) - 47 freq recreate (4) - 1 freq recruit (4) - 2 freq rewirk (4) - 1 freq wryte (4) - 5 freq rawit (4) - 1 freq rewynit (4) - 1 freq regrait (4) - 1 freq owrte (4) - 1 freq rewirin (4) - 1 freq writ (4) - 51 freq roarit (4) - 6 freq rewaird (4) - 8 freq regret (4) - 50 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 |
REWRITE |
| Time to execute Levenshtein function - 0.218820 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.359027 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.028938 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.038474 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.000954 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. |