Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
praith (0) - 1 freq paith (1) - 4 freq braith (1) - 218 freq raith (1) - 9 freq praich (1) - 10 freq wraith (1) - 17 freq graith (1) - 128 freq 'baith (2) - 4 freq praicht (2) - 5 freq braeth (2) - 26 freq frith (2) - 3 freq saith (2) - 2 freq pith (2) - 9 freq heaith (2) - 1 freq daith (2) - 294 freq anaith (2) - 7 freq raiph (2) - 25 freq wrath (2) - 19 freq braidth (2) - 11 freq 'faith (2) - 1 freq faith (2) - 162 freq rait (2) - 3 freq prity (2) - 2 freq brith (2) - 4 freq pratta (2) - 1 freq |
praith (0) - 1 freq pairth (2) - 1 freq paith (2) - 4 freq wraith (2) - 17 freq graith (2) - 128 freq praich (2) - 10 freq raith (2) - 9 freq braith (2) - 218 freq freith (3) - 2 freq pratta (3) - 1 freq prayit (3) - 1 freq brith (3) - 4 freq praech (3) - 2 freq path (3) - 178 freq trith (3) - 1 freq breith (3) - 35 freq pranitha (3) - 1 freq prity (3) - 2 freq priti (3) - 2 freq pratt (3) - 1 freq druith (3) - 1 freq truith (3) - 62 freq frith (3) - 3 freq braeth (3) - 26 freq prayt (3) - 2 freq |
SoundEx code - P630 poored - 56 freq prood - 197 freq poured - 28 freq pairt - 933 freq preed - 4 freq pride - 168 freq perth - 41 freq period - 121 freq pert - 60 freq pairty - 293 freq pourt - 2 freq parade - 15 freq part - 196 freq proud - 153 freq pree'd - 4 freq pooered - 3 freq pretty - 132 freq party - 157 freq prayed - 42 freq peered - 26 freq perty - 33 freq proddy - 2 freq prayit - 1 freq purity - 5 freq port - 70 freq prod - 3 freq prayt - 2 freq 'prod' - 1 freq pairtie - 44 freq pryde - 3 freq purrit - 1 freq proddie - 2 freq pooerd - 1 freq prettea - 1 freq preetea - 1 freq poor't - 1 freq partey - 3 freq pirate - 6 freq porto - 7 freq pairt' - 3 freq poirot - 2 freq preyed - 1 freq parrot - 21 freq pritta - 1 freq proota - 8 freq pourit - 4 freq peard - 1 freq paired - 1 freq purdie - 16 freq pratie - 1 freq pouered - 4 freq pouertae - 1 freq parody - 5 freq pour'd - 1 freq pried - 2 freq peratt - 1 freq pierheid - 1 freq pret - 1 freq preat - 1 freq purred - 8 freq pierhead - 1 freq parity - 2 freq porrt - 1 freq puirt - 2 freq prÃed - 1 freq prettie - 1 freq purrt - 1 freq pree't - 1 freq pairte - 1 freq port' - 1 freq pritty - 2 freq pertie - 6 freq €˜pride - 1 freq parawd - 1 freq pared - 2 freq portie - 3 freq pairth - 1 freq puritie - 1 freq pirt - 1 freq pourd - 1 freq portia - 2 freq pouert - 2 freq powert - 2 freq poort - 5 freq peart - 1 freq powered - 2 freq €˜pairt - 5 freq prood' - 1 freq praid - 1 freq praith - 1 freq prity - 2 freq pratta - 1 freq 'pretty - 1 freq porty - 1 freq paaarteeey - 1 freq priti - 2 freq pratt - 1 freq 'poor-oot' - 1 freq partyÂ… - 1 freq “pirate - 1 freq |
MetaPhone code - PR0 perth - 41 freq pairth - 1 freq praith - 1 freq |
PRAITH |
Time to execute Levenshtein function - 0.197837 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.340844 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.028226 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.037774 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.000958 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. |