Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
prelatioun (0) - 1 freq relatioun (1) - 3 freq predation (2) - 1 freq creatioun (2) - 1 freq relatiouns (2) - 1 freq relation (2) - 18 freq relations (3) - 14 freq elation (3) - 3 freq prelatis (3) - 1 freq redactioun (3) - 1 freq probation (3) - 2 freq reactioun (3) - 1 freq isolatioun (3) - 1 freq preisioun (3) - 1 freq adulatioun (3) - 1 freq pixelation (3) - 1 freq precarious (3) - 3 freq populatioun (3) - 1 freq precaution (3) - 3 freq creation (3) - 25 freq religioun (3) - 5 freq inflatioun (3) - 1 freq creaation (3) - 1 freq operatioun (3) - 1 freq relatin (3) - 9 freq |
prelatioun (0) - 1 freq relatioun (2) - 3 freq relation (3) - 18 freq predation (3) - 1 freq pixelation (4) - 1 freq populatioun (4) - 1 freq operatioun (4) - 1 freq relatin (4) - 9 freq precaution (4) - 3 freq probation (4) - 2 freq creatioun (4) - 1 freq relatiouns (4) - 1 freq prelatis (4) - 1 freq preston (5) - 8 freq platoon (5) - 5 freq operation (5) - 41 freq peltin (5) - 7 freq promotion (5) - 21 freq prelates (5) - 2 freq prentin (5) - 12 freq population (5) - 85 freq pollution (5) - 5 freq relaxatioun (5) - 1 freq preisioun (5) - 1 freq creaation (5) - 1 freq |
SoundEx code - P643 prelude - 3 freq pairlt - 1 freq pairlit - 1 freq parlied - 1 freq prelates - 2 freq pirlit - 1 freq proletarians - 1 freq proletarian - 1 freq pirled - 3 freq paralytic - 2 freq prelatioun - 1 freq prelatis - 1 freq €˜paralytics - 1 freq paralytics - 1 freq proletariat - 1 freq pearl-white - 1 freq paroled - 1 freq purled - 1 freq |
MetaPhone code - PRLXN prelatioun - 1 freq |
PRELATIOUN |
Time to execute Levenshtein function - 0.212561 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.406067 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.031385 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.041199 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.000938 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. |