Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
purl (0) - 3 freq url (1) - 1 freq curl (1) - 12 freq burl (1) - 6 freq purn (1) - 1 freq hurl (1) - 64 freq pirl (1) - 7 freq wurl (1) - 2 freq pull (1) - 145 freq purk (1) - 1 freq furl (1) - 6 freq puil (1) - 37 freq pure (1) - 676 freq pur (1) - 5 freq puhl (1) - 1 freq murl (1) - 2 freq puol (1) - 1 freq purr (1) - 3 freq pul (1) - 6 freq gurl (1) - 2 freq purim (2) - 1 freq girl (2) - 76 freq pour (2) - 30 freq yurs (2) - 2 freq null (2) - 2 freq |
purl (0) - 3 freq pirl (1) - 7 freq pul (2) - 6 freq gurl (2) - 2 freq purr (2) - 3 freq puol (2) - 1 freq murl (2) - 2 freq purely (2) - 16 freq parle (2) - 1 freq parly (2) - 2 freq puirly (2) - 3 freq pairl (2) - 3 freq puhl (2) - 1 freq peril (2) - 7 freq pearl (2) - 8 freq pur (2) - 5 freq curl (2) - 12 freq purn (2) - 1 freq hurl (2) - 64 freq wurl (2) - 2 freq pull (2) - 145 freq burl (2) - 6 freq puil (2) - 37 freq pure (2) - 676 freq url (2) - 1 freq |
SoundEx code - P640 pirlie - 1 freq pairl - 3 freq prowl - 8 freq parle - 1 freq peril - 7 freq pearly - 5 freq purl - 3 freq pirl - 7 freq peerly - 1 freq parlie - 7 freq pairlie - 1 freq purely - 16 freq poorly - 5 freq pearl - 8 freq pierowall - 1 freq pearlie - 1 freq pre-oil - 1 freq proile - 1 freq preel - 3 freq 'preel' - 2 freq prile - 3 freq proil - 1 freq purelie - 1 freq prolly - 8 freq puirly - 3 freq payroll - 2 freq €œpurely - 1 freq puerile - 1 freq parly - 2 freq |
MetaPhone code - PRL pirlie - 1 freq pairl - 3 freq prowl - 8 freq parle - 1 freq peril - 7 freq pearly - 5 freq purl - 3 freq pirl - 7 freq peerly - 1 freq parlie - 7 freq pairlie - 1 freq purely - 16 freq poorly - 5 freq pearl - 8 freq pearlie - 1 freq pre-oil - 1 freq proile - 1 freq preel - 3 freq 'preel' - 2 freq prile - 3 freq proil - 1 freq purelie - 1 freq prolly - 8 freq puirly - 3 freq payroll - 2 freq €œpurely - 1 freq puerile - 1 freq parly - 2 freq |
PURL |
Time to execute Levenshtein function - 0.206865 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.402809 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.038167 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.051719 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.001217 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. |