Other

Zi Technology Corporation Ltd

Zi Corporation of Canada, Inc.

Robert Barry O'Dell

Changshi Xu

Roland Emlyn Williams

Todd Garrett Simpson

Samuel Yin Lun Pun

John M Conrad

Eun-Kyong Paek

James D Ivey

Xiao Jun Wan

An obscuration key is associated with each domain served by a group of trusted servers, and is used when sending and receiving all emails between the trusted servers. An e-mail server attempts to reverse the presumed obscuration of the body of an e-mail message prior to delivering the message to the intended recipient. If the obscuration key and method have been previously applied to the body of a message, reversal restores the body of the message such that the recipient receives precisely the message intended by the sender. If the obscuration method has not been previously applied to the content of the message, the reversal is destructive in that the body of the message is unreadable, including any URLs and URL links in the body of the message and any binary attachments to the message. Any attempt to spoof the sender without (i) use of the particular e-mail server the spoofed sender would use and (ii) authentication as the spoofed sender with that e-mail server is destructively obscured when received by the recipient. With any and all URLs and URL links in the body of the message destroyed, the recipient is prevented from reaching any harm intended by the message. With any binary attachments destroyed, the recipient is prevented from launching any malware attached to the message. Any phishing attempt resulting from the spoofing is completely thwarted.

Rendering spoofed electronic mail harmless

Very strong, complex, unforgettable passwords unique to each web site are created for a user's Web site authentication by altering all or part of the web site address using, in a preferred embodiment, a predetermined encoding dictionary with more a single code for each entry and unique to each user. The entries in this preferred embodiment are single characters including characters used for words, punctuation, symbols and numerals; each single entry character appears more than once in the dictionary. The codes are of various character lengths and can be comprised of the same characters used in the entries. In a Web site authentication embodiment as well as for embodiments not used for Web site authentication, including pass-protecting files, the string of characters altered by encoding can be a private word or group of words. In another embodiment the password created by encoding is pseudo-randomly scrambled by using a seed unique to the user in order to create the password actually used. In yet another embodiment, the password is created without the encoding step, by pseudo-randomly scrambling the web address or other user-selected character string using a seed unique to the user.

Making unique passwords from the same string of characters, including any string of characters in a web address

Presentation of results of a predictive analysis of text is delayed until entry of the text by a user is paused by a particular amount of time. The results are available for selection by the user for another particular amount of time. After the other particular amount of time is expired, the results are no longer available to for selection. If a particular result is selected, the selected result either replaces or supplements the entered text.

Information entry mechanism for small keypads

As either regular entry or as an assist to the user of existing computer text entry systems, the invention makes possible an alternative method of Chinese character entry by entering a Chinese character assumed by the user to be a rhyme of the character the user desires to enter. Entry methods for such rhyme alternative entry include phonetic and non-phonetic entry of Chinese characters, including keyboard stroke-category input, and handwritten entry using an electronic surface. The invention is not only helpful for entry of difficult Chinese characters but provides an approach to the use of supplementing input methods for most if not all written languages.

Using input of rhyming characters for computer text entry of Chinese characters

A method and system for entering Chinese characters into a computer by entering the size and shape of their strokes via a matrix, such as the 3&#xd7;3 arrangement of the numbers one through nine found on a cell phone.

Using a matrix input to improve stroke-entry of Chinese characters into a computer

A computer-implemented method for encoding a handwritten stroke set, each of the handwritten stroke set being representative of a constituent stroke of an ideographic character, to obtain an encoded input sequence. The method includes ascertaining a shape of a first stroke of the handwritten stroke set and ascertaining one of a location information and a size information pertaining to the first stroke. The method further includes assigning a first code to the encoded input sequence responsive to a determination of the shape of the first stroke and a determination of the one of the location information and the size information of the first stroke. The first code is predefined to represent the shape of the first stroke and the one of the location information and the size information of the first stroke. The first code is sufficiently unique to distinguish the first code from other codes representing other permutations of shape and the one of the location information and the size information of the first stroke.

Database engines for processing ideographic characters and methods therefor

Consonant jamos of the Korean language are grouped according to appearance and each group is associated with a respective key of a reduced keypad. Vowel jamos are specified by the user using a number of keys reserved for vowels and each of which represents a respective category of strokes by which the vowel jamo would normally be written.

Korean language predictive mechanism for text entry by a user

Beginning with the first letter or stroke, this invention uses the relative frequency of the sequential groups of letters or strokes from which individual words or characters are gradually built in order to provide a better way of computer indexing languages for easier and more efficient access to both the frequently used words or characters and the less-frequently used. This makes possible a system of text input that is both more efficient and more intuitive than utilizing just word or character frequency, an input approach which eliminates typing transpositions, reduces word-spelling errors or character-stroke-order uncertainty, and provides an alternative to a standard keyboard which is especially helpful with wireless phones and hand-held computers, and similar devices lacking standard keyboards. This invention can make words and characters quite accessible in an intuitive way without requiring any direct input of words or letters, strokes or characters. The user is not directly &ldquo;inputting&rdquo; a word or character with letters or strokes, but finding the character or word by selecting increasingly complete words or characters from the choices offered on the computer display screen-choices offered according to the frequency-of-use not of words or characters but of these increasingly complete word or character beginnings. For Western and other non-character-based languages this greatly reduces typos and misspellings while being no slower than standard keyboard entry for many users. For Chinese-character-based languages, it provides a method of selecting characters for screen display without the need to learn any character input method, and much like one sees with standard keyboard input of Western languages, it gives positive reinforcement about entry of characters by showing the character gradually develop in response to the user's actions.

Text input system for ideographic and nonideographic languages

A computer input system for Chinese and Japanese characters. The different strokes for composing the characters are classified into different groups, each identified by a code number. The strings of code numbers are stored in memory where the strings contain only as many code numbers as are necessary to identify the characters. Strings for two or more characters used together as compounds are also stored. When a code number entered by an operator matches a string stored, a controller causes the shape of the actual character to be fetched from memory and displayed. For some characters, partial characters are also stored and are fetched and displayed when the string of code numbers for such partial characters matches the code numbers entered to aid beginners. The string of code numbers representing each character follows exactly a traditional; writing sequence of the character from the very first stroke to the end of the string of code numbers. However, the computer usually identifies the character before the entire writing sequence is completed, particularly for characters used together in compounds.

Growing community of inventors

Oakland, CA, United States of America

Robert Barry O'Dell