| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peetiable (0) - 2 freq paecable (3) - 1 freq paesable (3) - 1 freq peecial (3) - 1 freq peaceable (3) - 2 freq vegetable (3) - 15 freq peetie (3) - 24 freq peetiful (3) - 1 freq peeble (3) - 1 freq deeable (3) - 1 freq portable (3) - 9 freq paeceable (3) - 4 freq permeable (3) - 1 freq meesrable (3) - 2 freq reliable (3) - 5 freq veesible (3) - 4 freq prestable (3) - 2 freq seeable (3) - 1 freq enviable (3) - 1 freq sensible (4) - 34 freq feeble (4) - 10 freq peekie (4) - 1 freq weetabix (4) - 2 freq dependable (4) - 1 freq detectable (4) - 2 freq |
peetiable (0) - 2 freq portable (4) - 9 freq paeceable (4) - 4 freq peetiful (4) - 1 freq peeble (4) - 1 freq paecable (4) - 1 freq peaceable (4) - 2 freq paesable (4) - 1 freq i'table (5) - 1 freq suitable (5) - 13 freq table (5) - 686 freq peacably (5) - 1 freq peebly (5) - 2 freq reputable (5) - 3 freq playable (5) - 4 freq paeceably (5) - 2 freq notable (5) - 5 freq pebble (5) - 9 freq petal (5) - 11 freq poasible (5) - 1 freq teeble (5) - 6 freq sitable (5) - 2 freq payable (5) - 1 freq parable (5) - 54 freq equitable (5) - 1 freq |
SoundEx code - P314 paddy-field - 2 freq peetyfuul - 1 freq peat-black - 1 freq pitbull - 1 freq peetiable - 2 freq pot-bellied - 3 freq peetifully - 2 freq peetiful - 1 freq pitiful - 3 freq pitifully - 1 freq |
MetaPhone code - PXBL peetiable - 2 freq |
PEETIABLE |
| Time to execute Levenshtein function - 0.242441 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.378654 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.027213 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.039073 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.001260 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. |