| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baptised (0) - 27 freq baptise (1) - 11 freq baptiser (1) - 18 freq baptist (2) - 11 freq baptisin (2) - 9 freq baised (2) - 3 freq bapteized (2) - 1 freq baptism (2) - 6 freq suprised (3) - 1 freq based (3) - 83 freq bawties (3) - 2 freq baited (3) - 1 freq braised (3) - 1 freq raelised (3) - 3 freq bandied (3) - 1 freq fantises (3) - 1 freq battened (3) - 2 freq abuised (3) - 1 freq yaised (3) - 238 freq latticed (3) - 1 freq maitied (3) - 1 freq apprised (3) - 1 freq battered (3) - 35 freq bappie (3) - 1 freq bruised (3) - 15 freq |
baptised (0) - 27 freq baptiser (2) - 18 freq baptise (2) - 11 freq bapteized (3) - 1 freq baptist (3) - 11 freq baptism (3) - 6 freq baptisin (3) - 9 freq baised (4) - 3 freq bemuised (5) - 1 freq taised (5) - 1 freq naptured (5) - 1 freq banties (5) - 1 freq poised (5) - 6 freq tised (5) - 1 freq lapsed (5) - 5 freq captered (5) - 1 freq baessed (5) - 5 freq prised (5) - 3 freq baptismal (5) - 1 freq bathed (5) - 13 freq temptised (5) - 1 freq emptied (5) - 20 freq ptsd (5) - 6 freq captured (5) - 29 freq batted (5) - 1 freq |
SoundEx code - B132 baptist - 11 freq baptise - 11 freq baptisin - 9 freq baptised - 27 freq bapteezit - 1 freq bobbydazzler - 6 freq baptism - 6 freq befits - 3 freq bapteesems - 1 freq baptiser - 18 freq bapteized - 1 freq baptismal - 1 freq bovets - 1 freq bobbydazzlers - 1 freq boabdisnae - 1 freq |
MetaPhone code - BPTST baptist - 11 freq baptised - 27 freq bapteezit - 1 freq bapteized - 1 freq |
BAPTISED |
| Time to execute Levenshtein function - 0.323821 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.563975 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.028269 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.076852 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.001110 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. |