Patent Grant
10489508
Some computing devices (e.g., mobile phones, tablet computers, etc.) may provide a graphical keyboard as part of a graphical user interface for composing text using a presence-sensitive display (e.g., screen). The graphical keyboard may enable a user of the computing device to enter text (e.g., an e-mail, a text message, or a document, etc.). For instance, a presence-sensitive display of a computing device may present a graphical (or “soft”) keyboard that enables the user to enter data by indicating (e.g., by tapping) keys displayed at the presence-sensitive display.
Gesture-based keyboards may be used to input text into a smartphone. Such keyboards may suffer from limitations in accuracy, speed, and inability to adapt to the user. In some examples, a gesture-based keyboard may include functionality to provide word predictions and/or autocorrections of character strings entered by a user. As a user becomes accustomed to a gesture-based keyboard, the user may wish to enter character strings with many characters in a single gesture. In some examples, prediction and/or autocorrection accuracy may diminish as the number of characters included in a single gesture increases.
In one example, a method includes outputting, by a computing device and for display at a presence-sensitive display operatively coupled to the computing device, a graphical keyboard comprising a plurality of keys, and receiving, by the computing device, an indication of a gesture detected at the presence-sensitive display, a first portion of the gesture to select a first key of the plurality of keys and a second portion of the gesture to select a second key of the plurality of keys. The method further includes determining, by the computing device and based at least in part on the first key, a word-level token comprising a single string of a plurality of predicted characters, and determining, by the computing device, that the word-level token represents a candidate word included in a lexicon. The method further includes determining, by the computing device and in response to determining that the word-level token represents the candidate word in the lexicon, a phrase-level token based at least in part on the word-level token and the second character key, wherein the phrase-level token comprises a plurality of character strings.
In another example, a computer-readable storage medium is encoded with instructions that, when executed, cause at least one processor of a computing device to output, for display at a presence-sensitive display operatively coupled to the computing device, a graphical keyboard comprising a plurality of keys, and receive an indication of a continuous gesture detected at the presence-sensitive display, the continuous gesture to select a group of keys of the plurality of keys. The computer-readable storage medium is further encoded with instructions that, when executed, cause the at least one processor to determine, in response to receiving the indication of the continuous gesture to select the group of keys, a phrase-level token representing a plurality of candidate words, wherein the phrase-level token comprises a plurality of character strings.
In another example, a device includes at least one processor that is operatively coupled to a presence-sensitive display, and a gesture module operable by the at least one processor to output, for display at the presence-sensitive display, a graphical keyboard comprising a plurality of keys, and receive an indication of a continuous gesture detected at the presence-sensitive display, the continuous gesture to select a group of keys of the plurality of keys. The gesture module is further operable by the at least one processor to determine, in response to receiving the indication of the continuous gesture and based at least in part on the group of keys of the plurality of keys, a candidate phrase comprising a group of candidate words.
The details of one or more examples of the disclosure are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.
In general, this disclosure is directed to techniques for incrementally determining one or more candidate words of a candidate phrase based on a detected gesture (e.g., a gesture to select a sequence of characters included in a graphical keyboard). In some examples, a presence-sensitive display device that displays a graphical keyboard may also detect gestures. The presence-sensitive display (e.g., a touch-sensitive screen) may enable a user to input text by detecting user inputs in the form of gestures performed at or near the presence-sensitive display. In certain examples, a user may enter a string of text (for example a word or phrase), by performing one or more gestures at or near the presence-sensitive display. Techniques described herein may improve a user's ability to enter such text using a graphical keyboard.
For instance, rather than performing multiple discrete gestures to input a single word or phrase (e.g., multiple touch gestures, each discrete touch gesture to select a character of the word or phrase), techniques of this disclosure may enable a user to perform a single gesture that indicates the word or phrase. As an example, using techniques of this disclosure, a user may perform a continuous motion gesture that indicates a multi-word phrase without removing an input unit used to provide the gesture (e.g., a finger, pen, stylus, and the like) from the presence-sensitive display.
As the user performs the gesture, the computing device may incrementally determine a group of keys of the graphical keyboard indicated by the gesture. The incremental determinations may include searching for one or more points of a gesture that each align with a given keyboard position of a key that corresponds to a given letter. The search may include selecting a point of the gesture that best aligns with the letter of the keyboard.
To determine candidate words indicated by the gesture, the computing device may determine one or more word-level tokens, each of which includes a string of predicted characters indicated by the gesture. Each word-level token may be a prefix of one or more words included in a lexicon (e.g., dictionary). The computing device may determine one or more candidate words indicated by the gesture based on the word-level token. To determine candidate phrases, the computing device may determine one or more phrase-level tokens, each of which includes a plurality of character strings indicated by the gesture. That is, in addition to representing a prefix of one or more words included in the lexicon, a word-level token may itself represent a complete word included in the lexicon. A word-level token that represents a candidate word included in the lexicon may indicate that the next key indicated by the gesture represents the start of a new candidate word. As such, in response to determining that a word-level token represents a candidate word in the lexicon, the computing device may determine a phrase-level token that includes multiple character strings. As the user provides the gesture, the computing device may incrementally determine one or more candidate words and one or more candidate phrases indicated by the gesture.
As such, using techniques described herein, a computing device may determine one or more probable interpretations for a gesture based at least in part on both the gesture and various states in a lexicon in parallel. In this way, techniques disclosed herein may incrementally match the gesture to words and phrases in a data structure, such as a lexicon trie, one node/letter at a time, using a spatial and/or lexical gesture model.
By enabling the user to enter a multi-word phrase with a single gesture and performing incremental determinations to identify candidate words included in the phrase, techniques of this disclosure may enable the user to increase the rate at which text is entered. Consequently, techniques of the disclosure may relieve a user from performing a tap gesture for each letter of each word in a phrase, which may be difficult for a user and/or may result in a decreased text-entry rate due to the requirement that the user's finger discretely contact individual keys. Moreover, the user can, with a single gesture, select a number of keys that correspond to characters of multiple words in a phrase. In this way, the user can continuously swipe to select numerous characters, and techniques of the disclosure may automatically and incrementally determine whether the characters correspond to a single word or a phrase that includes a group of words. The techniques may also reduce a user's effort to accurately contact individual keys.
Examples of computing device 2 may include, but are not limited to, portable or mobile devices such as mobile phones (including smart phones), laptop computers, desktop computers, tablet computers, smart television platforms, cameras, personal digital assistants (PDAs), servers, mainframes, etc. As shown in the example of
Computing device 2 may include UI device 4. In some examples, UI device 4 may be configured to receive tactile, audio, or visual input. UI device 4, as shown in
As shown in
UI module 6 may be implemented in various ways. For example, UI module 6 may be implemented as a downloadable or pre-installed application or “app.” In another example, UI module 6 may be implemented as part of a hardware unit of computing device 2. In another example, UI module 6 may be implemented as part of an operating system of computing device 2.
Computing device 2, in some examples, includes gesture module 8. Gesture module 8 may include functionality to perform a variety of operations on computing device 2, such as functionality to incrementally determine text from a gesture in accordance with the techniques described herein. Gesture module 8 may be implemented in various ways. For example, gesture module 8 may be implemented as a downloadable or pre-installed application or “app.” In another example, gesture module 8 may be implemented as part of a hardware unit of computing device 2. In another example, gesture module 8 may be implemented as part of an operating system of computing device 2.
Gesture module 8 may receive data from components associated with computing device 2, such as UI module 6. For instance, gesture module 8 may receive gesture data from UI module 6 that causes gesture module 8 to determine text from the gesture data. In some examples, gesture module 8 determines one or more locations of UI device 4 that are touched or otherwise detected in response to a user gesture, based on information received from UI module 6. In some examples, gesture module 8 can determine one or more features associated with a gesture, such as the Euclidean distance between two alignment points, the length of a gesture path, the direction of a gesture, the curvature of a gesture path, the shape of the gesture, and maximum curvature of a gesture between alignment points, speed of the gesture, etc. Gesture module 8 may also send data to components associated with computing device 2, such as UI module 6. For instance, gesture module 8 may send text determined from the gesture data to UI module 6 that causes UI device 4 to display GUI 12.
As shown in
In some examples, committed-text region 14 may include characters or other graphical content that are included in, for example, a text-message, a document, an e-mail message, a web browser, and the like. For instance, committed-text region 14 may include characters or other graphical content that are selected by user 18 via gestures performed at UI device 4. In some examples, text-suggestion regions 24 may each display a word and/or multi-word phrase. As illustrated in the example of
UI module 6 may cause UI device 4 to display graphical keyboard 16 and detect a gesture having gesture path 22 which is incrementally determined by gesture module 8 in accordance with techniques described herein. Additionally, UI module 6 may cause UI device 4 to display a candidate word and/or phrase determined from the gesture in one or more of text-suggestion regions 24.
Graphical keyboard 16 may be displayed by UI device 4 as an ordered set of selectable keys. Keys may represent a single character from a character set (e.g., letters of the English alphabet), or may represent combinations of characters. One example of a graphical keyboard may include a traditional “QWERTY” keyboard layout. Other examples may contain characters for different languages, different character sets, or different character layouts. As shown in the example of
Computing device 2, in some examples, includes language model 10. Language model 10 may include a lexicon. In some examples, a lexicon may include a listing of words and may include additional information about the listed words. A lexicon may be represented by one or more data structures, such as by one or more of an array, a list, a tree, or other data structures. For example, language model 10 may include a lexicon stored in a trie data structure. A lexicon trie data structure may include a plurality of nodes. Each node of the lexicon trie may represent a letter. The first node in a lexicon trie may be considered an entry node, which may not correspond to a letter. In other examples, the entry node may correspond to a letter. Each node may have one or more child nodes. For instance, the entry node may have twenty-six child nodes, each corresponding to a letter of the English alphabet.
A subset of the nodes in a lexicon trie may each include a flag which indicates that the node is a terminal node. Each terminal node of a lexicon trie may indicate a complete word (e.g., a candidate word) included in the lexicon. The letters indicated by the nodes along a path of nodes from the entry node to a terminal node may spell out a word indicated by the terminal node. In some examples, language model 10 may be a default dictionary installed on computing device 2. In certain examples, language model 10 may include a group of predefined phrases installed on computing device 2. In other examples, language model 10 may include multiple sources of lexicons, which may be stored at computing device 2 or stored at one or more remote computing devices that are accessible to computing device 2 via one or more communication channels.
In some examples, language model 10 may be implemented in the firmware of computing device 2. Language model 10 may include language model frequency information such as n-gram language models. An n-gram language model may provide a probability distribution for an item xi (letter, word, punctuation character or other delimiter) in a contiguous sequence of items based on the previous items in the sequence (i.e., P(xi|xi-(n-1), . . . , xi-1)). For instance, a bigram language model (an n-gram model where n=2), may provide a probability that the letter “w” follows the sequence of letters “no”. As another example, a trigram language model (an n-gram model where n=3) may provide a probability that the word “to” follows the sequence of words “we aim”. In certain examples, a trigram language model may provide a probability that a delimiter character (e.g., a comma delimiter character, a period delimiter character, a semicolon delimiter character) is positioned between a first character string and a second character string. For instance, a trigram language model may provide a probability that a comma delimiter character is positioned between a first character string “example” and a second character string “the.” In some examples, language model 10 includes a lexicon trie with integrated language model frequency information. For instance, each node of the lexicon trie may include a representation of a letter and a probability value.
Techniques of the present disclosure may improve the speed and accuracy with which a user can enter text into a computing device. Using techniques of this disclosure, a user may, instead of performing a discrete gesture for each key of a word, perform a single gesture that indicates the word. Similarly, according to techniques described herein, a user may perform a single gesture that indicates characters of multiple words (e.g., two words, three words, five words, or other numbers of words) in a phrase.
As the user performs the gesture, the computing device may incrementally determine a group of keys indicated by the gesture. Each key may be associated with one or more characters. The computing device may determine, based on the determined group of keys, one or more word-level tokens, each of the word-level tokens including a single string of a plurality of predicted characters. The computing device may determine one or more candidate words indicated by the gesture based on the word-level tokens. In addition, the computing device may determine that a word-level token itself represents a complete word included in a lexicon. In response, the computing device may determine a phrase-level token that includes a plurality of character strings. For instance, the computing device may determine the phrase-level token as a combination of the word-level token that represents the complete word included in the lexicon and another word-level token that begins with a next selected key indicated by the gesture. By incrementally decoding the gesture as it is being performed, the user may be presented with a candidate word and/or phrase with minimal post-gesture entry processing time. Moreover, by enabling the user to enter a word and/or phrase with a single gesture, techniques of this disclosure may enable the user to increase the rate at which text is entered.
As shown in the example of
The gesture may include a plurality of portions. In some examples, the gesture may be divided into portions with substantially equivalent time durations. Where the gesture includes a plurality of portions, the gesture may include a final portion which may be a portion of the gesture detected prior to detecting that the gesture is complete. For instance, a portion of the gesture may be designated as the final portion where user 18 moves his/her finger out of proximity with UI device 4 such that the finger is no longer detected by UI device 4.
As illustrated, user 18 may perform a gesture to select a group of keys of the plurality of keys. In the example of
In response to receiving data that represents gesture path 22, gesture module 8 may determine one or more word-level tokens, each of the word-level tokens including a single string of a plurality of predicted characters. For example, based at least in part on the indication of portion 22A of gesture path 22, gesture module 8 may determine one or more word-level tokens, each of the word-level tokens including a single string of predicted characters indicated by portion 22A. As an example, gesture module 8 may determine a first word-level token as the string of predicted characters “qe” corresponding to an indication of a predicted selection of “Q” key 20A and “E” key 20C. Similarly, gesture module 8 may determine a second word-level token as the string of predicted characters “we” corresponding to an indication of a predicted selection of “W” key 20B and “E” key 20C. Gesture module 8 may incrementally determine multiple such word-level tokens based at least in part on one or more selected keys of graphical keyboard 16. Each character of each word-level token may be associated with a region of UI device 4 that displays a key corresponding to the character. Gesture module 8 may determine the one or more word-level tokens based on observed touch points relative to the area of UI device 4 that displays the one or more keys corresponding to the one or more characters of the word-level token.
Each of the word-level tokens including the single string of predicted characters may be a prefix of a word included in the lexicon. Gesture module 8 may determine one or more candidate words based at least in part on the one or more word-level tokens. A candidate word may be a word suggested to the user that is composed of a group of keys indicated by gesture path 22. As an example, as described above, gesture module 8 may determine one or more word-level tokens in response to receiving an indication of portion 22A of gesture path 22, such as a first word-level token including the string of predicted characters “qe”, a second word-level token including the string of predicted characters “we”, a third word-level token including the string of predicted characters “wr”, or other word-level tokens. One or more of the word-level tokens may be a prefix of a word included in a lexicon. Gesture module 8 may, in certain examples, incrementally determine one or more candidate words as one or more of the words included in the lexicon for which a word-level token is a prefix.
Additionally, one or more of the word-level tokens may represent a candidate word included in the lexicon. For instance, in the present example, gesture module 8 may determine that the second word-level token including the string of predicted characters “we”, in addition to being a prefix of words included in the lexicon (e.g., the words “went”, “were”, etc.), itself represents a candidate word included in the lexicon (i.e., the word “we” in the English language). As such, gesture module 8 may determine that a next selected key indicated by gesture path 22, rather than representing a next letter of a word for which the string of characters “we” is a prefix, may represent a first letter of a next word. In response to determining that the word-level token represents the candidate word in the lexicon, gesture module 8 may determine a phrase-level token based at least in part on the word-level token and a next predicted character key as indicated by gesture path 22.
For example, as illustrated in the example of
Gesture module 8 may determine candidate phrases based on the phrase-level token, such as by determining a candidate phrase as a combination of the word-level token that represents the candidate word in the dictionary and a candidate word for which the next word-level token that begins with the next predicted character is a prefix. As an example, gesture module 8 may determine one or more candidate phrases, such as the phrase “we are”, the phrase “we ask”, and the like. In some examples, gesture module 8 may cause UI module 6 to output one or more of the candidate phrases for display at text-suggestion regions 24.
In addition to determining the phrase-level token based at least in part on the indication of the next selected character, gesture module 8 may determine a word-level token based at least in part on the next selected character. For example, gesture module 8 may determine a phrase-level token based at least in part on the word-level token including the plurality of character strings “we” and “a” separated by a space character, and may determine a word-level token that includes the single string of predicted characters “wea”. That is, gesture module 8 may incrementally determine predicted words and predicted phrases indicated by gesture path 22 in parallel, thereby enabling a user to provide one continuous gesture to select a group of keys included in both candidate words and candidate phrases.
Gesture module 8 may determine the one or more word-level tokens and phrase-level tokens by determining a group of alignment points traversed by gesture path 22, determining respective cost values for each of at least two keys of the plurality of keys, and comparing the respective cost values for at least each of at least two keys of the plurality of keys, as further described below.
An alignment point is a point along gesture path 22 that may indicate a key of the plurality of keys included in graphical keyboard 16. An alignment point may include one or more coordinates corresponding to the determined position of the alignment point. For instance, an alignment point may include Cartesian coordinates corresponding to a point on GUI 12.
In some examples, gesture module 8 determines the group of alignment points traversed by gesture path 22 based on a plurality of features associated with gesture path 22. The plurality of features associated with gesture path 22 may include a length of a segment of gesture path 22. For instance, gesture module 8 may determine the length along the gesture segment from a previous alignment point and the current alignment point. For better alignments, the length will more closely approximate the straight-line distance between to two corresponding keyboard letters.
In another example, gesture module 8 may determine a direction of a segment from a first point to a second point of gesture path 22 to determine the group of alignment points. For better alignments, the direction of the segment will more closely approximate the direction of a straight line from between two corresponding keyboard letters.
In some examples, gesture module 8 may determine features of gesture path 22 such as a curvature of a segment of gesture path 22, a local speed representing a rate at which a segment of path 22 was detected, and a global speed representing a rate at which gesture path 22 was detected. If gesture module 8 determines a slower speed or pause for the local speed, gesture module 8 may determine that a point at the segment is more likely to be an alignment point. If gesture module 8 determines that a gesture was drawn quickly, gesture module 8 may determine that the gesture is more likely to be imprecise and therefore gesture module 8 may apply a greater weight on the language module (i.e., n-gram frequencies) than the spatial model. In one example, gesture module 8 may determine an alignment point of the group of alignment points based on a segment of gesture path 22 having a high curvature value. Additionally, gesture module 8 may determine an alignment point of the group of alignment points based on a segment of gesture path 22 having a low local speed (i.e., the user's finger slowed down while performing the segment of the gesture). In the example of
In some examples, gesture module 8 may determine respective cost values for each of at least two keys of the plurality of keys included in keyboard 16. Each of the respective cost values may represent a probability that an alignment point indicates a key. In some examples, the respective cost values may be based on physical features of the gesture path, the alignment point, and/or the key. For instance, the respective cost values may be based on the physical location of the alignment point with reference to the physical location of the key.
In some examples, the respective cost values may be based on language model 10. For instance, the respective cost values may be based on the probability that a second key will be selected after a first key (e.g., the probability that the “e” key will be selected after the “w” key). As another example, the respective cost values may be based on the probability that a second candidate word will follow a first candidate word (e.g., the probability that the candidate word “aim” will follow the candidate word “we”). In certain examples, the keys for which respective cost values are determined are selected based at least in part on language model 10. In some examples, the cost values are lower where there is a greater likelihood that an alignment point indicates a key. In other examples, the cost values are higher where there is a greater likelihood that an alignment point indicates a key.
In certain examples, language model 10 may include frequency information regarding a probability that one or more delimiter characters are positioned between a first character string and a second character string of a phrase-level token. For instance, a phrase-level token may include a first character string including the characters “John” and a second character string including the characters “this”. In such an example, language model 10 (e.g., an n-gram language model) may include frequency information indicating a probability that one or more delimiter characters are positioned between the first character string (e.g., the character string “John”) and the second character string (e.g., the character string “this”).
For instance, language model 10 may include frequency information indicating a probability that a comma delimiter is positioned between the first character string “John” and the second character string “this”. In some examples, computing device 2 may determine a phrase-level token as including one or more delimiter characters positioned between the first character string and the second character string based at least in part on the probability indicated by language model 10 that the delimiter character is positioned between the first and second character strings of the phrase-level token. As such, in certain examples, computing device 2 may automatically insert one or more delimiter characters in a candidate phrase, thereby enabling a user to provide a single continuous gesture to select one or more characters of a phrase without providing an input to affirmatively select the one or more delimiter characters. As such, in certain examples, graphical keyboard 16 may not include keys associated with one or more delimiter characters. For instance, in some examples, graphical keyboard 16 may not include keys associated with one or more of a space delimiter character, a period character, a comma character, a hyphen character, an apostrophe character, or other delimiter characters.
Examples of such delimiter characters may include, but are not limited to, one or more of a comma delimiter character, a period delimiter character, a semicolon delimiter character, a question mark delimiter character, a hyphen delimiter character, an apostrophe delimiter character, or other punctuation delimiter characters. In general, a delimiter character may include any character (e.g., punctuation character or otherwise) that may be used to separate or otherwise delimit characters or strings of characters. As an example, in the example of
In some examples, language model 10 may include a probability that more than one delimiter character is positioned between the first and second character strings. For instance, a first character string may include the characters “e.g” and a second character string may include the characters “the”. In such an example, language model 10 may include a probability that both a period delimiter character and a comma delimiter character are positioned between the first and second character strings, such that the phrase-level token includes the phrase “e.g., the” (i.e., the first character string “i.e” followed by a period delimiter character and a comma delimiter character). As another example, language model 10 may include a probability that multiple delimiter characters, such as a period delimiter character and two space delimiter characters are positioned between the first and second character strings. For instance, a first character string may include the characters “end” and a second character string may include the characters “next”. In such an example, language model 10 may include a probability that a period delimiter character and two space delimiter characters are positioned between the first and second character strings, such that the phrase-level token includes the phrase “end. Next”.
Gesture module 8 may, in certain examples, insert one or more delimiter characters between a first character string of a phrase-level token and a second character string of the phrase-level token. For example, gesture module 8 may compare the probability that the one or more delimiter characters are positioned between the first and second character strings to a threshold value (e.g., a threshold probability, such as sixty percent, seventy percent, ninety percent, or other probabilities). Gesture module 8 may insert the one or more delimiter characters between the first and second character strings when the determined probability satisfies the threshold value, such as when the determined probability is greater than (or equal to) the threshold value.
In some examples, gesture module 8 may determine a first phrase-level token that does not include the one or more delimiter characters and a second phrase-level token that includes the one or more delimiter characters. In such examples, gesture module 8 may determine respective cost values for each of the characters included the first phrase-level token that does not include the one or more delimiter characters. Similarly, gesture module 8 may determine respective cost values for each of the characters included in the second phrase-level token that includes the one or more delimiter characters. Gesture module 8 may determine one or more candidate phrases based at least in part on the respective cost values for the first phrase-level token and the second phrase-level token. In such a way, gesture module 8 may incrementally determine one or more candidate phrases indicated by a gesture, the one or more candidate phrases including one or more delimiter characters positioned between character strings of the candidate phrase.
In the example of
Gesture module 8 may compare the respective cost values for at least two keys of the plurality of keys to determine a combination of keys having a combined cost value that satisfies a threshold. A combined cost value may represent a probability that gesture path 22 indicates a combination of keys. Gesture module 8 may compare the respective cost values for at least two keys of the plurality of keys to determine which of the at least two keys is indicated by an alignment point. Gesture module 8 may determine a combination of keys by determining which keys are indicated by each alignment point. In some examples, gesture module 8 determines which of the at least two keys is indicated by an alignment point without regard to which keys are indicated by other alignment points. In other examples, gesture module 8 determines which of the at least two keys is indicated by the alignment point based on which keys are indicated by other alignment points. In such examples, gesture module 8 may revise the determination of which key is indicated by a previous alignment point based on the respective cost values for a current alignment point.
In some examples, gesture module 8 may compare the combined cost value of a determined combination of keys with a threshold value. In some examples, the threshold value is the combined cost value of a different determined combination of keys. For instance, gesture module 8 may determine a first combination of keys having a first combined cost value and a second combination of keys having a second combined cost value. In such an instance, gesture module 8 may determine that a candidate word or phrase is based on the combination of keys with the lower combined cost value. In the example of
In some examples, gesture module 8 begins to determine a candidate word and/or phrase prior to the time in which UI device 4 completes detecting gesture path 22. In the example of
In some alternative embodiments, a user can provide an indication that a character associated with a key should be included in the candidate word and/or phrase, such as by pausing for a threshold time duration at a key to indicate that the character should be included in the candidate word and/or phrase. Similarly, a user may provide an indication that a next selected key should be included in a next word of a candidate phrase, such as by pausing for a threshold time duration at or near the last letter of a word prior to extending the gesture to the first letter of the next word, or performing a motion gesture at or near the last letter of a word prior to extending the gesture to the first letter of the next word (e.g., a looping gesture, an upward motion gesture, a downward motion gesture, a motion gesture in a direction toward a space key, etc). In another alternative embodiment, rather than using a trie based search as described using techniques of the disclosure, gesture module 8 may maintain a separate gesture-specific word list or dictionary.
In some examples, techniques of the disclosure provide for efficient performance on computing devices, for instance, recognizing gestures in fewer than 100 milliseconds in some cases. Techniques of the disclosure may also use the default dictionary installed on the mobile device rather than using a dedicated gesture dictionary that may be maintained separately and use additional storage resources. In this way, techniques of the disclosure may reduce storage requirements by using a dictionary that is already stored by a default input entry system. Moreover, the dictionary may be implemented efficiently as a compact lexicon trie. Using a default dictionary already provided on a computing device also provides ready support foreign languages, contact names, and user added words in accordance with techniques of the disclosure. By using, e.g., a lexicon trie and the default dictionary, techniques of the disclosure may integrate the language model frequencies (i.e., n-gram probabilities) into the gesture interpretation, thereby allowing the search techniques to concentrate on the most promising paths for candidate words based on both the shape of the gesture and the probability of the word being considered.
Additionally, by incrementally determining the selected keys of the plurality of keys indicated by the gesture using both a spatial model and a language model, techniques described herein may enable the computing device to determine a candidate word and/or phrase that is not included in the lexicon. For instance, based on a combination of the spatial model including a determination of alignment points traversed by the gesture and other features of the gesture (e.g., a local speed of one or portions of the gesture, a global speed of the gesture, a curvature of one or more portions of the gesture, etc.) and the language model (e.g., n-gram frequencies of predicted characters and/or words), the computing device may determine that a most probable group of keys indicated by the gesture includes a group of keys that does not spell a word included in the lexicon. As such, according to techniques described herein, the computing device may enable a user to provide a single gesture to select a group of keys that does spell a word included in the lexicon, such as an abbreviation or other such character string.
As shown in the specific example of
Each of components 4, 40, 42, 44, 46, and 48 may be interconnected (physically, communicatively, and/or operatively) for inter-component communications. In some examples, communication channels 50 may include a system bus, a network connection, an inter-process communication data structure, or any other method for communicating data. As one example in
Processors 40, in one example, are configured to implement functionality and/or process instructions for execution within computing device 2. For example, processors 40 may be capable of processing instructions stored in storage device 48. Examples of processors 40 may include any one or more of a microprocessor, a controller, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or equivalent discrete or integrated logic circuitry.
One or more storage devices 48 may be configured to store information within computing device 2 during operation. Storage device 48, in some examples, is described as a computer-readable storage medium. In some examples, storage device 48 is a temporary memory, meaning that a primary purpose of storage device 48 is not long-term storage. Storage device 48, in some examples, is described as a volatile memory, meaning that storage device 48 does not maintain stored contents when the computer is turned off. Examples of volatile memories include random access memories (RAM), dynamic random access memories (DRAM), static random access memories (SRAM), and other forms of volatile memories known in the art. In some examples, storage device 48 is used to store program instructions for execution by processors 40. Storage device 48, in one example, is used by software or applications running on computing device 2 (e.g., gesture module 8) to temporarily store information during program execution.
Storage devices 48, in some examples, also include one or more computer-readable storage media. Storage devices 48 may be configured to store larger amounts of information than volatile memory. Storage devices 48 may further be configured for long-term storage of information. In some examples, storage devices 48 include non-volatile storage elements. Examples of such non-volatile storage elements include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories.
Computing device 2, in some examples, also includes one or more communication units 44. Computing device 2, in one example, utilizes communication unit 44 to communicate with external devices via one or more networks, such as one or more wireless networks. Communication unit 44 may be a network interface card, such as an Ethernet card, an optical transceiver, a radio frequency transceiver, or any other type of device that can send and receive information. Other examples of such network interfaces may include Bluetooth, 3G and WiFi radios computing devices as well as Universal Serial Bus (USB). In some examples, computing device 2 utilizes communication unit 44 to wirelessly communicate with an external device such as a server.
Computing device 2, in one example, also includes one or more input devices 42. Input device 42, in some examples, is configured to receive input from a user through tactile, audio, or video feedback. Examples of input device 42 include a presence-sensitive display, a mouse, a keyboard, a voice responsive system, video camera, microphone or any other type of device for detecting a command from a user. In some examples, a presence-sensitive display includes a touch-sensitive screen.
One or more output devices 46 may also be included in computing device 2. Output device 46, in some examples, is configured to provide output to a user using tactile, audio, or video stimuli. Output device 46, in one example, includes a presence-sensitive display, a sound card, a video graphics adapter card, or any other type of device for converting a signal into an appropriate form understandable to humans or machines. Additional examples of output device 46 include a speaker, a cathode ray tube (CRT) monitor, a liquid crystal display (LCD), or any other type of device that can generate intelligible output to a user.
In some examples, UI device 4 may include functionality of input device 42 and/or output device 46. In one example, UI device 4 may be a touch-sensitive screen. In the example of
Computing device 2 may include operating system 58. Operating system 58, in some examples, controls the operation of components of computing device 2. For example, operating system 58, in one example, facilitates the communication of UI module 6 and/or gesture module 8 with processors 40, communication unit 44, storage device 48, input device 42, and output device 46. UI module 6 and gesture module 8 may each include program instructions and/or data that are executable by computing device 2. As one example, UI module 6 may include instructions that cause computing device 2 to perform one or more of the operations and actions described in the present disclosure.
Computing device 2 may include active beam 54. Active beam 54, in some examples, is configured to store one or more tokens (e.g., one or more word-level tokens and/or phrase-level tokens) generated by gesture module 8. Active beam 54 may be included within storage devices 48. The specific functionality of active beam 54 is further described in the description of
Computing device 2 may also include next beam 56. Next beam 56, in some examples, is configured to store one or more tokens generated by gesture module 8 (e.g., one or more word-level tokens and/or phrase-level tokens). Next beam 56 may be included within storage devices 48. The specific functionality of next beam 56 is further described in the description of
Computing device 2 can include additional components that, for clarity, are not shown in
In accordance with the techniques of this disclosure, computing device 2 may output a graphical keyboard comprising a plurality of keys at output device 46. User 18 may perform a gesture to select a group of keys of the plurality of keys at input device 42. In response to user 18 performing the gesture, input device 42 may detect a gesture path, such as gesture path 22 of
In response to receiving the gesture path data, gesture module 8 may create a token at the entry node of a lexicon which may be included in language model 10. In some examples, language module 10 may be implemented as a trie data structure. Each movable token may represent a partial alignment between a node in the lexicon (i.e., a partial word and/or phrase) and a point along the gesture. As the token advances to child nodes in the lexicon (i.e., next letters in the word and/or next words of a phrase) the corresponding alignment point on the gesture may advance as well. As the token advances to the next letter in a word or to the next word in a phrase, techniques of the disclosure may determine how far the token needs to advance along the gesture path. For instance, techniques of the disclosure may include searching for an alignment point along the gesture that best aligns to a letter of a key, taking into account a number of features described below.
As described in
For each token copy, gesture module 8 may determine, based on a plurality of features associated with the gesture path data, an alignment point traversed by the gesture. In the example of
In some examples, an alignment point may be based on the maximum distance between points of a gesture segment between two or more points and an ideal line from a first key to a second key. An ideal line may be, e.g., a shortest distance path from the first key to the second key. For a better alignment the maximum distance may be small, signifying that the gesture segment does not deviate from the ideal line.
For each alignment point, gesture module 8 may determine respective cost values for each of at least two keys of the plurality of keys. Each of the respective cost values may represent a probability that the alignment point indicates a key of the plurality of keys. In the example of
In some examples, gesture module 8 determines the respective cost values by comparing respective physical cost values with respective lexical cost values, as further described below. In some examples, gesture module 8 may apply one or more weighting factors to the respective physical cost values, and may apply one or more different weighting factors to the respective lexical cost values. For instance, gesture module 8 may determine a cost value by summing the result of multiplying a physical cost value by a physical weighting factor, and multiplying a lexical cost value by a lexical weighting factor.
In some examples, gesture module 8 may determine that one or more lexical weighting factors applied to the one or more lexical cost values should be greater in magnitude than a magnitude of one or more respective physical weighting factors applied to the one or more physical cost values, such as where the gesture path is detected at high rate of speed. For instance, gesture module 8 may determine that a value associated with a feature (e.g., speed) satisfies one or more thresholds, such as when a global speed of the gesture is greater than or equal to a threshold value, less than or equal to a threshold value, etc. In certain examples, gesture module 8 may determine that the physical cost values are unreliable if the determined value satisfies a threshold. In some examples, gesture module 8 may use statistical machine learning to adapt to the style of the user and modify the weighting values over time. For instance, gesture module 8 may, in response to determining that the user is inaccurate while performing gestures, weight the lexical cost values greater than the physical cost values. In some examples, gesture module 8 may determine that the physical cost values should be weighted greater than the lexical cost values. Gesture module 8 may determine that the physical cost values should be weighted greater than the lexical cost values where there is an indication that the lexical cost values may be unreliable, such as where the user has a history of entering words not included in the lexicon. In some examples, the weighting values may be estimated and optimized heuristically, such as by measuring accuracy from a plurality of computing devices.
Gesture module 8 may determine respective physical cost values for each of the at least two keys of the plurality of keys. Each of the respective physical cost values may represent a probability that physical features of an alignment point of the group of alignment points indicate physical features of a key of the plurality of keys. For instance, gesture module 8 may determine the respective physical cost values by evaluating the Euclidian distance between an alignment point of the group of alignment points and a keyboard position of key.
Physical features of the plurality of keys may be included in key regions 52. For example, key regions 52 may include, for each of the plurality of keys, a set of coordinates that correspond to a location and/or area of graphical keyboard 16 where each key is displayed. In the example of
Gesture module 8 may also determine the respective cost values by determining respective lexical cost values for each of the at least two keys of the plurality of keys. Each of the respective lexical cost values may represent a probability that a letter represented by a key of the plurality of keys is included in a candidate word based on the word-level token. The lexical cost values may be based on language model 10. For instance, the lexical cost values may represent the likelihood that a given letter is selected based on probable words included in language model 10. In the example of
Gesture module 8 may determine whether the token is at a terminal node of the lexicon. A terminal node of the lexicon may be a node that represents a complete word included in the lexicon. For instance, in the example of
As such, in response to receiving an indication of a portion of the gesture to select a next key of the plurality of keys, gesture module 8 may create a token copy on each of the word-level token's child nodes to include a predicted character indicated by the received portion of the gesture. In addition, in response to receiving the indication of the portion of the gesture to select the next key of the plurality of keys, gesture module 8 may create a phrase-level token that includes a second word-level token including a second string of predicted characters for which the predicted character is a prefix. Gesture module 8 may determine the phrase-level token as a combination of the first word-level token that represents the candidate word included in the lexicon and the second word-level token. Accordingly, gesture module 8 may incrementally determine one or more candidate words indicated by the gesture and one or more candidate phrases indicated by the gesture in parallel.
As an example, gesture module 8 may receive an indication of portion 22A of gesture path 22. In response, gesture module 8 may determine a first word-level token including the single string of predicted characters “we”. Gesture module 8 may determine one or more candidate words indicated by the gesture using the first word-level token. For instance, gesture module 8 may determine one or more candidate words for which the single string of predicted characters is a prefix, such as the words “were”, “went”, and the like. In addition, gesture module 8 may determine that the first word-level token including the single string of predicted characters “we” represents a candidate word included in the lexicon, such as the word “we” in the English language. In response, gesture module 8 may generate a next-word token that indicates that a next selected key is a prefix of a second word-level token.
In the present example, as the user continues to perform the gesture, gesture module 8 may receive an indication of portion 22B of gesture path 22. In response, gesture module 8 may create a token copy on each of the word-level token's child nodes to include a predicted character indicated by the received portion of the gesture, such as the letter “a” corresponding to a predicted selection of “A” key 20E. As such, gesture module 8 may advance the first word-level token to include the single string of predicted characters “wea”. Based on the first word-level token, gesture module 8 may determine one or more candidate words indicated by the gesture, such as words included in the lexicon for which the single string of predicted characters “wea” is a prefix (e.g., the words “wear”, “weather”, and the like).
In addition, in the present example, gesture module 8 may determine, in response to generating the next-word token that indicates that a next selected key is a prefix of a second word-level token, a second word-level token that includes the predicted character “a” corresponding to the predicted selection of “A” key 20E. In this example, gesture module 8 may determine a phrase-level token as a combination of the first word-level token including the single string of predicted characters “we” and the second word-level token including the single string of predicted characters “a”. Gesture module 8 may determine one or more candidate words for which the single string of predicted characters “a” included in the second word-level token is a prefix, such as the words “are”, “am”, and the like. Gesture module 8 may determine one or more candidate phrases indicated by the gesture as a combination of the first word-level token that represents the candidate word in the lexicon (i.e., the word “we” in the present example) and the one or more candidate words for which the single string of predicted characters included in the second word-level token is a prefix (e.g., the words “are”, “am”, etc.) Gesture module 8 may, in certain examples, determine the one or more candidate phrases indicated by the gesture using the lexical model (e.g., language model 10), such as by determining a probability that a given candidate word associated with the second word-level token follows the candidate word associated with the first word-level token. For instance, in this example, gesture module 8 may determine that a candidate word “are” is more likely to follow the candidate word “we” than the candidate word “am”, as the phrase “we are” may be more have a higher probability in language model 10 than the phrase “we am”.
In certain examples, gesture module 8 may maintain a threshold number of word-level and/or phrase-level tokens (e.g., fifty tokens, one hundred tokens, two hundred tokens, or other numbers of tokens) and discard the rest. For instance, gesture module 8 may maintain a group of the one hundred word-level and/or phrase-level tokens that include the most likely words and/or character strings indicated by the gesture, as determined based on the spatial and language models. In this way, gesture module 8 may efficiently scale to large lexicons.
In some examples, gesture module 8 may select a character string included in the phrase-level token as a committed character string, and may output the committed character string for display at the presence-sensitive display, such as at committed-text region 14 of GUI 12. For example, a user may provide a gesture at graphical keyboard 16 to select a group of keys corresponding to the phrase “this is a delightful keyboard”. In response to receiving the indication of the gesture, gesture module 8 may determine one or more phrase level tokens including a plurality of predicted character strings. Gesture module 8 may determine that a phrase-level token satisfies a threshold, such as a threshold number of word-level tokens included in the phrase-level token. In response to determining that the phrase-level token satisfies the threshold, gesture module 8 may select one or more character strings included in the phrase-level token as committed character strings. For instance, in the present example, gesture module 8 may select the character strings “this is a” as committed character strings. In response, gesture module 8 may remove the one or more committed character strings from the plurality of character strings included in the phrase-level token, and may output the one or more committed character strings for display at committed-text region 14 of GUI 12. In addition, gesture module 8 may output the phrase-level token from which the committed character strings have been removed for display at one or more of text-suggestion regions 24.
For instance, in this example, prior to determining that a phrase-level token including the plurality of predicted character strings “this is a delightful keyboard” satisfies the threshold, gesture module 8 may output the predicted phrase “this is a delightful keyboard” for display at one or more of text-suggestion regions 24. In response to determining that the phrase-level token satisfies the threshold (e.g., determining that a number of word-level tokens included in the phrase-level token satisfies a threshold number, such as five word-level tokens), gesture module 8 may select one or more character strings as committed character strings, such as the character strings “this is a”. In this example, gesture module 8 may remove the character strings “this is a” from the phrase-level token, thereby determining a modified phrase-level token that includes the character strings “delightful keyboard”. Gesture module 8 may output the committed character strings “this is a” for display at committed-text region 14 of GUI 12. In addition, gesture module 8 may output the modified phrase-level token for display at one or more of text-suggestion regions 24, such that the character strings “this is a delightful keyboard” is no longer displayed at text-suggestion regions 24 and the character strings “delightful keyboard” is displayed at one or more of text-suggestion regions 24.
Gesture module 8 may determine whether UI module 6 has completed receiving the gesture path data. Where UI module 6 has completed receiving the gesture path data, gesture module 8 may output one or more candidate words and/or phrases for display at the presence-sensitive display. Where UI module 6 has not completed receiving the gesture path data, gesture module 8 may continue to incrementally process the gesture path data. In some examples, gesture module 8 may output one or more output predictions prior to UI module 6 completing reception of the gesture path data.
As such, according to techniques of this disclosure, gesture module 8 may determine one or more word-level tokens and one or more phrase-level tokens based on a received indication of a gesture to select one or more keys of a graphical keyboard, thereby enabling a user to enter a word or phrase by providing one continuous motion gesture. In addition, by incrementally determining multiple word-level and/or phrase level tokens and advancing the respective tokens as gesture module 8 receives the indication of the gesture to select the group of keys, gesture module 8 may incrementally update its determination of candidate words and/or phrases based on spatial and language models, thereby enabling a more accurate interpretation of the gesture. Moreover, by enabling the user to provide one continuous gesture to enter multi-word phrases, techniques of this disclosure may more effectively recognize ambiguous hyphenated or connected words. For instance, hyphenated or connected words such as “smoke-free” may be included in a lexicon as the single words “smoke” and “free”, or as the hyphenated word “smoke-free”. By enabling a user to provide a single continuous gesture to enter multi-word phrases, techniques described herein may enable the user to provide the single gesture to enter the words without regard to whether the word is hyphenated.
As shown in the example of
In response to detecting gesture path 22A, computing device 2 may determine alignment point 21A along gesture path 22A. Additionally, in response to detecting gesture path 22A, computing device 2 may create a word-level token and push the word-level token into active beam 54A. At time 60, the contents on active beam 54A may be represented by Table 1 below.
In Table 1, each row represents an individual word-level token, the index column represents a unique identifier for each word-level token, the parent index column represents the index value of the word-level token to which the listed word-level token is a child, the letter key of the current node column represent the letter key represented by the current node of the word-level token, the letter chain column represents all of the letter keys represented by the nodes from the entry node to the current node of the word-level token, and the cost value column represent the cost value of the word-level token. As shown in Table 1, the created word-level token has an index of 0 (i.e., word-level tokeno), no parent index, no letter key of the current node, no letter chain, and a cost value of zero.
To determine the text indicated by the gesture, computing device 2 may create a copy of each word-level token on its child nodes. In some examples, an entry node may have 26 child nodes (one for each letter of the English alphabet). For simplicity, in the example of
The entries shown in Table 2 are similar in format to the entry shown in Table 1. In Table 2, word-level token′ has cost value CV1 and word-level token2 has cost value CV2. After creating the word-level token copies, computing device 2 may determine that word-level tokeno is not a terminal node, and may discard word-level tokeno. Computing device 2 may subsequently determine whether active beam 54A is empty (i.e., contains no tokens). In response to determining that active beam 54A is empty, computing device 2 may copy the contents of next beam 56A to active beam 54B of
In the example of
The entries shown in Table 3 are similar in format to the entries shown in Table 1 and Table 2. In Table 3, the cost value for each word-level token includes the cost value for the previous letters and the cost value for the current letter. Computing device 2 may determine which, if any, of the word-level tokens are on terminal nodes. For instance, computing device 2 may determine that word-level token3 is on a terminal node because its string of predicted characters (i.e., its letter chain) “WE” represents a candidate word included in the lexicon (e.g., the English language).
In response to determining that a word-level token is on a terminal node, computing device 2 may copy the word-level token to a list of output predictions. The list of output predictions may be represented by Table 4 below. In some examples, computing device 2 may copy only the letter chain of the token to the list of output predictions.
In addition, computing device 2 may generate, in response to determining that the word-level token is on a terminal node, a next-word token that indicates that a next selected key of the plurality of keys is a prefix of a second word-level token. The next-word token may be considered an entry node of the second word-level token. Computing device 2 may push the next-word token (i.e., the entry node of the second word-level token) into active beam 54B, the contents of which may be represented by Table 5 below.
The entries shown in Table 5 are similar in format to the entries shown in Tables 1, 2, and 3. As shown in Table 5, the created word-level token corresponding to the next-word token has an index of 7 (i.e., word-level token7), a parent index of 3 (i.e., corresponding to word-level token3), no letter key of the current node, no letter chain, and a cost value of zero. In certain examples, the combination of word-level token3 and word-level token7 may be considered a phrase-level token that includes a plurality of character strings.
In the example of
The entries shown in Table 6 are similar in format to the entries shown in Tables 1-3. In Table 6, the cost value for each word-level token includes the cost value for the previous letters and the cost value for the current letter. In addition, the cost value for each phrase-level token (i.e., phrase-level token's and phrase-level token19) includes the cost value for the previous letters of the each previous word-level token, the cost value for each previous letter in the current word-level token, and the cost value for the current letter of the current word-level token. As such, computing device 2 may determine one or more phrase-level tokens based at least in part on a word-level token that represents a candidate word included in the lexicon and a predicted selection of a character key. In such a way, computing device 2 may determine both word-level tokens and phrase-level tokens in response to receiving an indication of a gesture to select a group of keys included in a graphical keyboard. Computing device 2 may continue to incrementally determine the one or more word-level tokens and one or more phrase-level tokens as computing device 2 receives further indications of the gesture, thereby enabling a user to provide a single gesture to select a group of keys of a word or phrase.
In the example of
In the example of
Computing device 2 may select a word-level token from the active beam (78). Computing device 2 may create a copy of the word-level token on each child node of the word-level token (80). Computing device 2 may select a word-level token copy (82) and determine an alignment point along the gesture (84). Computing device 2 may determine a cost value representing a probability that the alignment point indicates the letter key of the node on which the word-level token copy is positioned and add the cost value to the word-level token copy (86). Computing device 2 may push the word-level token copy into a next beam (88). Computing device 2 may determine whether there are any word-level token copies remaining (90). If there are word-level token copies remaining (94), computing device 2 may select a new word-level token copy (82).
If there are not any word-level token copies remaining (92), computing device 2 may determine whether the word-level token is at a terminal node of the lexicon trie (96). For instance, gesture module 8 may use language model 10 to determine whether the word-level token represents a candidate word included in a lexicon (e.g., the English language). If the word-level token is at a terminal node (98), computing device 2 may copy the word represented by the word-level token to a list of candidate words (102), and may generate a next-word token that indicates that a next selected key of the plurality of keys of the graphical keyboard is a prefix of a second word-level token (103). After copying the word to the list of candidate words and generating the next-word token, or if the word-level token is not at a terminal node (100), computing device 2 may discard the word-level token (104).
Computing device 2 may determine whether any word-level tokens remain in the active beam (106). If there are word-level tokens remaining in the active beam (110), computing device 2 may select a new word-level token from the active beam (78). If there are no word-level tokens remaining in the active beam (108), computing device 2 may determine whether any word-level tokens remain in the next beam (112). If there are word-level tokens remaining in the next beam (114), computing device 2 may copy the next beam to the active beam (120) and select a new word-level token from the active beam (78). If there are no word-level tokens remaining in the next beam (116), computing device 2 may output the list of candidate words at the presence-sensitive display (118).
In the example of
Computing device 2 may determine, based at least in part on the first key, a word-level token comprising a single string of a plurality of predicted characters (134). As an example, gesture module 8, executing on one or more processors 40, may determine a word-level token including the single string “we” based at least in part on “E” key 20C. Computing device 2 may determine that the word-level token represents a candidate word included in a lexicon (136). For instance, gesture module 8 may determine that the word-level token including the single string “we” represents the candidate word “we” included in a lexicon (e.g., the English language) of language model 10.
Computing device 2 may determine, in response to determining that the word-level token represents the candidate word in the lexicon, a phrase-level token based at least in part on the word-level token and the second key (138). The phrase-level token may include a plurality of character strings. For example, gesture module 8 may determine a phrase-level token as the plurality of character strings “we” and “a”, based at least in part on the word-level token “we” and “A” key 20E.
In one example, the operations include determining, by computing device 2 and in response to determining the phrase-level token, a candidate phrase based at least in part on the phrase-level token; and outputting, by computing device 2, the candidate phrase for display at the presence-sensitive display. In one example, the plurality of character strings of the phrase-level token comprises a first character string and a second character string, wherein the word-level token comprises the first character string, and wherein the second character string comprises a character associated with the second key. In one example, the second character string begins with the character associated with the second key.
In one example, the word-level token comprises a first word-level token comprising a first single string of the plurality of predicted characters, the operations further comprising determining, by the computing device and based at least in part on the first key and the second key, a second word-level token comprising a second single string of the plurality of predicted characters. In one example, the word-level token is a first word-level token comprising a first single string of the plurality of predicted characters, and determining the phrase-level token comprises: generating, in response to determining that the first word-level token represents the candidate word in the lexicon, a next-word token that indicates that a next selected key of the plurality of keys is a prefix of a second word-level token; determining, in response to determining the next-word token, a second word-level token comprising a second single string of the plurality of predicted characters, wherein the second key is a prefix of the second word-level token; and determining the phrase-level token as a combination of the first word-level token and the second word-level token.
In one example, determining the phrase-level token further includes: determining, based on a plurality of features associated with the gesture, a group of alignment points traversed by the gesture; determining respective cost values for each of at least the first key, the second key, and a third key, wherein each of the respective cost values represents a probability that an alignment point of the group of alignment points indicates a key of the plurality of keys; determining a first combined cost value based at least in part on the determined cost value for the first key and the determined cost value for the second key; determining a second combined cost value based at least in part on the determined cost value for the first key and the determined cost value for the third key; comparing the first combined cost value and the second combined cost value; and determining the second word-level token based on the comparison of the first combined cost value and the second combined cost value.
In one example, the plurality of features associated with the gesture comprises at least one of: a length of a segment of the gesture, wherein the segment comprises a path traversed by the gesture at the presence-sensitive display; a direction of the segment of the gesture; a curvature of the segment of the gesture; a local speed that represents a rate at which the segment of the gesture was detected; and a global speed that represents a rate at which the gesture was detected. In one example, determining the respective cost values for each of at least the first key, the second key, and the third key comprises: determining respective physical cost values for each of at least the first key, the second key, and the third key, wherein each of the respective physical cost values represents a probability that at least one physical feature of an alignment point of the group of alignment points indicates at least one physical feature of a key of the plurality of keys; determining respective lexical cost values for each of at least the first key, the second key, and the third key, wherein each of the respective lexical cost values represents a probability that a letter represented by a key of the plurality of keys is included in a candidate word; and determining the respective cost values for each of at least the first key, the second key, and the third key based on the respective physical cost values and the respective lexical cost values for each of at least the first key, the second key, and the third key.
In one example, determining the respective physical cost values for each of at least the first key, the second key, and the third key comprises comparing key regions of each of at least the first key, the second key, and the third key with at least one of the plurality of features associated with the gesture, wherein the key regions comprise locations of the presence-sensitive display that output the respective keys. In one example, determining the respective lexical cost values for each of at least the first key, the second key, and the third key comprises comparing each of at least the first key, the second key, and the third key with a language model. In one example, the language model comprises an n-gram language model. In one example, language model comprises a group of predefined phrases.
In one example, the phrase-level token is a first phrase-level token comprising a first plurality of character strings, and the operations further include: determining, by computing device 2, that the first phrase-level token satisfies a threshold; responsive to determining that the first phrase-level token satisfies the threshold, selecting, by computing device 2, a character string of the first plurality of character strings of the first phrase-level token as a committed character string; and removing, by computing device 2, the committed character string from the first plurality of character strings of the phrase-level token to determine a second phrase-level token comprising a second plurality of character strings.
In one example, the operations further include: outputting, by computing device 2, the first phrase-level token for display at a text-suggestion region of the presence-sensitive display; and responsive to determining that the first phrase-level token satisfies the threshold: outputting, by computing device 2, the committed character string for display at a committed-text region of the presence-sensitive display, wherein the committed-text region is different than the text-suggestion region; and outputting, by computing device 2, the second plurality of character strings for display at the text-suggestion region. In one example, determining that the first phrase-level token satisfies the threshold comprises determining that a number of character strings of the first plurality of character strings satisfies a threshold number of character strings. In one example, receiving the indication of the gesture comprises receiving an indication of a motion of an input unit from a first location of the presence-sensitive display to a second location of the presence-sensitive display with substantially constant contact between the input unit and the presence-sensitive display. In one example, the lexicon is implemented, by computing device 2, as a trie data structure.
As shown in the example of
In other examples, such as illustrated previously in
Presence-sensitive display 144, as shown in
As shown in
Projector screen 162, in some examples, may include a presence-sensitive display 164. Presence-sensitive display 164 may include a subset of functionality or all of the functionality of UI device 4 as described in this disclosure. In some examples, presence-sensitive display 164 may include additional functionality. Projector screen 162 (e.g., an electronic whiteboard), may receive data from computing device 140 and display the graphical content. In some examples, presence-sensitive display 164 may determine one or more user inputs (e.g., continuous gestures, multi-touch gestures, single-touch gestures, etc.) at projector screen 162 using capacitive, inductive, and/or optical recognition techniques and send indications of such user input using one or more communication units to computing device 140.
As described above, in some examples, computing device 140 may output graphical content for display at presence-sensitive display 144 that is coupled to computing device 140 by a system bus or other suitable communication channel. Computing device 140 may also output graphical content for display at one or more remote devices, such as projector 160, projector screen 162, tablet device 166, and visual display device 170. For instance, computing device 140 may execute one or more instructions to generate and/or modify graphical content in accordance with techniques of the present disclosure. Computing device 140 may output the data that includes the graphical content to a communication unit of computing device 140, such as communication unit 150. Communication unit 150 may send the data to one or more of the remote devices, such as projector 160, projector screen 162, tablet device 166, and/or visual display device 170. In this way, computing device 140 may output the graphical content for display at one or more of the remote devices. In some examples, one or more of the remote devices may output the graphical content at a presence-sensitive display that is included in and/or operatively coupled to the respective remote devices.
In some examples, computing device 140 may not output graphical content at presence-sensitive display 144 that is operatively coupled to computing device 140. In other examples, computing device 140 may output graphical content for display at both a presence-sensitive display 144 that is coupled to computing device 140 by communication channel 142A, and at one or more remote devices. In such examples, the graphical content may be displayed substantially contemporaneously at each respective device. For instance, some delay may be introduced by the communication latency to send the data that includes the graphical content to the remote device. In some examples, graphical content generated by computing device 140 and output for display at presence-sensitive display 144 may be different than graphical content display output for display at one or more remote devices.
Computing device 140 may send and receive data using any suitable communication techniques. For example, computing device 140 may be operatively coupled to external network 154 using network link 152A. Each of the remote devices illustrated in
In some examples, computing device 140 may be operatively coupled to one or more of the remote devices included in
In accordance with techniques of the disclosure, computing device 140 may be operatively coupled to visual display device 170 using external network 154. Computing device 140 may output a graphical keyboard for display at presence-sensitive display 172. For instance, computing device 140 may send data that includes a representation of the graphical keyboard to communication unit 150. Communication unit 150 may send the data that includes the representation of the graphical keyboard to visual display device 170 using external network 154. Visual display device 170, in response to receiving the data using external network 154, may cause presence-sensitive display 172 to output the graphical keyboard. In response to a user performing a first portion of a gesture at presence-sensitive display 172 to select a first key of the keyboard, visual display device 170 may send an indication of the gesture to computing device 140 using external network 154. Communication unit 150 may receive the indication of the gesture, and send the indication to computing device 140. Similarly, in response to a user performing a second portion of the gesture at presence-sensitive display 172 to select a second key of the keyboard, visual display device 170 may send an indication of the gesture to computing device 140 using external network 154.
Computing device 140 may determine, based at least in part on the first key, a word-level token including a single string of a plurality of predicted characters. In some examples, computing device 140 may determine that the word-level token represents a candidate work included in a lexicon. In response to determining that the word-level token represents the candidate work in the lexicon, computing device 140 may determine a phrase-level token based at least in part on the word-level token and the second key. The phrase-level token may include a plurality of character strings. In certain examples, computing device 140 may determine a candidate phrase based at least in part on the phrase-level token. Computing device 140, in some examples, may send data that includes the candidate phrase to communication unit 150, which in turn sends the data to visual display device 170 using external network 154. Upon receiving the data, visual display device 170 may cause presence-sensitive display 172 to display the candidate phrase. In this way, computing device 140 may output the candidate phrase for display at presence-sensitive screen 172, in accordance with techniques of the disclosure.
The techniques described in this disclosure may be implemented, at least in part, in hardware, software, firmware, or any combination thereof. For example, various aspects of the described techniques may be implemented within one or more processors, including one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or any other equivalent integrated or discrete logic circuitry, as well as any combinations of such components. The term “processor” or “processing circuitry” may generally refer to any of the foregoing logic circuitry, alone or in combination with other logic circuitry, or any other equivalent circuitry. A control unit including hardware may also perform one or more of the techniques of this disclosure.
Such hardware, software, and firmware may be implemented within the same device or within separate devices to support the various techniques described in this disclosure. In addition, any of the described units, modules or components may be implemented together or separately as discrete but interoperable logic devices. Depiction of different features as modules or units is intended to highlight different functional aspects and does not necessarily imply that such modules or units must be realized by separate hardware, firmware, or software components. Rather, functionality associated with one or more modules or units may be performed by separate hardware, firmware, or software components, or integrated within common or separate hardware, firmware, or software components.
The techniques described in this disclosure may also be embodied or encoded in an article of manufacture including a computer-readable storage medium encoded with instructions. Instructions embedded or encoded in an article of manufacture including a computer-readable storage medium encoded, may cause one or more programmable processors, or other processors, to implement one or more of the techniques described herein, such as when instructions included or encoded in the computer-readable storage medium are executed by the one or more processors. Computer readable storage media may include random access memory (RAM), read only memory (ROM), programmable read only memory (PROM), erasable programmable read only memory (EPROM), electronically erasable programmable read only memory (EEPROM), flash memory, a hard disk, a compact disc ROM (CD-ROM), a floppy disk, a cassette, magnetic media, optical media, or other computer readable media. In some examples, an article of manufacture may include one or more computer-readable storage media.
In some examples, a computer-readable storage medium may include a non-transitory medium. The term “non-transitory” may indicate that the storage medium is not embodied in a carrier wave or a propagated signal. In certain examples, a non-transitory storage medium may store data that can, over time, change (e.g., in RAM or cache).
Various examples have been described. These and other examples are within the scope of the following claims.
This application is a continuation of U.S. application Ser. No. 15/264,876, filed Sep. 14, 2016, which is a continuation of U.S. application Ser. No. 14/851,759, filed Sep. 11, 2015, which is a continuation of U.S. application Ser. No. 14/196,552, filed Mar. 4, 2014, which is a continuation of U.S. application Ser. No. 13/787,513, filed Mar. 6, 2013, which claims the benefit of U.S. Provisional Application No. 61/714,696, filed Oct. 16, 2012, the entire contents of each of which are hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4534261 | Fabrizio | Aug 1985 | A |
| 4833610 | Zamora et al. | May 1989 | A |
| 4847766 | McRae et al. | Jul 1989 | A |
| 4988981 | Zimmerman et al. | Jan 1991 | A |
| 5075896 | Wilcox et al. | Dec 1991 | A |
| 5115482 | Stallard et al. | May 1992 | A |
| 5202803 | Albrecht et al. | Apr 1993 | A |
| 5307267 | Yang | Apr 1994 | A |
| 5319747 | Gerrissen et al. | Jun 1994 | A |
| 5440070 | Okamoto et al. | Aug 1995 | A |
| 5502803 | Yoshida et al. | Mar 1996 | A |
| 5521986 | Curtin, II et al. | May 1996 | A |
| 5593541 | Wong et al. | Jan 1997 | A |
| 5606494 | Oshima et al. | Feb 1997 | A |
| 5677710 | Thompson-Rohrlich | Oct 1997 | A |
| 5684873 | Tiilikainen | Nov 1997 | A |
| 5717939 | Bricklin et al. | Feb 1998 | A |
| 5748512 | Vargas | May 1998 | A |
| 5761689 | Rayson et al. | Jun 1998 | A |
| 5765180 | Travis | Jun 1998 | A |
| 5781179 | Nakajima et al. | Jul 1998 | A |
| 5784504 | Anderson et al. | Jul 1998 | A |
| 5805167 | Van Cruyningen | Sep 1998 | A |
| 5845306 | Schabes et al. | Dec 1998 | A |
| 5848187 | Bricklin et al. | Dec 1998 | A |
| 5903229 | Kishi | May 1999 | A |
| 5905246 | Fajkowski | May 1999 | A |
| 5917493 | Tan et al. | Jun 1999 | A |
| 5953541 | King et al. | Sep 1999 | A |
| 6008799 | Van Kleeck | Dec 1999 | A |
| 6032053 | Schroeder et al. | Feb 2000 | A |
| 6041292 | Jochim | Mar 2000 | A |
| 6047300 | Walfish | Apr 2000 | A |
| 6057845 | Dupouy | May 2000 | A |
| 6061050 | Allport et al. | May 2000 | A |
| 6072473 | Muller et al. | Jun 2000 | A |
| 6094188 | Horton et al. | Jul 2000 | A |
| 6115482 | Sears et al. | Sep 2000 | A |
| 6131102 | Potter | Oct 2000 | A |
| 6150600 | Buchla | Nov 2000 | A |
| 6160555 | Kang et al. | Dec 2000 | A |
| 6278453 | Bodnar | Aug 2001 | B1 |
| 6286064 | King et al. | Sep 2001 | B1 |
| 6292179 | Lee | Sep 2001 | B1 |
| 6310634 | Bodnar et al. | Oct 2001 | B1 |
| 6340979 | Beaton et al. | Jan 2002 | B1 |
| RE37654 | Longo | Apr 2002 | E |
| 6396523 | Segal et al. | May 2002 | B1 |
| 6407679 | Evans et al. | Jun 2002 | B1 |
| 6417874 | Bodnar | Jul 2002 | B2 |
| 6424983 | Schabes et al. | Jul 2002 | B1 |
| 6438523 | Oberteuffer et al. | Aug 2002 | B1 |
| 6512838 | Rafii et al. | Jan 2003 | B1 |
| 6542170 | Williams et al. | Apr 2003 | B1 |
| 6570557 | Westerman et al. | May 2003 | B1 |
| 6573844 | Venolia et al. | Jun 2003 | B1 |
| 6630924 | Peck | Oct 2003 | B1 |
| 6674895 | Rafii et al. | Jan 2004 | B2 |
| 6686931 | Bodnar | Feb 2004 | B1 |
| 6789231 | Reynar et al. | Sep 2004 | B1 |
| 6801190 | Robinson et al. | Oct 2004 | B1 |
| 6983247 | Ringger et al. | Jan 2006 | B2 |
| 7028259 | Jacobson | Apr 2006 | B1 |
| 7030863 | Longe et al. | Apr 2006 | B2 |
| 7042443 | Woodard et al. | May 2006 | B2 |
| 7075520 | Williams | Jul 2006 | B2 |
| 7088345 | Robinson et al. | Aug 2006 | B2 |
| 7098896 | Kushler et al. | Aug 2006 | B2 |
| 7145554 | Bachmann | Dec 2006 | B2 |
| 7151530 | Roeber et al. | Dec 2006 | B2 |
| 7170430 | Goodgoll | Jan 2007 | B2 |
| 7199786 | Suraqui | Apr 2007 | B2 |
| 7207004 | Harrity | Apr 2007 | B1 |
| 7231343 | Treadgold et al. | Jun 2007 | B1 |
| 7250938 | Kirkland et al. | Jul 2007 | B2 |
| 7251367 | Zhai | Jul 2007 | B2 |
| 7269019 | Hirata et al. | Sep 2007 | B2 |
| 7277088 | Robinson et al. | Oct 2007 | B2 |
| 7296019 | Chandrasekar et al. | Nov 2007 | B1 |
| 7336827 | Geiger et al. | Feb 2008 | B2 |
| 7366983 | Brill et al. | Apr 2008 | B2 |
| 7382358 | Kushler et al. | Jun 2008 | B2 |
| 7453439 | Kushler et al. | Nov 2008 | B1 |
| 7479949 | Jobs et al. | Jan 2009 | B2 |
| 7487461 | Zhai et al. | Feb 2009 | B2 |
| 7508324 | Suraqui | Mar 2009 | B2 |
| 7542029 | Kushler | Jun 2009 | B2 |
| 7706616 | Kristensson | Apr 2010 | B2 |
| 7716579 | Gunn et al. | May 2010 | B2 |
| 7730402 | Song | Jun 2010 | B2 |
| 7750891 | Stephanick et al. | Jul 2010 | B2 |
| 7809719 | Furuuchi et al. | Oct 2010 | B2 |
| 7831423 | Schubert | Nov 2010 | B2 |
| 7880730 | Robinson et al. | Feb 2011 | B2 |
| 7886233 | Rainisto et al. | Feb 2011 | B2 |
| 7895518 | Kristensson | Feb 2011 | B2 |
| 7907125 | Weiss et al. | Mar 2011 | B2 |
| 7920132 | Longe et al. | Apr 2011 | B2 |
| 7921361 | Gunn et al. | Apr 2011 | B2 |
| 7973770 | Tokkonen | Jul 2011 | B2 |
| 8036878 | Assadollahi | Oct 2011 | B2 |
| 8059101 | Westerman et al. | Nov 2011 | B2 |
| 8135582 | Suraqui | Mar 2012 | B2 |
| 8232972 | Huang et al. | Jul 2012 | B2 |
| 8232973 | Kocienda et al. | Jul 2012 | B2 |
| 8266528 | Hayes | Sep 2012 | B1 |
| 8280886 | Labrou et al. | Oct 2012 | B2 |
| 8359543 | Sengupta | Jan 2013 | B2 |
| 8438160 | Aravamudan et al. | May 2013 | B2 |
| 8504349 | Manu et al. | Aug 2013 | B2 |
| 8514178 | Song et al. | Aug 2013 | B2 |
| 8542206 | Westerman et al. | Sep 2013 | B2 |
| 8552984 | Knaven | Oct 2013 | B2 |
| 8587542 | Moore | Nov 2013 | B2 |
| 8619048 | Shimoni | Dec 2013 | B2 |
| 8667414 | Zhai et al. | Mar 2014 | B2 |
| 8701032 | Zhai et al. | Apr 2014 | B1 |
| 8782549 | Ouyang et al. | Jul 2014 | B2 |
| 8819574 | Ouyang et al. | Aug 2014 | B2 |
| 8843845 | Ouyang et al. | Sep 2014 | B2 |
| 8850350 | Bi et al. | Sep 2014 | B2 |
| 9021380 | Zhai et al. | Apr 2015 | B2 |
| 9134906 | Zhai et al. | Sep 2015 | B2 |
| 9542385 | Zhai et al. | Jan 2017 | B2 |
| 9710453 | Ouyang et al. | Jul 2017 | B2 |
| 10019435 | Ouyang et al. | Jul 2018 | B2 |
| 20020013794 | Carro et al. | Jan 2002 | A1 |
| 20020015064 | Robotham et al. | Feb 2002 | A1 |
| 20020129012 | Green | Sep 2002 | A1 |
| 20020143543 | Sirivara | Oct 2002 | A1 |
| 20020194223 | Meyers et al. | Dec 2002 | A1 |
| 20030006967 | Pihlaja | Jan 2003 | A1 |
| 20030095053 | Kandogan et al. | May 2003 | A1 |
| 20030095104 | Kandogan et al. | May 2003 | A1 |
| 20030097252 | Mackie | May 2003 | A1 |
| 20030165801 | Levy | Sep 2003 | A1 |
| 20040120583 | Zhai | Jun 2004 | A1 |
| 20040140956 | Kushler et al. | Jul 2004 | A1 |
| 20050052406 | Stephanick et al. | Mar 2005 | A1 |
| 20050114115 | Karidis et al. | May 2005 | A1 |
| 20050146508 | Kirkland et al. | Jul 2005 | A1 |
| 20050171783 | Suominen | Aug 2005 | A1 |
| 20050190973 | Kristensson et al. | Sep 2005 | A1 |
| 20060004638 | Royal et al. | Jan 2006 | A1 |
| 20060026536 | Hotelling et al. | Feb 2006 | A1 |
| 20060028450 | Suraqui | Feb 2006 | A1 |
| 20060050962 | Geiger et al. | Mar 2006 | A1 |
| 20060053387 | Ording | Mar 2006 | A1 |
| 20060055669 | Das | Mar 2006 | A1 |
| 20060119582 | Ng et al. | Jun 2006 | A1 |
| 20060173674 | Nakajima et al. | Aug 2006 | A1 |
| 20060176283 | Suraqui | Aug 2006 | A1 |
| 20060253793 | Zhai et al. | Nov 2006 | A1 |
| 20060256139 | Gikandi | Nov 2006 | A1 |
| 20060265648 | Rainisto et al. | Nov 2006 | A1 |
| 20070016862 | Kuzmin | Jan 2007 | A1 |
| 20070040813 | Kushler et al. | Feb 2007 | A1 |
| 20070055933 | Dejean et al. | Mar 2007 | A1 |
| 20070083276 | Song | Apr 2007 | A1 |
| 20070089070 | Jaczyk | Apr 2007 | A1 |
| 20070094024 | Kristensson et al. | Apr 2007 | A1 |
| 20070152980 | Kocienda et al. | Jul 2007 | A1 |
| 20070213983 | Ramsey | Sep 2007 | A1 |
| 20080017722 | Snyder et al. | Jan 2008 | A1 |
| 20080100579 | Robinson et al. | May 2008 | A1 |
| 20080122796 | Jobs et al. | May 2008 | A1 |
| 20080167858 | Christie et al. | Jul 2008 | A1 |
| 20080172293 | Raskin et al. | Jul 2008 | A1 |
| 20080229255 | Linjama et al. | Sep 2008 | A1 |
| 20080232885 | Mock et al. | Sep 2008 | A1 |
| 20080240551 | Zitnick et al. | Oct 2008 | A1 |
| 20080270896 | Kristensson | Oct 2008 | A1 |
| 20080316183 | Westerman et al. | Dec 2008 | A1 |
| 20090058823 | Kocienda | Mar 2009 | A1 |
| 20090077464 | Goldsmith et al. | Mar 2009 | A1 |
| 20090100338 | Saetti | Apr 2009 | A1 |
| 20090100383 | Sunday et al. | Apr 2009 | A1 |
| 20090119376 | Bomma | May 2009 | A1 |
| 20090189864 | Walker et al. | Jul 2009 | A1 |
| 20090249198 | Davis et al. | Oct 2009 | A1 |
| 20100021871 | Layng et al. | Jan 2010 | A1 |
| 20100029910 | Shiba et al. | Feb 2010 | A1 |
| 20100070908 | Mori et al. | Mar 2010 | A1 |
| 20100079382 | Suggs | Apr 2010 | A1 |
| 20101179382 | Suggs | Apr 2010 | |
| 20100125594 | Li et al. | May 2010 | A1 |
| 20100131447 | Creutz et al. | May 2010 | A1 |
| 20100141484 | Griffin | Jun 2010 | A1 |
| 20100179382 | Shelton, IV et al. | Jul 2010 | A1 |
| 20100199226 | Nurmi | Aug 2010 | A1 |
| 20100235780 | Westerman et al. | Sep 2010 | A1 |
| 20100238125 | Ronkainen et al. | Sep 2010 | A1 |
| 20100257478 | Longe et al. | Oct 2010 | A1 |
| 20100259493 | Chang et al. | Oct 2010 | A1 |
| 20100271299 | Stephanick et al. | Oct 2010 | A1 |
| 20100315266 | Gunawardana et al. | Dec 2010 | A1 |
| 20110010174 | Longe et al. | Jan 2011 | A1 |
| 20110061017 | Ullrich et al. | Mar 2011 | A1 |
| 20110063224 | Vexo et al. | Mar 2011 | A1 |
| 20110063231 | Jakobs et al. | Mar 2011 | A1 |
| 20110066984 | Li | Mar 2011 | A1 |
| 20110071834 | Kristensson et al. | Mar 2011 | A1 |
| 20110103682 | Chidlovskii et al. | May 2011 | A1 |
| 20110107206 | Walsh et al. | May 2011 | A1 |
| 20110119617 | Kristensson et al. | May 2011 | A1 |
| 20110122081 | Kushler | May 2011 | A1 |
| 20110141027 | Ghassabian | Jun 2011 | A1 |
| 20110141031 | McCullough et al. | Jun 2011 | A1 |
| 20110179380 | Shaffer et al. | Jul 2011 | A1 |
| 20110179386 | Shaffer et al. | Jul 2011 | A1 |
| 20110179387 | Shaffer et al. | Jul 2011 | A1 |
| 20110181526 | Shaffer et al. | Jul 2011 | A1 |
| 20110193797 | Unruh | Aug 2011 | A1 |
| 20110202834 | Mandryk et al. | Aug 2011 | A1 |
| 20110202836 | Badger et al. | Aug 2011 | A1 |
| 20110205160 | Song et al. | Aug 2011 | A1 |
| 20110208511 | Sikstrom et al. | Aug 2011 | A1 |
| 20110208513 | Nicks et al. | Aug 2011 | A1 |
| 20110209088 | Hinckley et al. | Aug 2011 | A1 |
| 20110210850 | Tran | Sep 2011 | A1 |
| 20110234524 | Longe et al. | Sep 2011 | A1 |
| 20110242000 | Bi et al. | Oct 2011 | A1 |
| 20110254798 | Adamson et al. | Oct 2011 | A1 |
| 20110291940 | Ghassabian | Dec 2011 | A1 |
| 20120011462 | Westerman et al. | Jan 2012 | A1 |
| 20120029910 | Medlock et al. | Feb 2012 | A1 |
| 20120036468 | Colley | Feb 2012 | A1 |
| 20120036469 | Suraqui | Feb 2012 | A1 |
| 20120036485 | Watkins, Jr. et al. | Feb 2012 | A1 |
| 20120046544 | Inoue | Feb 2012 | A1 |
| 20120336469 | Suraqui | Feb 2012 | |
| 20120075190 | Sengupta | Mar 2012 | A1 |
| 20120079412 | Kocienda et al. | Mar 2012 | A1 |
| 20120098846 | Wun et al. | Apr 2012 | A1 |
| 20120113008 | Makinen et al. | May 2012 | A1 |
| 20120127080 | Kushler et al. | May 2012 | A1 |
| 20120127082 | Kushler et al. | May 2012 | A1 |
| 20120131035 | Yang | May 2012 | A1 |
| 20120131514 | Ansell et al. | May 2012 | A1 |
| 20120162092 | Pasquero et al. | Jun 2012 | A1 |
| 20120166428 | Kakade et al. | Jun 2012 | A1 |
| 20120223889 | Medlock et al. | Sep 2012 | A1 |
| 20120242579 | Chua | Sep 2012 | A1 |
| 20120259615 | Morin et al. | Oct 2012 | A1 |
| 20120274745 | Russell | Nov 2012 | A1 |
| 20120290946 | Schrock et al. | Nov 2012 | A1 |
| 20120310626 | Kida et al. | Dec 2012 | A1 |
| 20130046544 | Kay et al. | Feb 2013 | A1 |
| 20130074014 | Ouyang et al. | Mar 2013 | A1 |
| 20130082824 | Colley | Apr 2013 | A1 |
| 20130120266 | Griffin et al. | May 2013 | A1 |
| 20130120430 | Li et al. | May 2013 | A1 |
| 20130125034 | Griffin et al. | May 2013 | A1 |
| 20130135209 | Zhai et al. | May 2013 | A1 |
| 20130176228 | Griffin et al. | Jul 2013 | A1 |
| 20130205242 | Colby | Aug 2013 | A1 |
| 20130212515 | Eleftheriou | Aug 2013 | A1 |
| 20130332822 | Willmore et al. | Dec 2013 | A1 |
| 20140098023 | Zhai et al. | Apr 2014 | A1 |
| 20140201671 | Zhai et al. | Jul 2014 | A1 |
| 20140344748 | Ouyang et al. | Nov 2014 | A1 |
| 20150012873 | Bi et al. | Jan 2015 | A1 |
| 20150026628 | Ouyang et al. | Jan 2015 | A1 |
| 20170003869 | Zhai et al. | Jan 2017 | A1 |
| 20170206193 | Bi et al. | Jul 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 1133996 | Oct 1996 | CN |
| 1761989 | Apr 2006 | CN |
| 100472600 | Mar 2009 | CN |
| 101382844 | Mar 2009 | CN |
| 101390039 | Mar 2009 | CN |
| 101393506 | Mar 2009 | CN |
| 101689189 | Mar 2010 | CN |
| 10178855 | Jul 2010 | CN |
| 102411477 | Apr 2012 | CN |
| 102508553 | Jun 2012 | CN |
| 102541304 | Jul 2012 | CN |
| 102576255 | Jul 2012 | CN |
| 102629158 | Aug 2012 | CN |
| 102693090 | Sep 2012 | CN |
| 0844570 | May 1998 | EP |
| 1603014 | Jul 2005 | EP |
| 1860576 | Nov 2007 | EP |
| 1887451 | Jun 2009 | EP |
| 2369446 | Sep 2011 | EP |
| 201040793 | Nov 2010 | TW |
| WO 2004066075 | Aug 2004 | WO |
| WO 2005064587 | Jul 2005 | WO |
| WO 2007017660 | Feb 2007 | WO |
| WO 2007035827 | Mar 2007 | WO |
| WO 2008013658 | Jan 2008 | WO |
| WO 2011113057 | Sep 2011 | WO |
| WO 2013107998 | Jul 2013 | WO |
| 2014062588 | Apr 2014 | WO |
| Entry |
|---|
| Notification of Reexamination, and translation thereof, from counterpart Chinese Application No. 201380054132.6, dated Sep. 29, 2017, 19 pp. |
| “7 Swype keyboard tips for better Swyping,” by Ed Rhee, found at http://howto.cnel.com/8301- 1131 0_39-20070627-285/7-swype-keyboard-lips-for-belter-swyping/, posted Jun. 14, 2011, 5 pp. |
| “Advanced tips for Swype,” found at www.swype.com/lips/advanced-lips/, downloaded Aug. 20, 2012, 3 pp. |
| “How to Type Faster with the Swype Keyboard for Android-How-To Geek.” found at www.howtogeek.com/106643/ how-to-type-faster-with-the-swype-keyboard-for-android/, downloaded Jun. 4, 2012, 13 pp. |
| “Keymonk Keyboard Free-Android Apps on Google Play, Description,” found at https://play.google.com/store/apps/delails?id=com.keymonk.latin&hl=en, downloaded Oct. 3, 2012, 2 pp. |
| “Keymonk Keyboard Free-Android Apps on Google Play, Permissions,” found at https://play.google.com/store/apps/details?id=com.keymonk.latin&hl=en, downloaded Oct. 3, 2012, 2 pp. |
| “Keymonk Keyboard Free-Android Apps on Google Play. User Reviews,” found at https://play.google.com/store/apps/details?id=com.keymonk.latin&hl=en, downloaded Oct. 3, 2012, 2 pp. |
| “Keymonk—The Future of Smartphone Keyboards,” found at www.keymonk.com, downloaded Sep. 5, 2012, 2 pp. |
| “Nuance Supercharges Swype, Adds New Keyboard Options, XT9 Predictive Text, and Dragon-Powered Voice Input,” found at http://techcrunch.com/2012/06/20/nuance-supercharges-swype- adds-new-keyboard-options-xt9-predictive-text-and-dragon-powered-voice-input/, downloaded Jun. 4, 2012, 2 pp. |
| “Sensory Software-Text Chat, found at www.sensorysoftware.com/textchat.html,” downloaded Jun. 4, 2012, 3 pp. |
| “ShapeWriter Keyboard allows you to input on Android the same experience with on PC, Android forums,” found at talkandroid.com/ .../2767-shapewriter-keyboard-allows-you-input-android-same- experience-pc.html, last updated Oct. 25, 2009, 3 pp. |
| “ShapeWriter Research Project home page,” accessed May 25, 2012, found at http://www.almaden.ibm.com/u/zhai/shapewriter_research.html, 12 pp. |
| “ShapeWriter vs Swype Keyboard, DroidForums.net,” found at www.droidforums.net/forum/droid-applications/48707- shapewriter-vs-swype-keyboard.html, last updated Jun. 1, 2010, 5 pp. |
| “SlideiT Soft Keyboard”, SlideiT [online]. First accessed on Jan. 31, 2012. retrieved from the Internet: https://play.google.com/store/apps/details?id=com.dasur.slideit.vt.lite&hl=en, 4 pp. |
| “Split Keyboard for iPad [Concept],” by Skipper Eye, Apr. 23, 2010, found at http://www.redmondpie.com/splil- keyboard-for-ipad-9140675/, 6 pp. |
| “Split Keyboard for Thumb Typing Coming to iPad with iOS 5,” by Kevin Purcell, Jun. 6, 2011, found at http://www.gottabemobile.com/2011/06/06/split-keyboard-for-thumb-typing-coming-to- ipad-with-ios-5/, 8 pp. |
| “SwiftKey 3 Keyboard-Android Apps on Google Play,” found at web.archive.org/web/20121127141326/https://play.google.com/store/apps/details?id=com.touchtype.swiflkey&hl=en, accessed on Nov. 27, 2012, 4 pp. |
| “SwiftKey counters Swipe with a Smarter Version Makes an In-Road Into Healthcare Market,” found at http://techcrunch.com/2012/06/21/swiftkey-counters-swype-with-a-smarter-version- makes-an-in-road-into-healthcare-market/, Jun. 21, 2012, 2 pp. |
| “SwiftKey Keyboard—Android Apps on Google Play,” found at https://play.google.com/store/apps/details?id=com. touchtype.swiftkey&hl=en, accessed on Jun. 8, 2012, 3 pp. |
| “Swipe Nuance Home, Type Fast, Swipe Faster,” found at http://www.swipe.com/, accessed on May 25, 2012, 1 p. |
| “Swype-Swype Basics,” found at www.swype.com/tips/swype-basics/, downloaded Jun. 8, 2012, 2 pp. |
| Text input for future computing devices (SHARK shorthand and ATOMIK). SHARK Shorthand Home Page, retrieved from http://www.almaden.ibm.com/u/zhai/topics/virtualkeyboard.html, accessed on Sep. 20, 2012, 4 pp. |
| “Welcome to CooTek-TouchPal, an innovative soft keyboard,” Touch Pal v1.0 for Android will Release Soon!, found at www.cootek.com/intro-android.aspx, downloaded Aug. 20, 2012, 2 pp. |
| “Why your typing sucks on Android, and how to fix it,” by Martin Bryant, Mar. 3, 2010, found at thenextweb.com/mobile/2010/03/03/typing-sucks-android-fix/, 3 pp. |
| “Avoid iPhone navigation and typing hassles,” by Ted Landau, Dec. 28, 2007, found at www.macworld.com/ article/1131264/tco_iphone.html, 9 pp. |
| Accot et al., “Refining Fitts' Law Models for Bivariate Pointing,” IBM Almaden Research Center, Paper: Pointing and Manipulating, Apr. 5-10, 2003, pp. 193-200. |
| Alkanhal, et al., “Automatic Stochastic Arabic Spelling Correction with Emphasis on Space Insertions and Deletions,” IEEE Transactions on Audio, Speech, and Language Processing, vol. 20(7), Sep. 2012, 12 pp. |
| Bellegarda, “Statistical Language Model Adaptation: Review and Perspectives”, Speech Communication 42, Jan. 2004, pp. 93-108. |
| CiteSeer, “Token Passing: a Simple Conceptual Model for Connected Speech Recognition Systems” (1989), by S.J. Young et al., found at (http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7829), accessed on Apr. 30, 2012, 2 pp. |
| Dasur Pattern Recognition Ltd. SlideiT Keyboard—User Guide, Jul. 2011, found at http://www.mobiletextinput.com/App_Open/Manual/SlideIT_UserGuide[English]v4.0.pdf, 21 pp. |
| Goodman et al., “Language Modeling for Soft Keyboards,” Microsoft Research, Nov. 28, 2001, 9 pp. |
| Goodman et al., Language Modeling for Soft Keyboards, Proceedings of the 7th International Conference on Intelligent user interfaces, Jan. 13-16, 2002, pp. 194-195. |
| Goodman, “A Bit of Progress in Language Modeling Extended Version,” Machine Learning and Applied Statistics Group, Microsoft Corporation, Aug. 2001, 73 pp. |
| Goodman, “A bit of progress in Language Modeling,” Computer Speech & Language, Oct. 2001, pp. 403-434. |
| Gunawardana et al., “Usability Guided Key-Target Resizing for Soft Keyboards,” Proceedings of the 15th International Conference on Intelligent user interfaces, Feb. 7-10, 2010, pp. 111-118. |
| Harb et al., “Back-off Language Model Compression,” Google Inc., Jan. 2009, 4 pp. |
| Kane et al., “TrueKeys: Identifying and Correcting Typing Errors for People with Motor Impairments,” Proceedings of the 13th International Conference on Intelligent User Interfaces, IUI '08, Jan. 13, 2008, 4 pp. |
| Karch, “Typing, Copy, and Search,” Android Tablets Made Simple, Nov. 18, 2011, 13 pp. |
| Keymonk Keyboard Free-Android Apps on Google Play, What's New, found at https://play.google.com/store/apps/ details?id=com.keymonk.latin&hl=en, downloaded Oct. 3, 2012, 2 pp. |
| Kristensson et al., “Command Strokes with and without Preview: Using Pen Gestures on Keyboard for Command Selection,” CHI Proceedings, San Jose, CA, USA, Apr. 28-May 3, 2007, 10 pp. |
| Kristensson et al., “Relaxing Stylus Typing Precision by Geometric Pattern Matching,” Proceedings of the 1oth International Conference on Intelligent User Interfaces, Jan. 9-12, 2005, pp. 151-158. |
| Kristensson et al., “SHARK2: A Large Vocabulary Shorthand Writing System for Pen-based Computers”, UIST 2004, Proceedings of the 17th Annual ACM Symposium on User Interface Software and Technology, Oct. 24-27, 2004 pp. 43-52. |
| Landau, “Android OS—Language & keyboard settings,” found at support.google.com/ics/nexus/bin/answer.py? hl=en&answer=168584, downloaded Jun. 4, 2012, 3 pp. |
| Li, “Protractor: A Fast and Accurate Gesture Recognizer” CHI2010, Apr. 10-15, 2010, Atlanta, Georgia, pp. 2169-2172. |
| Lomas, “Hey Apple, What the Next iPhone Really, Really Needs Is a Much Better Keyboard,” http://techcrunch.com/2013/04/21/the-iphone-keyboard-stinks/?, Apr. 21, 2013, 6 pp. |
| MacKenzie et al., “LetterWise: Prefix-based Disambiguation for Mobile Text Input,” Proceedings of the 14th Annual ACM Symposium on User Interface Software and Technology, Nov. 11-14, 2001, pp. 111-120. |
| Marziah, “Typing, copying and Search,” Android Tables Made Simple, Nov. 18, 2011, 7 pp. |
| Mohri et al., “Speech Recognition With Weighted Finite-State Transducers,” Springer Handbook on Speech Processing and Speech Communication, 2008 (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 2008, is sufficiently earlier than the effective U.S. filing date, 2017, so that the particular month of publication is not in issue.) , 31 pp. |
| Naseem, “A Hybrid Approach for Urdu Spell Checking”, National University of Computer & Emerging Sciences, Nov. 2004, 87 pp. |
| Rybach et al., “Silence is Golden: Modeling Non-speech Events in WFST-Based Dynamic Network Decoders,” Human Language Technology and Pattern Recognition, Computer Science Department RWTH Aachen University, Mar. 2012, 4pp. |
| Suraqui, U.S. Appl. No. 60/430,338, filed Nov. 29, 2002, 31 pgs. |
| Tappert et al., “The State of the Art in On-Line Handwriting Recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, No. 8, Aug. 1990, pp. 787-808. |
| Williamson et al., “Hex: Dynamics and Probabilistic Text Entry,” Switching and Learning LNCS 3355, 2005, (Applicant points out, in accordance with MPEP 609.04(a), that the year of publication, 2005, is sufficiently earlier than the effective U.S. filing date, 2017, so that the particular month of publication is not in issue.) pp. 333-342. |
| Wobbrock et al., “$1 Unistroke Recognizer in JavaScript,” [online], first accessed on Jan. 24, 2012, retrieved from the Internet: http://depts.washington.edu/aimgroup/proj/dollar/, 2 pp. |
| Wobbrock et al., “Gestures without Libraries, Toolkits or Training: A $1 Recognizer for User Inter face Prototypes,” UIST 2007, Proceedings of the 2oth Annual ACM Symposium on User Interface Software and Technology, Aug. 19, 2007, pp. 159-168. |
| Young et al., “Token Passing: a Simple Conceptual Model for Connected Speech Recognition Systems,” Cambridge University Engineering Department, Jul. 31, 1989, 23 pp. |
| Youtube, “Automatic error correction on graphical keyboard,” retrieved from http://www.youtube.com/watch? v= VgYrz7Pi60, uploaded on Jun. 14, 2007, 1 p. |
| Youtube, “BlindType—Demo 1 ,”retrieved from http://www.youtube.com/watch?v=M968NIMd79w, uploaded on Jul. 17, 2010, 1 p. |
| Youtube, “BlindType—Demo 2,” retrieved from http://www.youtube.com/watch?v=7gDF4ocLhQM, uploaded on Aug. 2, 2010, 1 p. |
| Youtube, “BlindType on Android,” retrieved from http://www.youtube.com/watch?v=m6eKm1gUnTE, uploaded on Aug. 7, 2010, 1 p. |
| Zhai et al., “In search of effective text input interfaces for off the desktop computing,” Interacting with Computers 17, Feb. 20, 2004, pp. 229-250. |
| Zhai,“Text input for future computing devices (SHARK shorthand and ATOMIK),” SHARK Shorthand [online]. Apr. 23, 2012. First Accessed on Jan. 31, 2014. retrieved from the Internet: https://web.archive.org/web/20120423013658/http://www.almaden.ibm.com/u/zhai/topics/virtualkeyboard.html , 3 pp. |
| International Preliminary Report on Patentability from International Application No. PCT/US2013/064890 dated Apr. 30, 2015, 10 pp. |
| First Office Action, and translation thereof, from counterpart Chinese Patent Application No. 2013800504132.6, dated Nov. 20, 2015, 18 pp. |
| Second Office Action, and translation thereof, from counterpart Chinese Application No. 201380054132.6, dated Jun. 27, 2016, 13 pp. |
| Prosecution History from U.S. Appl. No. 15/264,876, dated Sep. 23, 2016 through Jun. 30, 2017, 37 pp. |
| U.S. Appl. No. 15/647,887, filed Jul. 12, 2017, by Ouyang et al. |
| Third Office Action and Search Report, and translation thereof, from counterpart Chinese Application No. 201380054132.6, dated May 9, 2018, 18 pp. |
| “Advisory Action”, U.S. Appl. No. 13/657,574, dated Jan. 7, 2014, 3 pages. |
| “Corrected Notice of Allowance”, U.S. Appl. No. 15/264,876, dated Sep. 29, 2017, 2 pages. |
| “Examination Report”, EP Application No. 13815182.4, dated Apr. 11, 2019, 7 pages. |
| “Final Office Action”, U.S. Appl. No. 13/657,574, dated Sep. 13, 2013, 12 pages. |
| “First Supplemental Notice of Allowance”, U.S. Appl. No. 14/196,552, dated Oct. 31, 2014, 2 pages. |
| “Fourth Supplemental Notice of Allowance”, U.S. Appl. No. 14/196,552, dated Jun. 18, 2015, 5 pages. |
| “International Search Report and Written Opinion”, PCT Application No. PCT/US2013/066198, dated Jan. 22, 2014, 12 pages. |
| “International Search Report and Written Opinion”, PCT Application No. PCT/US2013/064890, dated Apr. 16, 2015, 11 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 13/657,574, dated Feb. 7, 2013, 12 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/452,035, dated Feb. 8, 2018, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/851,759, dated Mar. 10, 2016, 7 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/196,552, dated Mar. 13, 2015, 9 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/196,552, dated May 7, 2014, 8 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 13/787,513, dated Jun. 20, 2013, 10 pages. |
| “Non-Final Office Action”, U.S. Appl. No. 14/452,035, dated Aug. 9, 2017, 12 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/787,513, dated Oct. 28, 2013, 9 pages. |
| “Notice of Allowance”, U.S. Appl. No. 13/657,574, dated Apr. 14, 2014, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/452,035, dated May 22, 2018, 8 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/851,759, dated Jul. 15, 2016, 5 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/851,759, dated Sep. 12, 2016, 6 pages. |
| “Notice of Allowance”, U.S. Appl. No. 14/196,552, dated Sep. 17, 2014, 5 pages. |
| “Reduced Keyboard System Having Automatic Disambiguating and a Method Using Said System”, U.S. Appl. No. 60/505,724, Sep. 22, 2003, 47 pages. |
| “Second Supplemental Notice of Allowance”, U.S. Appl. No. 14/196,552, dated Nov. 14, 2014, 2 pages. |
| “Supplemental Notice of Allowance”, U.S. Appl. No. 13/787,513, dated Mar. 11, 2014, 2 pages. |
| “Third Supplemental Notice of Allowance”, U.S. Appl. No. 14/196,552, dated Feb. 2, 2015, 5 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20180018314 A1 | Jan 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61714696 | Oct 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15264876 | Sep 2016 | US |
| Child | 15703820 | US | |
| Parent | 14851759 | Sep 2015 | US |
| Child | 15264876 | US | |
| Parent | 14196552 | Mar 2014 | US |
| Child | 14851759 | US | |
| Parent | 13787513 | Mar 2013 | US |
| Child | 14196552 | US |
