Method of word identification that uses interspersed time-independent selection keys

• US 10,216,410 B2
• Filed: 04/27/2016
• Issued: 02/26/2019
• Est. Priority Date: 04/30/2015
• Status: Active Grant

• Current Assignee: Michael William Murphy
• Original Assignee: Michael William Murphy
• Inventors: Murphy, Michael William
• Primary Examiner(s): Nguyen, Cao H
• Application Number:
  US15/139,862
• Publication Number:
  US 20160320963A1
• Time in Patent Office: 1,035 Days
• Field of Search: 345173, 345156
• CPC Class Codes: G06F 3/0219 Special purpose keyboards
• CPC Class Codes: G06F 3/0236 using selection techniques to select from displayed items
• CPC Class Codes: G06F 3/04847 Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
• CPC Class Codes: G06F 3/04895 Guidance during keyboard input operation, e.g. prompting
• CPC Class Codes: G06F 40/166 Editing, e.g. inserting or deleting
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation
• CPC Class Codes: G06F 9/451 Execution arrangements for user interfaces

Abstract

Systems, devices and methods are disclosed that improve error correction in time-dependent character input systems. Error correction algorithms correct inaccurately entered words by identifying alternative button press type combinations that conform to the number of button presses in a button press type sequence. The number of possible alternative combinations compounds as the number of button presses in a sequence increases. The disclosed improvement reduces the number of possible alternative button press type sequences by including interspersed time-independent selection buttons among the time-dependent ones. The algorithm divides the button press type sequence into segments at each time-independent button press type of the sequence. The algorithm identifies alternative button press type sequences separately for each segment, converts possible alternative button press type segments to character sequence segments, and considers the possible combinations of reconnected character sequence segments and time-independent character assignments as possible word alternatives.

Claims

1. A computer processor-implemented method comprising:

receiving, by at least one computer processor, input resulting from actuation of a plurality of time-dependent buttons and at least one time-independent button;

interpreting, by at least one computer processor, from the received input, a sequence of button press values and a sequence of button press types;

dividing, by at least one computer processor, the interpreted sequence of button press types into segments at positions in the sequence occupied by a button press type that is interpreted from an actuation of the at least one time-independent button;

determining, by at least one computer processor, for each segment, at least one alternative sequence of button press types associated with the segment, wherein each alternative sequence of button press types associated with the segment has a same number of button actuations as the segment;

converting, by at least one computer processor, for each segment, each associated alternative sequence of button press types to an alternative sequence of characters associated with the segment according to the interpreted sequence of button press values; and

determining, by at least one computer processor, at least one reconnected sequence comprised of, for each segment, an alternative sequence of characters associated with the segment or a presumed sequence of characters associated with the segment, the presumed sequence of characters associated with the segment based on the input resulting from the actuation of the buttons.

2. The method of claim 1 wherein the at least one reconnected sequence is a plurality of alternative reconnected sequences and further comprising:

comparing, by at least one computer processor, the plurality of reconnected sequences with a library of known words; and

selecting, by at least one computer processor, one of the plurality of reconnected sequences as input in place of a presumed word, the presumed word based on the input resulting from the actuations of the buttons.

3. The method of claim 1 wherein the at least one reconnected sequence is comprised of, for each segment, an alternative sequence of characters associated with the segment.

4. A system comprising:

at least one computer processor; and

at least one memory coupled to the at least one computer processor, the at least one memory having computer executable instructions stored thereon that, when executed, cause the at least one processor to perform;

receiving input resulting from actuation of a plurality of time-dependent buttons and at least one time-independent button;

interpreting from the received input, a sequence of button press values and a sequence of button press types;

dividing the interpreted sequence of button press types into segments at positions in the sequence occupied by a button press type that is interpreted from an actuation of the at least one time-independent button;

determining, for each segment, at least one alternative sequence of button press types associated with the segment, wherein each alternative sequence of button press types associated with the segment has a same number of button actuations as the segment;

converting for each segment, each associated alternative sequence of button press types to an alternative sequence of characters associated with the segment according to the interpreted sequence of button press values; and

determining at least one reconnected sequence comprised of, for each segment, an alternative sequence of characters associated with the segment or a presumed sequence of characters associated with the segment, the presumed sequence of characters associated with the segment based on the input resulting from the actuation of the buttons.

5. The system of claim 4 wherein the at least one reconnected sequence is a plurality of alternative reconnected sequences and wherein the computer executable instructions, when executed, further cause the at least one processor to perform:

comparing the plurality of reconnected sequences with a library of known words; and

selecting one of the plurality of reconnected sequences as input in place of a presumed word, the presumed word based on the input resulting from the actuations of the buttons.

6. The system of claim 4 wherein the at least one reconnected sequence is comprised of, for each segment, an alternative sequence of characters associated with the segment.

7. A non-transitory computer-readable medium having computer executable instructions stored thereon that, when executed, cause at least one processor to perform:

receiving input resulting from actuation of a plurality of time-dependent buttons and at least one time-independent button;

interpreting from the received input, a sequence of button press values and a sequence of button press types;

dividing the interpreted sequence of button press types into segments at positions in the sequence occupied by a button press type that is interpreted from an actuation of the at least one time-independent button;

determining, for each segment, at least one alternative sequence of button press types associated with the segment, wherein each alternative sequence of button press types associated with the segment has a same number of button actuations as the segment;

converting for each segment, each associated alternative sequence of button press types to an alternative sequence of characters associated with the segment according to the interpreted sequence of button press values; and

determining at least one reconnected sequence comprised of, for each segment, an alternative sequence of characters associated with the segment or a presumed sequence of characters associated with the segment, the presumed sequence of characters associated with the segment based on the input resulting from the actuation of the buttons.

8. The computer-readable medium of claim 7 wherein the at least one reconnected sequence is a plurality of alternative reconnected sequences and wherein the computer executable instructions, when executed, further cause the at least one processor to perform:

comparing the plurality of reconnected sequences with a library of known words; and

selecting one of the plurality of reconnected sequences as input in place of a presumed word, the presumed word based on the input resulting from the actuations of the buttons.

9. The computer-readable medium of claim 7 wherein the at least one reconnected sequence is comprised of, for each segment, an alternative sequence of characters associated with the segment.