| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pitiless (0) - 1 freq peitiless (1) - 2 freq pithiness (2) - 1 freq potless (2) - 1 freq witless (2) - 6 freq peetiless (2) - 1 freq ruitless (3) - 2 freq pixies (3) - 2 freq birdless (3) - 1 freq pitied (3) - 3 freq spotless (3) - 7 freq timeless (3) - 5 freq pipies (3) - 1 freq pieties (3) - 1 freq iiiness (3) - 1 freq peerless (3) - 1 freq gisless (3) - 1 freq vittles (3) - 1 freq title's (3) - 1 freq birrless (3) - 4 freq guiless (3) - 1 freq winless (3) - 1 freq wireless (3) - 55 freq bienless (3) - 2 freq uisless (3) - 6 freq |
pitiless (0) - 1 freq peitiless (1) - 2 freq potless (2) - 1 freq peetiless (2) - 1 freq witless (3) - 6 freq pyntless (4) - 8 freq gutless (4) - 1 freq pastless (4) - 1 freq buitless (4) - 1 freq spotless (4) - 7 freq pointless (4) - 10 freq pithiness (4) - 1 freq ruitless (4) - 2 freq peerless (4) - 1 freq wutless (4) - 1 freq kinless (5) - 1 freq faithless (5) - 5 freq tireless (5) - 1 freq pistils (5) - 4 freq liltless (5) - 1 freq fitness (5) - 20 freq tuithless (5) - 2 freq penniless (5) - 1 freq daithless (5) - 2 freq limitless (5) - 1 freq |
SoundEx code - P342 petals - 22 freq padlock - 5 freq puddles - 12 freq podlie's - 1 freq padlocks - 1 freq potless - 1 freq pitlochory - 1 freq pathologically - 1 freq peitiless - 2 freq pitlochry - 7 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq pot-holes - 1 freq pathologist - 1 freq pathological - 1 freq paddles - 1 freq potlicht - 1 freq ptlz - 1 freq padlocks - 1 freq |
MetaPhone code - PTLS petals - 22 freq puddles - 12 freq podlie's - 1 freq potless - 1 freq peitiless - 2 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq paddles - 1 freq ptlz - 1 freq |
PITILESS |
| Time to execute Levenshtein function - 0.199451 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.378063 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.028193 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.038098 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.000837 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. |