| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baptise (0) - 11 freq baptism (1) - 6 freq baptiser (1) - 18 freq baptist (1) - 11 freq baptised (1) - 27 freq baatie (2) - 1 freq baptisin (2) - 9 freq bappie (2) - 1 freq captive (2) - 4 freq bawtie (2) - 2 freq fantise (2) - 8 freq bantie (2) - 3 freq baths (3) - 35 freq poise (3) - 3 freq baese (3) - 1 freq active (3) - 33 freq mappie (3) - 20 freq bat's (3) - 1 freq artist (3) - 27 freq reprise (3) - 1 freq sapie (3) - 1 freq pastie (3) - 1 freq baeside (3) - 1 freq taetime (3) - 2 freq wattie (3) - 24 freq |
baptise (0) - 11 freq baptised (2) - 27 freq baptist (2) - 11 freq baptiser (2) - 18 freq baptism (2) - 6 freq baptisin (3) - 9 freq banties (4) - 1 freq baets (4) - 6 freq bants (4) - 5 freq bats (4) - 34 freq bates (4) - 5 freq baps (4) - 5 freq bastes (4) - 4 freq beastis (4) - 1 freq bantie (4) - 3 freq captive (4) - 4 freq bappie (4) - 1 freq baatie (4) - 1 freq bawtie (4) - 2 freq fantise (4) - 8 freq bawties (4) - 2 freq baits (4) - 3 freq butties (5) - 1 freq becise (5) - 1 freq bites (5) - 23 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 - BPTS baptise - 11 freq |
BAPTISE |
| Time to execute Levenshtein function - 0.387733 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.464802 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.027015 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.039946 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.000943 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. |