| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| behavioural (0) - 2 freq behaviours (2) - 2 freq behaviour (2) - 59 freq behavior (3) - 1 freq behavious (3) - 1 freq behavour (3) - 1 freq belabour (5) - 1 freq €˜naitural (5) - 1 freq bravura (5) - 1 freq behavin (5) - 4 freq behaivyoor (5) - 1 freq saviour (5) - 14 freq behoul (5) - 4 freq balmoral (5) - 11 freq behaving (5) - 4 freq naitural (5) - 35 freq habitual (5) - 2 freq headicraa (6) - 2 freq teviotdale (6) - 1 freq favour (6) - 69 freq feictional (6) - 1 freq retiral (6) - 5 freq beglamourt (6) - 1 freq barbour (6) - 17 freq devour' (6) - 1 freq |
behavioural (0) - 2 freq behaviour (3) - 59 freq behaviours (3) - 2 freq behavior (4) - 1 freq behavour (4) - 1 freq behavious (5) - 1 freq behaivyoor (6) - 1 freq behoul (7) - 4 freq behaving (7) - 4 freq balmoral (7) - 11 freq bravura (7) - 1 freq behavin (7) - 4 freq haiverel (7) - 1 freq behave (8) - 38 freq beaver (8) - 5 freq havera (8) - 2 freq choral (8) - 2 freq beerial (8) - 10 freq several (8) - 46 freq bovril (8) - 11 freq behuvit (8) - 1 freq viral (8) - 3 freq bheurla (8) - 2 freq behauder (8) - 2 freq baurel (8) - 2 freq |
SoundEx code - B164 beverly - 3 freq bovril - 11 freq behavioural - 2 freq bovrils - 1 freq |
MetaPhone code - BHFRL behavioural - 2 freq |
BEHAVIOURAL |
| Time to execute Levenshtein function - 0.224702 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.377047 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.032747 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.039760 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.000844 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. |