| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wobertsin (0) - 1 freq robertson (2) - 75 freq roberton (3) - 49 freq soberin (3) - 2 freq bertson (3) - 1 freq robertsons (3) - 1 freq roberts (3) - 1 freq lowerin (4) - 12 freq coorsin (4) - 2 freq birsin (4) - 4 freq overturn (4) - 1 freq exertin (4) - 1 freq weethin (4) - 28 freq sobert (4) - 1 freq fortin (4) - 1 freq roberthmw (4) - 1 freq molestin (4) - 1 freq revertin (4) - 2 freq work-in (4) - 1 freq avertin (4) - 1 freq wrtin (4) - 1 freq abettin (4) - 2 freq morresin (4) - 1 freq bartesin (4) - 1 freq birssin (4) - 1 freq |
wobertsin (0) - 1 freq robertson (3) - 75 freq bertson (4) - 1 freq bartesin (5) - 1 freq robertsons (5) - 1 freq roberts (5) - 1 freq roberton (5) - 49 freq berts (6) - 1 freq woburn (6) - 1 freq berthen (6) - 3 freq birssin (6) - 1 freq birthin (6) - 7 freq libertine (6) - 2 freq wartin (6) - 1 freq ower-suin (6) - 1 freq advertisin (6) - 8 freq wrtin (6) - 1 freq worritin (6) - 1 freq warasin (6) - 1 freq owertaen (6) - 2 freq wirtin (6) - 2 freq liberatin (6) - 2 freq worsen (6) - 1 freq albertina (6) - 1 freq birsin (6) - 4 freq |
SoundEx code - W163 whoever-it-is - 1 freq wafer-thin - 1 freq wiprt - 1 freq wobertsin - 1 freq wford - 1 freq |
MetaPhone code - WBRTSN wobertsin - 1 freq |
WOBERTSIN |
| Time to execute Levenshtein function - 0.231635 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.366075 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.028601 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.038325 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.000894 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. |