| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| immortal (0) - 21 freq immortals (1) - 2 freq immoral (1) - 5 freq mortal (2) - 54 freq moral (3) - 88 freq imports (3) - 2 freq immemorial (3) - 1 freq impartial (3) - 1 freq informal (3) - 18 freq timmorton (3) - 1 freq amoral (3) - 1 freq portal (3) - 3 freq jimmoray (3) - 1 freq imperial (3) - 21 freq important (3) - 374 freq mortar (3) - 9 freq gomoral (3) - 1 freq mortals (3) - 11 freq immortality (3) - 5 freq 'moral (3) - 1 freq imported (3) - 4 freq importand (3) - 1 freq import (3) - 6 freq memorial (3) - 37 freq importit (3) - 2 freq |
immortal (0) - 21 freq immoral (2) - 5 freq immortals (2) - 2 freq mortal (3) - 54 freq impartial (4) - 1 freq memorial (4) - 37 freq immortality (4) - 5 freq importit (5) - 2 freq emmerdale (5) - 3 freq 'moral (5) - 1 freq imported (5) - 4 freq merrital (5) - 1 freq martial (5) - 5 freq smirtil (5) - 1 freq immortalitie (5) - 1 freq marital (5) - 5 freq mairtial (5) - 3 freq ammirall (5) - 1 freq import (5) - 6 freq timmorton (5) - 1 freq mortals (5) - 11 freq immemorial (5) - 1 freq imports (5) - 2 freq moral (5) - 88 freq portal (5) - 3 freq |
SoundEx code - I563 innerdaeks - 1 freq innarts - 1 freq immortal - 21 freq inherited - 9 freq immortals - 2 freq inheritit - 3 freq inheritance - 11 freq inheritin - 2 freq inheritaunce - 1 freq inherit - 7 freq innards - 4 freq immortality - 5 freq inward - 7 freq inwardly - 1 freq inheritors - 1 freq inherieted - 1 freq i'north - 1 freq inheritence - 2 freq inwards - 7 freq immortalitie - 1 freq inroads - 4 freq immortalised - 1 freq inarticulate - 1 freq inwairds - 1 freq inert - 3 freq inordinate - 1 freq inwartly - 1 freq inwart - 1 freq inertia - 1 freq iainheard - 1 freq iainrwhite - 1 freq |
MetaPhone code - IMRTL immortal - 21 freq |
IMMORTAL |
| Time to execute Levenshtein function - 0.361344 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.809660 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.027659 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.082715 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.001082 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. |