| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| parlours (0) - 1 freq parlous (1) - 1 freq parlour (1) - 17 freq 'parlour (2) - 1 freq harbours (2) - 2 freq parlor (2) - 1 freq 'armoury (3) - 1 freq valour' (3) - 1 freq callous (3) - 2 freq parton's (3) - 1 freq armous (3) - 1 freq carlos (3) - 3 freq ardour (3) - 1 freq plouks (3) - 9 freq perilous (3) - 1 freq barbour's (3) - 1 freq sailors (3) - 17 freq vapours (3) - 1 freq lours (3) - 4 freq partners (3) - 4 freq pavlov's (3) - 1 freq padlocks (3) - 1 freq jaelous (3) - 2 freq palus (3) - 1 freq purpour (3) - 1 freq |
parlours (0) - 1 freq parlous (2) - 1 freq parlour (2) - 17 freq parlor (3) - 1 freq parler (4) - 2 freq perilous (4) - 1 freq priouris (4) - 1 freq curlurs (4) - 1 freq harbours (4) - 2 freq 'parlour (4) - 1 freq taylors (5) - 1 freq pasturs (5) - 1 freq porkers (5) - 2 freq pirlicues (5) - 3 freq parauds (5) - 1 freq warriours (5) - 2 freq pliers (5) - 2 freq poplars (5) - 2 freq purrs (5) - 3 freq purlies (5) - 1 freq porters (5) - 6 freq peelers (5) - 7 freq paralysis (5) - 1 freq pedlars (5) - 1 freq pairls (5) - 4 freq |
SoundEx code - P646 parlours - 1 freq puirly-airmed - 1 freq parlour - 17 freq 'parlour - 1 freq parlor - 1 freq parler - 2 freq |
MetaPhone code - PRLRS parlours - 1 freq |
PARLOURS |
| Time to execute Levenshtein function - 0.230793 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.394776 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.028089 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.039826 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.001237 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. |