TL;DR: In this article, an apparatus and method for implementing spelling error detection and correction for a two-way mobile communication device is described. But the method is not suitable for the use of a large number of characters and it requires the user to input a termination symbol (e.g., a space or a # symbol).
Abstract: An apparatus and method for implementing spelling error detection and correction for a two-way mobile communication device. The two-way mobile communication device has a display screen and a telephone-type keypad (e.g., keys 0-9, “*”, “#”, etc.) with the characters mapped onto each key in a many to one fashion. According to one embodiment, when the end of a character string (e.g., a word) is indicated by the input of a termination symbol (e.g., a space or “#”) then that character string is compared to a plurality of character strings stored in a dictionary. If no match is found for the character string in the dictionary, then it assumed that the character string is misspelled. Individual character elements of the subject character string are then systematically replaced by character elements mapped to the same key, and then each combination is compared to the entries resident in the dictionary. Matching character strings are retrieved and presented to the user for examination and selection or, if so desired, the most likely matching character string can automatically replace the misspelled character string.
TL;DR: In this paper, an occurrence probability table describing for each character the probability that a character code occurs is prepared for each combination of a language and its character code system, to judge the combination of the language and the character code with respect to the entered character code string on the basis of the obtained product.
Abstract: The present invention is directed to identifying a language represented by a character code and its character code system. An occurrence probability table describing for each character the probability that a character code occurs is prepared for each combination of a language and a character code system. An entered character code string is divided for each character, and the occurrence probability table is referred to, to obtain the probability that the character code occurs. The product of the occurrence probabilities is calculated for each combination of the language and the character code system, to judge the combination of the language and the character code system with respect to the entered character code string on the basis of the obtained product.
TL;DR: In this article, a two-way mobile communication device has a display screen and a telephone-type keypad where a number of characters are mapped onto each key in a many to one fashion.
Abstract: A method for implementing spelling error detection and
correction for a two-way mobile communication device (100).
The two-way mobile communication device has a display screen
(104) and a telephone-type keypad (116) where a number of
characters are mapped onto each key in a many to one fashion.
When the end of a character string (e.g., a word) is indicated by
the input of a termination symbol (e.g., a space or "#") then that
character string is compared to a plurality of character strings
stored in a dictionary. If no match is found, the character string
is considered misspelled. Then, individual character elements of
the subject character string are systematically replaced by the
character elements mapped to the same key with the result
being compared to the entries resident in the dictionary.
Matching character strings are retrieved and presented to the
user for examination and selection.
TL;DR: In this article, a job boundary is determined by examining the input data sample and determining if its syntax is characteristic of a current job's control language or a different control language, if the syntax is different than the syntax of the current control language than job boundary has occurred, and if the page has not been previously marked.
Abstract: A peripheral unit is able to receive a plurality of control languages, check for an occurrence of a control language job boundary, and to function in response to each control language. For PCL the steps that determine when to check for occurrence of a control language job boundary are: identify the next command from the input data stream; determine if the identified command is not a PCL control character or calls for a mark to be made on the page, and if the page has not been previously marked. If the above criteria is met, the command and following data are examined to determine if a job boundary has occurred. Thus at the commencement of every formatted PCL page of data, a decision is made whether a job boundary has occurred. For PostScript the steps are: prescan the data stream. If a next command is an end-of-job marker then exit PostScript and return to identify the language of the input data. If the next command is an escape character and the current I/O protocol is not binary, the command and following data are examined to determine if a job boundary has occurred. A job boundary is determined by examining the input data sample and determining if its syntax is characteristic of a current job's control language or a different control language. If the syntax of the input data sample is different than the syntax of the current control language than a job boundary has occurred.
TL;DR: In this article, a regular expression engine that supports multiple, predefined, distinct wild card characters, escape characters, special characters with language specific functionality, delimiters, and context designation is presented.
Abstract: Described herein is a technology that facilitates efficient wild card auto completion of an input term. The technology supports the input term including multiple, predefined, distinct wild card characters, escape characters, special characters with language specific functionality, delimiters, and context designation. Wild card auto completion is based on a regular expression engine that supports the multiple, predefined, wild card characters. In addition, the technology supports a single input that may include multiple parts including context, domain, parts of speech, and a number of words in a result phrase. In various embodiments the technology facilitates pattern optimization to merge a subset of consecutive homogenous wild card characters and provides a selection of matching tools based on criteria including the type of wild card character included in the input term and where the wild card character appears in the input term as well as context.