| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boatyaird (0) - 1 freq bodygaird (3) - 1 freq postcaird (3) - 7 freq courtyaird (3) - 4 freq coortyaird (3) - 12 freq dockyaird (3) - 1 freq costgaird (3) - 1 freq coastgaird (3) - 1 freq boathir (3) - 3 freq twa-yaird (3) - 1 freq lanyard (4) - 1 freq lanlaird (4) - 1 freq boayish (4) - 1 freq oanward (4) - 1 freq fermyaird (4) - 5 freq vinyaird (4) - 3 freq boardir (4) - 1 freq court-yaird (4) - 1 freq ootward (4) - 6 freq bakward (4) - 2 freq blaggard (4) - 3 freq atward (4) - 1 freq farmyaird (4) - 1 freq courtyard (4) - 5 freq outward (4) - 2 freq |
boatyaird (0) - 1 freq braird (5) - 3 freq betrayed (5) - 7 freq bothied (5) - 2 freq board (5) - 151 freq boathered (5) - 2 freq baird (5) - 34 freq bastard (5) - 102 freq bodygaird (5) - 1 freq boathir (5) - 3 freq coortyaird (5) - 12 freq courtyaird (5) - 4 freq botherd (5) - 1 freq boatled (5) - 1 freq abaird (5) - 1 freq bator (6) - 1 freq bothered (6) - 59 freq baerd (6) - 4 freq abuird (6) - 12 freq borried (6) - 1 freq bord (6) - 2 freq braid (6) - 256 freq bourd (6) - 1 freq boathur (6) - 1 freq halyard (6) - 1 freq |
SoundEx code - B363 bothert - 37 freq buttert - 7 freq bothert- - 1 freq butter'd - 1 freq betrothal - 1 freq bothered - 59 freq boatyaird - 1 freq bathert - 11 freq battered - 37 freq beetroot - 14 freq bathered - 8 freq buttered - 19 freq betrayed - 7 freq battert - 9 freq betteradjistit - 1 freq bedridden - 2 freq bethrayed - 2 freq buddered - 7 freq bettered - 4 freq bother't - 1 freq baithert - 1 freq bithert - 2 freq bed-ridden - 1 freq batthered - 1 freq butter't - 2 freq baitert - 1 freq boathered - 2 freq bettert - 2 freq beetruit - 1 freq betrothit - 1 freq butteret - 1 freq batterit - 1 freq betterthedeilyeken - 1 freq bithered - 2 freq botherd - 1 freq |
MetaPhone code - BTYRT boatyaird - 1 freq |
BOATYAIRD |
| Time to execute Levenshtein function - 0.197363 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.352456 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.027963 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.037213 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.000915 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. |