| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prlhj (0) - 1 freq rlh (2) - 1 freq vrlh (2) - 1 freq orlj (2) - 1 freq php (3) - 1 freq gelh (3) - 1 freq erll (3) - 1 freq puld (3) - 6 freq prtci (3) - 1 freq pulse (3) - 23 freq prom (3) - 8 freq ersh (3) - 1 freq rlq (3) - 1 freq plea (3) - 20 freq palin (3) - 4 freq pr (3) - 21 freq prucht (3) - 1 freq prity (3) - 2 freq plet (3) - 4 freq prufe (3) - 1 freq prods (3) - 4 freq prey (3) - 27 freq pre (3) - 10 freq preed (3) - 4 freq ldj (3) - 1 freq |
prlhj (0) - 1 freq vrlh (4) - 1 freq orlj (4) - 1 freq rlh (4) - 1 freq plopj (5) - 1 freq parlez (5) - 1 freq pruch (5) - 5 freq pirls (5) - 4 freq procht (5) - 3 freq pirlin (5) - 8 freq prugh (5) - 5 freq pirlie (5) - 1 freq parly (5) - 2 freq perths (5) - 1 freq ruthj (5) - 1 freq parler (5) - 2 freq perch (5) - 13 freq proil (5) - 1 freq preel (5) - 3 freq prush (5) - 1 freq parle (5) - 1 freq pirl (5) - 7 freq purl (5) - 3 freq prile (5) - 3 freq prelim (5) - 7 freq |
SoundEx code - P642 pairls - 4 freq pirlicues - 3 freq powerless - 2 freq perilous - 1 freq pearls - 17 freq 'pearls - 1 freq paralysin'ly - 1 freq paralysis - 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 - PRLJ pierluigi - 1 freq prlhj - 1 freq |
PRLHJ |
| Time to execute Levenshtein function - 0.298378 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.413933 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.032436 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.045526 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.001209 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. |