| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| behaviours (0) - 2 freq behavious (1) - 1 freq behaviour (1) - 59 freq behavioural (2) - 2 freq behavior (2) - 1 freq behavour (2) - 1 freq behaves (4) - 3 freq harbours (4) - 2 freq weirriours (4) - 3 freq slavours (4) - 1 freq behauds (4) - 1 freq behaivyoor (4) - 1 freq servitours (4) - 1 freq flavours (4) - 3 freq favours (4) - 22 freq saviour (4) - 14 freq relatiouns (4) - 1 freq beavers (4) - 2 freq savours (4) - 1 freq envious (4) - 2 freq eraiturs (4) - 1 freq behavin (4) - 4 freq behaving (4) - 4 freq belabour (4) - 1 freq devious (4) - 4 freq |
behaviours (0) - 2 freq behaviour (2) - 59 freq behavious (2) - 1 freq behavior (3) - 1 freq behavour (3) - 1 freq behavioural (3) - 2 freq behaivyoor (5) - 1 freq behaves (5) - 3 freq beavers (5) - 2 freq behavin (6) - 4 freq behaving (6) - 4 freq havers (6) - 35 freq haivers (6) - 32 freq 'haivers (6) - 4 freq 'havers (6) - 1 freq byjavers (6) - 1 freq savours (6) - 1 freq behauds (6) - 1 freq behuives (6) - 1 freq slavours (6) - 1 freq favours (6) - 22 freq flavours (6) - 3 freq behoves (6) - 1 freq thairs (7) - 14 freq endeavours (7) - 2 freq |
SoundEx code - B162 bifrost - 2 freq beverages - 1 freq beverage - 3 freq bifröst - 1 freq buffers - 1 freq behaviours - 2 freq beavers - 2 freq |
MetaPhone code - BHFRS behaviours - 2 freq |
BEHAVIOURS |
| Time to execute Levenshtein function - 0.393087 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.734418 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.030047 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.071444 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.001013 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. |