| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peterhart (0) - 1 freq peterburg (3) - 1 freq petewishart (3) - 6 freq peterheed (3) - 13 freq peterhook (3) - 1 freq jethart (3) - 6 freq peterhead (3) - 22 freq petert (3) - 1 freq peterheid (3) - 26 freq efterwart (3) - 1 freq tertar (4) - 2 freq perfait (4) - 2 freq peeriest (4) - 14 freq pate-hag (4) - 2 freq efterhint (4) - 1 freq feberuary (4) - 1 freq beermat (4) - 1 freq literary (4) - 63 freq retenar (4) - 1 freq teeshirt (4) - 2 freq seterdae (4) - 1 freq nevermar (4) - 1 freq penchant (4) - 3 freq ceterae (4) - 1 freq literar (4) - 3 freq |
peterhart (0) - 1 freq peterhead (5) - 22 freq petert (5) - 1 freq peterheid (5) - 26 freq jethart (5) - 6 freq efterwart (5) - 1 freq peterhook (5) - 1 freq petewishart (5) - 6 freq peterburg (5) - 1 freq peterheed (5) - 13 freq aifterwart (6) - 1 freq peeterheid (6) - 1 freq pouthert (6) - 1 freq tethert (6) - 3 freq stothart (6) - 1 freq fethert (6) - 1 freq efterairt (6) - 1 freq gethirt (6) - 1 freq prepart (6) - 1 freq butchart (6) - 1 freq efterhint (6) - 1 freq gethert (6) - 41 freq teeshirt (6) - 2 freq poothert (6) - 1 freq pervert (6) - 1 freq |
SoundEx code - P366 patriarchy - 5 freq patriarch - 11 freq patriarchal - 3 freq poutrie-rie - 1 freq patriarchis - 1 freq pooderhorn - 1 freq peatworrier - 18 freq peterhart - 1 freq peterweirmla - 1 freq |
MetaPhone code - PTRHRT peterhart - 1 freq |
PETERHART |
| Time to execute Levenshtein function - 0.463146 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.785657 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.029088 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.071365 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.001140 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. |