| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| postal (0) - 3 freq posstal (1) - 1 freq portal (1) - 3 freq poal (2) - 1 freq pistol (2) - 28 freq post' (2) - 3 freq mortal (2) - 54 freq posted (2) - 21 freq poster (2) - 24 freq pastas (2) - 1 freq foetal (2) - 3 freq distal (2) - 2 freq phoetal (2) - 1 freq post- (2) - 3 freq pistil (2) - 3 freq postin (2) - 21 freq postie (2) - 24 freq pasta (2) - 14 freq hostel (2) - 14 freq postage (2) - 5 freq soctal (2) - 1 freq costan (2) - 1 freq postit (2) - 13 freq rosal (2) - 1 freq pascal (2) - 1 freq |
postal (0) - 3 freq pastel (2) - 2 freq posstal (2) - 1 freq pistol (2) - 28 freq portal (2) - 3 freq pistil (2) - 3 freq postit (3) - 13 freq pascal (3) - 1 freq hostel (3) - 14 freq stal (3) - 4 freq postage (3) - 5 freq posts (3) - 45 freq coastal (3) - 11 freq pystle (3) - 2 freq pasta (3) - 14 freq post (3) - 228 freq posty (3) - 1 freq petal (3) - 11 freq postie (3) - 24 freq distal (3) - 2 freq poster (3) - 24 freq posted (3) - 21 freq post' (3) - 3 freq phoetal (3) - 1 freq pastas (3) - 1 freq |
SoundEx code - P234 pystle - 2 freq post-lockdoon - 1 freq pistols - 18 freq pistol - 28 freq pestilence - 6 freq pastel-coloured - 1 freq picket-lines - 1 freq pauchtily - 1 freq pigtails - 13 freq pigtail - 3 freq pistoll-shot - 1 freq pickit-lookin - 1 freq piccadilly - 2 freq pecadillos - 1 freq pastel - 2 freq pistil - 3 freq pecht-lik - 1 freq pistils - 4 freq posstal - 1 freq postalveolar - 3 freq postaladdress - 10 freq postal - 3 freq pistoll - 1 freq pechtland - 2 freq pastless - 1 freq pastilles - 1 freq pkdhl - 1 freq postalworkersday - 1 freq |
MetaPhone code - PSTL pystle - 2 freq pistol - 28 freq pastel - 2 freq pistil - 3 freq posstal - 1 freq postal - 3 freq pistoll - 1 freq |
POSTAL |
| Time to execute Levenshtein function - 0.251992 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.384180 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.033809 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.043515 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.001069 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. |