| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pooran (0) - 1 freq sooran (1) - 1 freq pooren (1) - 2 freq poorin (1) - 45 freq poosan (1) - 1 freq booman (2) - 2 freq foran (2) - 1 freq pyran (2) - 1 freq poorin' (2) - 1 freq dooron (2) - 5 freq poorie (2) - 3 freq lookan (2) - 30 freq plooan (2) - 1 freq sookan (2) - 3 freq poorer (2) - 5 freq pookin (2) - 1 freq rootan (2) - 1 freq oora (2) - 1 freq sovran (2) - 1 freq koran (2) - 1 freq hoorin (2) - 3 freq porin (2) - 1 freq sporran (2) - 7 freq coorin (2) - 3 freq coogan (2) - 1 freq |
pooran (0) - 1 freq pooren (1) - 2 freq poorin (1) - 45 freq porin (2) - 1 freq peeran (2) - 2 freq pourin (2) - 22 freq porn (2) - 2 freq pooerin (2) - 1 freq pran (2) - 1 freq sooran (2) - 1 freq poosan (2) - 1 freq pyran (2) - 1 freq pron (3) - 1 freq louran (3) - 1 freq voorn (3) - 1 freq poonin (3) - 1 freq poors (3) - 30 freq peerin (3) - 34 freq pootin (3) - 1 freq poodin (3) - 10 freq provan (3) - 2 freq pooin (3) - 5 freq poona (3) - 1 freq prn (3) - 1 freq peeren (3) - 3 freq |
SoundEx code - P650 parin - 4 freq prim - 2 freq preen - 44 freq peeryin - 1 freq poorin - 45 freq premnay - 1 freq prima - 7 freq purrin - 20 freq peerin - 34 freq prom - 8 freq prayin - 64 freq pram - 18 freq pourin - 22 freq paranoia - 9 freq powerin - 3 freq pairin' - 1 freq preen' - 1 freq poorin' - 1 freq preyin - 3 freq prime - 36 freq perm - 3 freq pryin - 1 freq preein - 11 freq purim - 1 freq pooren - 2 freq peeren - 3 freq prone - 11 freq 'prawn - 1 freq prawn - 3 freq praan - 4 freq porno - 2 freq prune - 3 freq purn - 1 freq prn - 1 freq pierian - 1 freq prayan - 2 freq prein - 1 freq pooran - 1 freq porny - 1 freq porin - 1 freq prum - 1 freq peeran - 2 freq pirn - 8 freq pæprin - 1 freq pirm - 1 freq purran - 3 freq pran - 1 freq 'preein' - 1 freq príe-in - 1 freq 'preen - 1 freq pranny - 19 freq preen- - 1 freq pooerin - 1 freq pourin' - 1 freq prayin' - 1 freq pron - 1 freq pyran - 1 freq pernee - 1 freq porn - 2 freq promo - 2 freq perrin - 2 freq parami - 4 freq prma - 1 freq |
MetaPhone code - PRN parin - 4 freq preen - 44 freq poorin - 45 freq purrin - 20 freq peerin - 34 freq pourin - 22 freq paranoia - 9 freq pairin' - 1 freq preen' - 1 freq poorin' - 1 freq preein - 11 freq pooren - 2 freq peeren - 3 freq prone - 11 freq 'prawn - 1 freq prawn - 3 freq praan - 4 freq porno - 2 freq prune - 3 freq purn - 1 freq prn - 1 freq pierian - 1 freq prein - 1 freq pooran - 1 freq porny - 1 freq porin - 1 freq peeran - 2 freq pirn - 8 freq purran - 3 freq pran - 1 freq 'preein' - 1 freq príe-in - 1 freq hyperion - 1 freq 'preen - 1 freq pranny - 19 freq preen- - 1 freq pooerin - 1 freq pourin' - 1 freq pron - 1 freq pyran - 1 freq pernee - 1 freq porn - 2 freq perrin - 2 freq |
POORAN |
| Time to execute Levenshtein function - 0.235801 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.403562 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.027470 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.038289 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.000974 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. |