Method and apparatus for automatic text input insertion in digital devices with a restricted number of keys

07/29/2017
by   Nikolaos Tselios, et al.
0

A device which contains number of symbol input keys, where the number of available keys is less than the number of symbols of an alphabet of any given language, screen, and dynamic reordering table of the symbols which are mapped onto those keys, according to a disambiguation method based on the previously entered symbols. The device incorporates a previously entered keystrokes tracking mechanism, and the key selected by the user detector, as well as a mechanism to select the dynamic symbol reordering mapped onto this key according to the information contained to the reordering table. The reordering table occurs from a disambiguation method which reorders the symbol appearance. The reordering information occurs from Bayesian Belief network construction and training from text corpora of the specific language.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2019

Extending de Bruijn sequences to larger alphabets

A circular de Bruijn sequence of order n in an alphabet of k symbols is ...
research
07/17/2019

Efficient computation of the Jacobi symbol

The family of left-to-right GCD algorithms reduces input numbers by repe...
research
04/30/2010

Graphic Symbol Recognition using Graph Based Signature and Bayesian Network Classifier

We present a new approach for recognition of complex graphic symbols in ...
research
11/10/2021

Tawsol Symbols 3D – Towards an innovative Picture Exchange Communication Systems PECS

Pictograms (also called symbols) are widely used in daily life as a type...
research
03/27/2013

Handling uncertainty in a system for text-symbol context analysis

In pattern analysis, information regarding an object can often be drawn ...
research
09/12/2022

SmartKex: Machine Learning Assisted SSH Keys Extraction From The Heap Dump

Digital forensics is the process of extracting, preserving, and document...
research
09/14/2022

Ryser's Theorem for Symmetric ρ-latin Squares

Let L be an n× n array whose top left r× r subarray is filled with k dif...

Please sign up or login with your details

Forgot password? Click here to reset