| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paralysed (0) - 13 freq paraleesed (2) - 4 freq paralysin (2) - 2 freq analysed (2) - 8 freq prayed (3) - 42 freq paradise' (3) - 1 freq paalled (3) - 1 freq playsed (3) - 1 freq parallel (3) - 20 freq phrased (3) - 1 freq paradise (3) - 44 freq paralytic (3) - 2 freq paraded (3) - 3 freq harassed (3) - 1 freq parlied (3) - 1 freq penalised (3) - 3 freq paroled (3) - 1 freq analyse (3) - 5 freq reanalysed (3) - 1 freq parauded (3) - 1 freq praised (3) - 23 freq aroused (4) - 1 freq garbled (4) - 2 freq panalbase- (4) - 1 freq advysed (4) - 1 freq |
paralysed (0) - 13 freq paraleesed (2) - 4 freq paralysin (3) - 2 freq playsed (4) - 1 freq paroled (4) - 1 freq penalised (4) - 3 freq praised (4) - 23 freq parlied (4) - 1 freq analysed (4) - 8 freq prised (5) - 3 freq pursed (5) - 6 freq pleased (5) - 206 freq promised (5) - 76 freq pirled (5) - 3 freq plaesed (5) - 26 freq pressed (5) - 74 freq proposed (5) - 8 freq plaised (5) - 37 freq plased (5) - 1 freq raelised (5) - 3 freq purled (5) - 1 freq preesed (5) - 1 freq upraised (5) - 2 freq realised (5) - 165 freq paradise (5) - 44 freq |
SoundEx code - P642 pairls - 4 freq pirlicues - 3 freq powerless - 2 freq perilous - 1 freq pearls - 17 freq 'pearls - 1 freq père-lachaise - 1 freq paralysin - 2 freq paralysed - 13 freq paraleesed - 4 freq pirlicue - 6 freq pirliecules - 1 freq parlous - 1 freq poorlies - 1 freq perils - 2 freq pirls - 4 freq prologue - 4 freq parlez-vous - 1 freq pirliecue - 1 freq pouerless - 2 freq pouerlessness - 1 freq pierluigi - 1 freq purlies - 1 freq pooerless - 2 freq paerls - 1 freq perilously - 1 freq parlez - 1 freq €˜perles - 1 freq peerless - 1 freq pearlspetcare - 1 freq pearljam - 3 freq pooralexa - 1 freq prillisk's - 1 freq prlhj - 1 freq |
MetaPhone code - PRLST paralysed - 13 freq paraleesed - 4 freq |
PARALYSED |
| Time to execute Levenshtein function - 0.274899 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.458215 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.029514 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.042724 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.000927 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. |