{'fraction_non_alphanumeric': 0.01020408163265306, 'fraction_numerical': 0.0, 'mean_word_length': 5.208860759493671, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Prefix matching for keystroke minimization using B+ tree

Keystroke minimization is one of the approaches in minimizing the efforts of Braille users while interacting through Braille keyboard. Keystroke minimization can be achieved using word prediction. Word prediction is a prediction of required word by matching the prefix of the word from the available dictionary of words. As the Braille users are visually impaired the word prediction definitely reduces the efforts by minimizing the number of keystrokes required. This paper review several available prefix match techniques with the proposed prefix match. The proposed technique uses B+ tree to represent the words in hierarchical and sorted fashion. The best prefix match is accomplished by applying binary search procedure. The proposed approach is particularly new to Braille user hence it not only achieves the best prefix match but also helpful in minimizing the efforts of Braille users when used in word prediction.