| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubislaw (0) - 6 freq rubislaa (1) - 1 freq ruisan (3) - 1 freq rummlan (4) - 1 freq 'slaw (4) - 1 freq tslaw (4) - 1 freq rumblan (4) - 1 freq rubs (4) - 10 freq colinlaw (4) - 3 freq ruiftap (4) - 1 freq laidlaw (4) - 3 freq islay (4) - 4 freq tubular (4) - 2 freq robina (4) - 1 freq roilan (4) - 1 freq 'blaw (4) - 2 freq uissan (4) - 3 freq rustlan (4) - 1 freq ruill (4) - 2 freq publishar (4) - 1 freq rubbled (4) - 1 freq blaw (4) - 200 freq yugoslav (4) - 1 freq ruills (4) - 2 freq rubies (4) - 4 freq |
rubislaw (0) - 6 freq rubislaa (2) - 1 freq rubble (6) - 7 freq belaw (6) - 1 freq blaw (6) - 200 freq rubbled (6) - 1 freq ablaw (6) - 10 freq bylaw (6) - 1 freq abilow (6) - 7 freq mabonslaw (6) - 2 freq 'blaw (6) - 2 freq slaw (6) - 98 freq rubies (6) - 4 freq bresslaw (6) - 1 freq 'slaw (6) - 1 freq rubs (6) - 10 freq rubiesb (6) - 1 freq coleslaw (6) - 1 freq ruisan (6) - 1 freq tslaw (6) - 1 freq rebel (7) - 27 freq gbqlw (7) - 1 freq robson (7) - 14 freq rzlw (7) - 1 freq ronseal (7) - 1 freq |
SoundEx code - R124 rubislaa - 1 freq rapscallions - 1 freq rubislaw - 6 freq refuisal - 1 freq refusal - 2 freq robbieclyde - 1 freq ryfqlkyxbd - 1 freq robgill - 1 freq |
MetaPhone code - RBSL rubislaa - 1 freq rubislaw - 6 freq |
RUBISLAW |
| Time to execute Levenshtein function - 0.197651 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.328445 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.034545 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.037127 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.000911 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. |