CA2572215A1 - Nonstandard text entry - Google Patents

Abstract

A computer-implemented method of providing text entry assistance data comprises receiving at a computer information indicative of predictive textual outcomes, generating dictionary data from the received information; and providing the dictionary data to a text entry device remote from the computer.
The received information may relate to search requests made by a plurality of remote searchers, and the received information may be indicative of search term popularity.

Description

NONSTANDARD TEXT ENTRY
TECHNICAI. FIELD
This invention relates to assisting users of computing or conununication devices in entering information, and more particularly to providing and updating dictionaries for disambiguating text entered by users.

BACKGROUND
As computers and coniputer networks become more and more able to access a wide variety of information, people are demanding more ways to obtain that information. Specifically, people now expect to have access, on the road, in the home, or in the office, to information previously available only from a permanently-connected personal computer hooked to an appropriately provisioned network. They want stock quotes and weather reports from their cell phones, e-mail from their personal digital assistants (PDAs), up-to-date documents from their palm tops, and timely, accurate search results from all their devices. They also want all of this infoimation when traveling, whether locally, domestically, or internationally, in an easy-to-use, portable device.

Portability generally requires a device small in size, which in turn limits the number of data entry keys and the amount of memory and available processing power. In addition, ultra portable devices often must be held in one hand or not held at all, so that data entry must be one-handed or no-handed.

These limitations in the device generally must be compensated for by the user.
For example, the user may have to use a limited keyboard such as a telephone keypad, or limited speech recognition capabilities.. Such constrained devices may force a user to learn special tricks for data entry (such as shorthand writing on a PDA) or may generate data that the user never intended, by making inaccurate guesses at ambiguous data entries.

Some attempts to solve these problems have been made. For example, PDAs have beeri programmed to recognize short-hand and long-hand writing.
Also, cell phones can recognize entered letters, even though the presence of three letters on each key can create ambiguities about the intended text, such as by allowing the user to press key combinations, either simultaneously or in sequence (e.g., triple tap). Other solutions involve making educated guesses at what letters the user intended to enter, such as by identifying all possible terms that match a combination of pressed keys, and selecting the most common term or presenting the user with a list of possible terms sorted from most common to least common. These solutions all have limitations.

Even apart from portable, constrained devices, users want more text-entry intelligence in their computers. For example, users want systems that assist with data entry or correct errors in data entry, such as spell checkers and grammar checkers. Again, there are multiple solutions, but all have limitations.

Therefore, there is a need for a system that assists a user in entering data more quickly and more accurately, both in devices with full functionality and in constrained devices.

SUMMARY
This document discloses methods and systems that assist users of computing and communication devices in entering data into those devices.

In one aspect, a computer-implemented method of providing text entry assistance data is disclosed. The method comprises receiving at a computer

2 information indicative of predictive textual outcomes, generating dictionary data from the received information, and providing the dictionary data to a text entry device remote from the computer. The received information may relate to search requests made by a plurality of remote searchers, and the received information may be indicative of search term popularity. Also, the dictionary data may coinprise a plurality of terms with a corresponding plurality of predictive weightings, and the dictionary data may include weightings for co-concurrence events between two or more terms. In addition, the dictionary data may be provided to the remote text entry device in response to a request from the device.

As one example, the request may comprise a search request, and the dictionary data may be provided along with results to the search request. The received information may be obtained as the result of crawling one or more information storage locations. One or more of the information storage locations may also comprise e-mail storage, and may correspond to a predefined group of locations for an organization. The dictionary data may represent predictive textual outcomes for that organization. The dictionary data may also be compressed, and may comprise supplemental data for addition to a preexisting dictionary. A search request may also be received, a search result generated, and the search result provided along with the dictionary data. In addition, the dictionary data may comprise data from documents relating to the search result.
In another aspect, a data collection and distribution system is discussed, comprising a request processor to receive data requests from one or more remote clients, a dictionary generator to produce information for use by the one or more clients containing predictive data entry information for the one or more clients, and a response formatter to receive information responsive to the data requests

3 including predictive data entry information, and to provide the information responsive to the data requests for use by the one or more clients. The dictionary generator may comprise a concurrence rater that calculates predicted concurrence scores for a plurality of objects, and the plurality of objects may comprise a plurality of terms that may be entered by a user in generating a data request. An object picker may also be provided to identify objects in a document for submission to the concurrence rater, and may be adapted to scan a plurality of defined documents for data indicative of the occurrence of words in the documents and concurrence between words in the documents. A search engine may also be provided to receive a plurality of requests and to provide the requests for transmission by the response formatter along with predictive data entry information.

In yet another aspect, a computer-implemented system for providing information indicative of probable usage of objects by the user of a data entry device is disclosed. The system comprises means for obtaining documents containing objects indicative of usage by a user or users; a concurrence rater to analyze the documents for usage data of objects in the documents and to generate associated concurrence ratings; and an interface to transmit the concurrence ratings to a data entry device.

In another aspect, a computer-impleinented method of disambiguating ambiguous information provided to a computing device, comprises identifying a set of possible matches for the ambiguous infonnation, retrieving occurrence data indicative of the probable intended usage of the ambiguous information and reflecting recent usage practices of a user or users, and providing an indication of a probable match from the set of possible matches and the occurrence data.

4 Concurrence data indicative of information having an expected usage in combination with one or more matches of the set of possible matches may also be retrieved, and an indication of a probable match from the set of possible matches, the occurrence data, and the concurrence data, may be provided. The set of possible matches may be identified using a tree-pruned data structure, and a match may be selected automatically, and mat be submitted to a remote server.
In automatic selection, the match may be selected when a score of a best possible match exceeds a score of a second-best possible match by a predetermined level.
The indication of a probable match may also be based on data entered, and concurrence levels between possible matches and previously entered data. In addition, a match may be obtained and the occurrence level for the match may be increased.

In another aspect, a communication device comprises a transceiver to receive and transmit information, a vocabulary repository containing information indicative of the probable intended usage of ainbiguous information entered by a user of the device, the occurrence data reflecting usage practices of the user or another user or users, and a disambiguation engine to resolve the ambiguous information provided to the device to a probable solution by identifying possible solutions and to apply the information indicative of probable intended usage to the possible solutions. The transmitter may comprise a wireless transmitter, and the the occurrence data may contain data that represents usage practices by members of a demographic group. In addition, a display may be provided to present one or more of the identified possible solutions in order from most probable solution to least probable solution. The disambiguation engine may also be configured to select a solution and provide the solution to the transceiver

5 for transmission. Moreover, the vocabulary repository can be updated with information indicative of probable intended usage based on the selected solution.

The systems and techniques described here may provide one or more of the following advantages. A system may provide effective and automated text entry, and may provide for assistance when difficulties arise in entering text.

Also, a system may assist a user by providing suggestions for text entry. Such a system may allow for quick and more accurate data entry, without the need for excessive system requirements, so that the system can run in the background wllile other applications operate, and also can be implemented on portable systems, such as cellular telephones, having limited resources, such as memory.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS
These and other aspects will now be described in detail with reference to the following drawings.

Figure 1 shows schematically a data entry system having data disambiguation capabilities.

Figure 2 is a schematic diagram of a system to identify, format, and distribute information for a data entry dictionary.

Figure 3 is a schematic diagram of a system for receiving and using a user-specific data entry dictionary.

Figure 4 is a flow chart showing exemplary steps for preparing information for a data entry dictionary.

6 Figure 5 is a flow chart showing exemplary steps for disambiguating information entered into a device.

Figure 6 is a flow chart of exemplary steps providing data entry dictionary information in response to a request from a remote device.

Figure 7 is a schematic diagram showing the logical tree-based organization of a data entry dictionary.

Like reference symbols in the various drawings indicate like elements.
DETAILED DESCRIPTION
The systems and techniques described here relate to assistance with data entry. The systems can take many foims, including personal coinmunicators and personal computers. The data may also be entered in many forms, including by telephone keypad and voice. In general, the systems operate by identifying user-specific data so as to make more accurate disambiguating selections based upon, for example, a user's previously-typed words, the user's self-selected profile, or information sources external to the user, but that are associated with the user or the user's selections.

Figure 1 shows a constrained data entry system 10 having data disambiguation capabilities. The system 10 as shown comprises a cellular telephone handset, but could take any appropriate form, such as a personal digital assistant, a personal computer, or a voice-driven personal communication device. In this embodiment, the system 10 has a display screen 12 that can be programmed to display any appropriate information to a user of the system 10.
For example, the display screen 12 could be used to display information related to an Internet searching application, such as a search box 12a and related control buttons.

7 As shown, search box 12a may simply be a contrasting area on the screen that displays a search term as it is entered by the user. Search button 12b may submit the contents of search box 12a to a search engine, such as a search engine connected to the cellular network by the Internet. The display screen 12 may then display the results of the search. Alternatively, "I'm Feeling Lucky"
button 12c may submit the search results, and the display screen 12 may then immediately display the page for the most appropriate match for the search.

Data may be entered into system 10 in any of a number of manners.
Specifically, data entry keys 14 may be used to enter information such as alphanumeric characters, and may take the form of a standard telephone keypad, with alphabetic characters on the 2 through 9 keys. Other appropriate ways of entering alphanumeric information, including voice recognition, may also be used. As used here, references to entry of text encompass entry through a key board or by writing, and also otlier maiuiers of data entry, such as by speaking to a voice-recognition enabled system.

In addition, control keys 16 may be provided, for example, to perform predetermined functions or programmed functions, or to control icons on display screen 12. Control keys 16 may also be used as supplemental keys, i.e., the number 0 could represent things other than 0, the "#" key may be used as a space key, the "" key may be a proxy for the backspace key, and the "1" key may represent punctuation. Also, control wheel 15 may be provided on the side of the hand set to allow a user to scroll through selections shown on display screen 12, and to push inward to click on a desired selection. Other appropriate data presentation and data entry features may also be provided, particularly where the

8 system 10 includes a full-sized personal computer, or where the system operates via voice control.

The system 10 may also be provided with features to allow for disambiguation of entered data. Entered data may be ambiguous, for example, because a term has not yet been entered completely, because each keystroke may represent multiple different letters (such as when the keypad is a standard telephone keypad), or because acquired speech was not clear or was incomplete.
The ambiguities to be resolved may thus be both interpolative and extrapolative.
Interpolative ambiguities occur when all of the data for a text entry has been entered, but multiple possible text may be represented by the data, such as when the data is entered on a telepllone keypad. Extrapolative ambiguities occur when a user has entered some of the data for a text entry, but has not completed the data entry. In such a situation, the system may provide selections to complete the entry. The system may also determine when the user has finished entering the keystrokes for a word, such as when only one possible solution for the entered keystrokes exists.

Ambiguities may also be both interpolative and extrapolative at the same time, such as when a user has entered only part of a word using a single-tap method on a telephone keypad. Also, ambiguities may arise as to the data entry type, e.g., when the system cannot readily determine if a telephone user intends to enter numerals, text by single-tap, or text by multiple-tap methods.

In general, the disambiguation feature may operate by matching entries in a stored dictionary to those that are capable of matching the keystrokes entered to the system 10. The matched terms in the form of a solution set may be sorted in a mamzer that places the most likely match at the top of the set. A user may

9 scroll through the solution set, such as by using control wheel 15, and select the desired data item. Also, the system may be set up to select a predicted match automatically without intervention by the user (but with the ability of the user to edit or override the selection in real-time or after the data is entered).

In Figure 1, two dictionaries, a main dictionary 21 and a supplemental dictionary 23, are shown. Main dictionary 21 represents common terrns that are generally used in a particular application, and may be provided with the system when it is initially set up. Typically, such a main dictionary may contain around 20,000 words from a larger 100,000 word dictionary, although other sizes

10 of dictionaries are permissible, depending on system capabilities. Also, the dictionaries are not limited to the English language, but may cover other languages having other characters, and even other types of objects.

Supplemental dictionary 23 represents additional data that may be added to the system 10 from time to time so as to give a user an even more personalized experience, and thereby provide more accurate disambiguation.
For example, the supplemental dictionary 23 may include time-sensitive information that is regularly updated in an attempt to match likely data entry by the user. As an example, the supplemental dictionary 23 may be used in combination with a search engine so as to update a device with search terms that are closely related to those recently entered by the user, or terms that are currently popular with a broader array of users. The supplementa123 dictionary may also be part of the main dictionary 21, so that new entries are simply added to main dictionary 21, and are not stored separately.

For example, if a user enters a search for "management theory," a search engine could look to other recent similar searches and provide the user's device with information about those other searches, such as other search terms entered soon after the identified search, or other terms used in documents that turn up as the result of a search. In addition, the search may also return data to the device to update probabilities for the occurrence of the words. In particular, other terms associated with a search can have their probabilities increased if the terms themselves already exist in the dictionary. For example, when "management theory" is provided as a search entry, terms such as "compensation,"
"Drucker,"
and "Deming" may be returned to the device and given prominence as solutions to future searches that they otherwise would not have had. Also, they may be added to the dictionary w11en they otherwise would not have been in the dictionary.

In general, and as an example, dictionaries 21, 23 may contain three pieces of information that assist in disambiguating text entry. First, they may contain the words or other objects themselves. Second, they may include the probability of each word or object being typed or selected. These probabilities may also be broken into sets of probabilities that depend on the application being used, as described in more detail below. Third, the dictionaries 21, 23 may include the concurrence, or co-concurrence, probability of each word with other words. For example, the entry for "paradigm" might indicate a high co-concurrence with the words "shift" or "change." In this manner, once the word "paradigm" is entered into a device, the words "shift" and "change" might be promoted to the top of the list of likely candidates for follow-up words.

Each of the pieces of information may be changed independently of the others. For example, if a user types a word very frequently, the probability of that word (whether in gross, or with respect to a particular application) can be

11 increased. Similarly, only the co-concurrence probabilities may be updated also.
Thus, probabilities can be updated independently of the entry of a particular word.

Also, once a word is typed, all of the probabilities associated with that word can be updated and revised. That is because, when a person uses a word, they are more likely to use it again soon in the near future. For example, a person searching for restaurants may enter the word "japanese" many times during a particular search session, until the person finds a good restaurant (and use of the word "japanese" might make it more likely the person will soon enter "sushi" because of the common co-concurrence between the words).

The concurrence data may be stored uniquely for separate applications.
For example, one application may be e-mail. When a word is being typed, the system may look at the items in the solution set according to their probability of being typed with respect to the particular application. If the application is e-mail, the probability of "hello" may be very high, while if the application is a game, the probability of "left" and "right" may be very high. This is the application-specific occurrence probability. The system may then identify the most common word associated with each item in the solution set, and adjust the probability based on that information and the prior entered word. The system may also identify the second most common word associated with each entry, and adjust the probability given that the prior word was entered. This adjustment for concurrence data may be undertaken independently of wliat application is currently operating. The process may then continue in a like manner through the remaining relevant entries.

12 An exemplary organization of the dictionaries 21, 23 includes corresponding object lists 22, 24 that contain a number of objects, such as words, punctuation, or functions to be performed. The objects may be sorted in any appropriate manner. A second dictionary field includes corresponding identification lists 26, 28, which may comprise, for example, the keypad strokes that correspond to each particular object. The objects may be sorted according to their respective identifications to assist system 10 in more efficiently identifying the proper match to any given keystroke combination, since the system may follow the listing as each keystroke is added to a request. An exemplary tree-based structure for organizing the dictionaries is provided in more detail in reference to Figure 7.

Referring again to Figure 1, each dictionary entry may be provided with one or more occurrence or concurrence fields 30, 32, 34, 36, which may contain data representing the likelihood that a particular object will be the intended object when a user enters a nuinber of ambiguous keystrokes. For example, an occurrence value may represent the relative popularity of a term in comparison to other terms. This relative popularity may be determined, for example, by scanning a group of relevant documents and determining the percent make-up of the documents by word. One or more of the concurrence values may comprise co-concurrence data that correlates terms with other terms that are often used witll or near the first term.

For example, when a person types "I'll see you at" and 4663 into a telephone keypad, the entered number probably represents HOME, rather than GONE or HONE. The system 10 may store co-concurrence data to indicate that the term HOME is often seen near terms such as "at>""in>""around>""near>"

13 and "reach." That co-concurrence data may cause the term HOME to be promoted as a preferred solution over other possible solutions where corresponding co-concurrence terms have been entered, where HOME might not have been the top choice without having access to such context. System 10 may look both forward and backward in using co-concurrence data. For example, the system may select a particular term, and then revisit that selection after the user types in the next term, and perhaps then update the selected word. In short, the system may provide bi-directional co-concurrence checking.

One or more flag fields 38, 40 may also be provided for each entry, and may be used, for example, to indicate that a particular entry is a temporary entry.
For example, the supplemental dictionary may receive time-sensitive information such as information about terms that are currently popular search terms. The information may be similar to that provided as part of the Google Zeitgeist. The flag may then represent an event upon which the information is set to expire. Flags may also be used to indicate that a particular term is an adult term, so that it will only be shown if the user has selected to have adult query fill-ins. Also, a flag could indicate that a term is specific to a particular application. Other appropriate flags may also be provided and used.

Additional features may also be available in relation to the use of user-specific data entry information with system 10. For example, information associated with supplemental dictionary 23 may be replaced, deleted, or reset upon the occurrence of a particular event, such as the running of a predetermined time period, or the resetting of a device that implements system 10. As one example, up-to-date information about current search tenns may be provided to the system 10, but may be set to expire after one or more days so that the system

14 returns to its original state once the downloaded search information is presumably stale and unhelpful to the system 10. Also, information that updates the dictionaries during a particular search session may be reset when the session ends, such as when the device is turned off or reset.

The data may also be changed based on the time of day or a person's location. For example, search terms relating to restaurants may be emphasized during times when a user is likely to be hungry. Also, the global positioning system inay be employed cso that a user's data entry is targeted to the user's location. As one example, the system may recognize when a user is away from their home, and thus traveling, and may thus update the dictionary with infoimation more relevant to a traveler, such as restaurant and airline information.

In addition, information may be adjusted according to a "decay rate."
For example, a term's probabilities can be decreased with each time period in which the word is not used. The decay may be based on usage rather than time, i.e., each time a word is used, the probabilities of all other words are reduced.
The words will then be removed when their probability falls below a threshold level. For example, after some period of typing other words, it will become apparent that the device does not receive the word "lavender" very much, and that word can be removed from the dictionary.

The dictionary 21 and supplemental dictionary 23 need not take any particular fonn. Rather, the dictionary may be any appropriate structure that stores data for completing or correcting data entry, in whatever form, and for providing the ability to assist in selecting appropriate data. Moreover, the dictionaries may be combined or further divided, may have various data types and forms, and may represent objects other than mere words.

Specifically, each item of dictionary data may take many forms. For example, an item may be a word or phrase. It may also be a word root, so that the system can build words from simpler component parts. In addition, an item could be a number, a piece of punctuation, or another symbol. An item could also comprise an image, sound, or other such object. In addition, the item may represent a function to be carried out by the system, whetlier predefined and associated with particular code, or defined as a macro by a user. Thus, the use of the terms "word" and "term" above are intended to be exemplary, and not limiting in any manner.

Organizationally, the infonnation may be stored on a computer as an ordered list of "related" terms for each term. For example, a server could store words that occur frequently in the same document, words that occur frequently in the same session, or other groups. This ordered list can be returned by a server to a device, along with the probability of co-concurrence (or relative probability of co-concurrence). For example, for the word "mustang," "Ford"
may have a probability of 0.10 and "horse" a probability of 0.15.

Figure 2 is a schematic diagram of a system 50 to identify, format, and distribute information for a data entry dictionary. Such a system 50 may be implemented, for example, as part of an Internet search provider's general system. System 50 is generally equipped to obtain information about the occurrence and concurrence of terms from various sources, and to generate dictionary information based upon an analysis of word use in such sources.

Such sources could include, for example, data stores of information at a particular organization, data for an individual (such as outgoing messages stored in a Sent Items box), or data about search terms entered recently by users of an Internet search service.

System 50 is provided with an interface 52 to allow coinmunications in a variety of ways. For example, system 50 may communicate with database 54 external to system 50, such as via a LAN, WAN, or other appropriate communication means. System 50 may also communicate with server 56, which may provide access to various applications required by system 50. In addition, system 50 may be communicatively connected to a network stich as the Internet 58, and thereby cominunicate with various devices such as server farm 60, wireless cominunication device 62, and personal computer 64. The communication flow for any device may be bidirectional so that system 50 may receive inforni.ation, such as commands, from the devices, and may also send information to the devices.

Commands and requests received from devices may be provided to request processor 66, which may interpret a request, associate it with predefined acceptable requests, and pass it on, such as in the form of a command to another component of system 50 to perform a particular action. For example, where the request includes a search request, the request processor 66 may cause search engine 70 to generate search results corresponding to the search request. Such a search engine 70 may use data retrieval and search techniques like those used by the Google PageRankTM system. The results generated by search engine 70 may then be provided back to the original requester using response formatter 68, which carries out necessary formatting on the results.

Search engine 70 may rely on a number of other components for its proper operation. For example, search engine 70 may refer to an index 72 of web sites instead of searching the web sites themselves each time a request is made, so as to make the searching much more efficient. The index may be populated using information collected and formatted by web crawler 76, which may continuously scan potential information sources for changing information.
In addition to the search results, the systein 50 may provide to users updated dictionary information, which may include user-specific information, with dictionary generator 78. Dictionary generator 78 generally operates by extracting relevant concurrence data or information (including the occurrences of certain terms, concurrence of terms with other terms, and co-concurrence (n-gram) data) from accessed data stores, generating occurrence parameters for the information, and organizing the information in a mamler that can be transmitted for later implementation by a user, including a remote user, such as a user of a personal communication device. The information on which dictionary generator 78 operates may be general, such as all search terms entered recently on a search engine, or may be specific, such as search terms entered by members of a particular group. The system 50 may receive identifying information from a user, and may use that information to determine a group to which the user belongs so as to give the user the most relevant dictionary information. For example, engineers, dentists, or attorneys may self-identify themselves as falling into their particular groups, and may then receive data relevant to that group. In this manner, the dictionary data may be particularly relevant to members of the group.

Dictionary generator 78 may be implemented using any appropriate components. As shown, it comprises an object picker 80, a concurrence rater 82, and a packager 84. The object picker 80 is a module that is capable of parsing or otherwise analyzing an information store so as to determine how data is used or organized in the information store. For example, the object picker may identify each unique word in a particular document or group of documents. The object picker may review the documents directly or may act in concert with data gathered by web crawler 76 and stored in index 72.

Concurrence rater 82 provides a determination of the likelihood of appearance of particular terms or other objects in the document. For example, concurrence rater 82 may provide a normalized number establishing the amount of use of a tenn compared to other terms (i.e., the term's normalized occurrence).
Concurrence rater 82 may also establish such use information as between or among certain words or phrases, or parts of words so as to provide for concurrence and co-concurrence information.

Packager 84 places the dictionary information in a form in which it can be accessed and used easily. For example, packager 84 may compress or encrypt the information, arid may also encode'it in a manner that can be read by a device such as a personal communication device.

The dictionary generator 78 components may also be implemented in a "layered" structure (similar in manner to the ISO/OSI structure) or object-oriented structure to provider greater modularity. For example, multiple different packagers 84 may be implemented to produce transmittable dictionary data for various types of devices, and may all communicate with the concurrence rater 82 in a common manner. Also, multiple concurrence raters could be provided, for example, to provide different types or levels of concurrence data.
In addition, different object pickers may be used, for example, to access text files, sound files, or other materials.

In such a layered structure, each component need only be concerned with its interface to the next adjacent component, and need not be concerned about the internal operation of the next component, or with any operation of components in more distant layers. In such a manner, the items may be implemented in a more modular fashion to increase the coding efficiency of the system and to minimize errors.

The dictionary generator 78 may also access system storage 74 as necessary. System storage 74 may be one or more storage locations for files needed to operate the system, such as applications, maintenance routines, management and reporting software, and the like.

In one application, system 50 could be prograrmned to access documents containing information relevant to a particular user or users. One or more groups of information, such as the pages of an Internet site, or various data stores held within an organization, may be scanned, such as by providing the system 50 with one or more uniform resource locators (URLs). The system 50 may determine the occurrence, concurrence, and co-concurrence of certain terms, and may assign concurrence parameters to them. The system 50 may also identify particular terms having high occurrence rates relative to their occurrence rates in ordinary parlance, so as to indicate that those terms are special to the organization. Such terms may include, for example, the name of the organization and its affiliates, and may also refer to particular acronyms used by the organization. For example, an organization may have a corporate-wide nostalgic reference to e-mails as "wires," so that the organization's internal communications use the term "wire" much more often than it is used in normal parlance. A scan of the organization's documents (e.g., e-mails or other documents) would turn up this special usage and give the term "wire" a high occurrence rating.

This feature allows for a service by which organizations such as corporations or parts of corporations, can contract with service providers, such as telecommunications providers, to supply communication devices to employees of the corporation. The telecommunication provider, or its agent such as a search company, could scan the corporation's documents, and could thereby generate a custom dictionary specific to the organization, that can be loaded onto each communication device distributed under the contract. The device may also send information to a central system that identifies the user as a member of the organization so that updated dictionary information relevant to the organization may be passed to the user's device.

Figure 3 is a schematic diagram of a system 90 for receiving and using a user-specific data entry dictionary. The system 90 may be implemented in a device such as a personal communicator, e.g., a cellular telephone. The system 90 receives and transmits information wirelessly using transmitter 94, with the received signals being passed to signal processor 96, which may comprise digital signal processor (DSP) circuitry and the like. Normal voice communication is routed to or from audio processor 92, which may communicate with speaker/microphone 98, including via user interface 108.

User interface 108 handles all communication with the user of the system 90, including voice, visual, and data entry communication. Visual presentation of information may be provided via display screen 100. General data entry, apart from entered voice data, may occur through keypad 102, which may be arranged as a standard 12-key telephone keypad. The device may also be provided with appropriate control keys 104 for performing necessary control functions. Key pad 102 and control keys 104 may include contact push-buttons, joysticks, portions of touch-sensitive panels, or other appropriate input devices. Although the communication is shown for clarity as occurring through a single user interface 108, multiple interfaces may be used, and may be combined with other components as necessary.

The system 90 may be provided with a number of computer applications 114, such as games, applications to assist in dialing numbers, and applications to permit web browsing, including the entry of data as part of the web browsing. The applications may be stored in ROM, Flash memory, RAM, 1VIRAM, or otherwise, as appropriate, and may be accessed by the system 90 as needed. A dialing module 112 may provide standard dialing functionality for the system, receiving entered dialing digits or voice dialing instructions through interface 108, and providing appropriate dialing signals through transmitter 94 using communication interface 120.

A data entry module 110 receives data other than dialing instructions, such as search data entered into the system 90. The data entry module may provide the entered data directly to an application, or may employ disambiguation engine 116 to help translate the entered data. The disambiguation engine 116 may analyze entered information that would be reasonably interpreted as having multiple possible meanings, and may apply rules to information to determine or help determine what the user actually intended to enter.

In determining what was intended to be entered, disambiguation engine 116 may rely on dictionary 118, which may generate information about probable or cominon usage of words or other forms of data, or may be provided with such information, such as from a remote site througll transmitter 94.

Although shown in an implementation in a personal communicator, system 90 may take many other forms. For example, system 90 could be implemented as part of a personal computer, whether networked or unnetworked, and if networked, whether by wire or wirelessly. Also, data entry may occur in different manners, including by complete keyboard, constrained keyboard, or voice command. Also, one or more components may be located remotely from the system 90, such as at a remote server, and the functionality of system 90 may be provided by combining the components or using coinponents other than those shown.

Figure 4 is a flow chart showing exemplary steps for preparing information for a data entry dictionary. In general, the chart shows an implementation in which a system prepares a dictionary or dictionary supplement that is user-specific, e.g., containing information about the user, about a group of which the user is a member, or otherwise reflecting probable usage of terms by a user. At step 120, a repository list is received. The repository list may include a list of files or locations that contain information to be analyzed, and may include directions to a user's e-mail account or to particular data stores containing documents to be scanned. For example, the repository list may include the location of a user's e-mail account or out box, or locations at which files are stored for an organization. At step 122, the first site is scanned for information, and the information is parsed at step 124.
For exainple, each unique word at the site may be identified, and the absolute or relative number of occurrences of the word may also be tracked. At step 126, new terms identified at the site are added to a dictionary.

At step 128, a determination is made regarding whether all identified sites have been scanned. If they have not, a parameter tracking the list of sites to be scaimed is incremented at step 130, and another site is then scanned at step 122. If all the sites have been scanned, occurrence and concurrence scores or parameters for various terms may be generated at step 132.

As a relatively simple example, the total number of words in all the scanned documents may be computed, and the number of times each identified unique word appears may be divided into the total to create a normalized occurrence number for each word. Co-concurrence (n-gram) scores may also be generated between and among words. The type of each scanned document may also be tracked so that application-specific concurrence data may be generated. For example, concurrence data for e-mail communications may differ from that for more formal documents such as word processing documents, or less formal documents such as instant messaging. The concurrence data may be divided out according to scanned application, and the relevant data may then be accessed when a user is employing the corresponding application.

The system may allow additional data to be incorporated into the dictionary at step 134. For example, if a dictionary is being established for a large organization, the organization may specify that certain terms are to be included in the dictionary, and may also specify terms that are to have scores higher than the document analysis would otherwise indicate. The system may also present the dictionary for review 136, if such review is desired, before distributing the dictionary at step 138. The distribution may occur, for example, upon the commissioning of particular devices, or may occur by making the dictionary data available for automatic or manual download.
Distribution may occur at the time of handset creation, at the point of sale (after a user self-identifies as being part of a group) or even over the air at a later date. Dictionary updates may also occur at any relevant time.

In one implementation, the data store to be scanned may be a user's e-mail out box. The documents in the out box likely represent words and phrases that the user prefers to einploy, and thus likely will be good predictors for later data entry by the user. Also, the out box will commonly be populated with information not typically in a dictionary, such as common names, and e-mail addresses to which the user cominonly sends messages and web-sites commonly used.

Figure 5 is a flow chart showing exemplary steps for disambiguating information entered into a device. At step 150, a keystroke or other ambiguous data entry is received. Step 152 determines whether the keystroke represents a data key 152. If it does not, it represents some action to be performed, so the action is identified 154, and the system performs the action 156. For example, the keystroke may represent the submission of data that has been entered, or could represent a request to turn off the device.

If the keystroke represents entered data, the keystroke is added to a buffered sequence of keystrokes 158. The system may then use the sequence of keystrokes to determined the likely intent of the user in entering the keystrokes. In particular, the system may obtain possible data matches for the keystrokes 160 in the form of a solution set, which may be displayed as a list of possible matches for the keystroke, as explained more fi.illy with respect to Figure 7 below. The system may also prioritize the matches 162, such as by using concurrence data (e.g., occurrence data, concurrence data, or co-concurrence data).

If the system is set to resolve ambiguities automatically 164, the system may then determine whether sufficient data has been received to make a selection automatically. For example, if there is only one match in a d.ictionary for the entered keystrokes, the selection could easily be made by the systein. Also, rules may be established for making matches even when there is some ambiguity, such as when the score for the second-best-match is below a certain value, or the difference between the best and second-best scores exceeds a certain threshold.

The user may also be given an option to specify how "loose" or "tight"
the system will react before selecting matches automatically, so as to allow control over the number of erroneous selections (i.e., by specifying "tight"

operation). If the system has sufficient data to make a selection 166, it selects the appropriate entry 168. If it does not, it waits for the next keystroke. As one example, in a search application, the system may be established for an "I'm Feeling Doubly Lucky" mode. In such a mode, the system can select a word or phrase automatically when selection rules indicate an adequately high confidence that the selection is accurate, and may then automatically submit the word or phrase as a search request and direct the user to the information at the first matching search result (which is a traditional "I'm Feeling Lucky"
step).

If the system is not set to resolve ambiguities automatically, it may present possible matches to the user 170 for the user to select the desired match 172. The matches may be sorted according to the concurrence information stored in a system dictionary, or in another appropriate manner.
If the user does not make a selection, the system waits for another keystroke.

The user may also provide an end-of-entry indication, such as by entering a "1" on a telephone keypad, by pressing a control key, or by pressing the key designated as the space bar ("#") or a variety of other mechanisms, so as to force a selection.

The system may also determine the mode in which a user is entering information. In particular, when a cellular phone user enters keystrokes, the user could be dialing a number, using one-tap data entry requiring disambiguation, or using multiple-tap entry (e.g., if the user is entering a term such as a proper name, that they know will not be in their dictionary). The system may then simultaneously identify and present matches for each of these possibilities.

If the sequence of key presses does not match any predefined term (i.e., this is a new word), words may be added "on-the-fly." In such a situation, when the device determines that a word has been entered, but that there is no possible match, the device may provide a cue, such as by flashing the screen or beeping a particular tone or speaking a term or phrase. The user may then be given the opportunity to complete the word using standard, slower typing mechanisms (e.g., triple tap). When the word is complete by the alternative input metllod, it may be added automatically to the dictionary. At that time, it may also be assigned a probability, which would generally be a high probability because if the word was just used, it is likely to be used again.
Also, a user may be allowed to enter a predetermined key sequence to add a term in this manner before attempting to enter it using the disambiguating system. For example, if a user intends to enter anotlier person's complicated, and uncommon name, they could provide an appropriate indication so as to start triple tap entry immediately. The user may also be provided with other manners in which to indicate an intent to enter information by a more primitive method.

Also, where matches do not exist or the concurrence data is sufficiently bad for the terms that do match, the system may seek out additional information. Specifically, the device may make a request from a remote server, and obtain possible matches with their appropriate concurrence data.
The received infoimation may also be used to update the device's dictionary.
Where the connection between the remote device and the main systein has sufficient speed, remotely stored dictionary information can be transferred more often, including for each keystroke.

Figure 6 is a flow chart of exemplary steps providing data entry dictionary information in response to a request from a remote device. The flow chart is divided to indicate steps carried out by a server and those carried out by a client. As shown, the server may be any apparatus or system that is established to receive requests from users and provide responses, while the client may be any appropriate device or collection of eleinents operated by a user. In other words, the relationship is not limited to a formal client-server relationship.

At step 180, the client receives a search entry from a user, such as terms to search with a search engine. The client then transmits the entry as a search request 182, and the server receives the request 184. The server may generate a search result or results 186 by any appropriate means, including by many well-known search techniques.

The server may generate concurrence data 188, including data corresponding to the search request and results. The concurrence data may include other terins entered by other searchers who have used the particular search term in the past or in the recent past. For example, if the search term is "comics," the concurrence data may include terms such as "Dilbert,"
"Blondie ," "Beavis ," "Bart," "cartoons," and "animation." The concurrence data may also relate to data at the locations identified in the search results.
For example, if the search term is "Abraham Lincoln" and one of the search results is the Gettysburg Address, the concurrence information may include the phrase "four score" from that document. In this manner, the system may be prepared when a user opens the search result and wonders what "four score" means, and the user then starts to enter that phrase as a subsequent search term. The system could then complete the user's text entry more readily than it would without such user-specific information.

When the search result and concurrence data are assembled, the server may transmit them to the client 190, 192. The client may then integrate the concurrence data into its existing dictionary, to be used when it receives subsequent keystrokes 194. With the additional information, the matches to the user's entered keystrokes may be represented by a supplemental solution set 196. The supplemental solution set represents possible matches for the pressed keystrokes, as supplemented by the data from the server, and may also include the updated concurrence data from the server.

To prevent the dictionary from becoming overly large, and because information about a requested search may become out-of-date as soon as the user moves onto a new search topic, the system may reset the dictionary 198 upon the occurrence of an event, such as the running of a time interval or the resetting of the device. Also, if the dictionary reaches or approaches capacity, terms such as the present lowest probability terms may be removed, eitller singularly or in groups.

In another embodiment, the remote device may be constantly transmitting data about entered keystrokes as the user enters thein, i.e., when there is a fast connection between the client device and the server. As the user types, the server may be looking at related words, and may be providing constant updates to the dictionary, including a dictionary at the server site. Information may also be requested frequently, apart from the entry of searches by a user, such as by pinging a server for updated information. In this way, a device can periodically download updated dictionary information.

Figure 7 is a schematic diagram showing the logical tree-based organization of a data entry dictionary. Each node of the tree is represented by a circle, and represents a state that occurs upon the entry of a numerical keystroke on a conventionally-printed telephone keypad. The '1' has no letters on it, and can be used for purposes such as punctuation entry, or delineating the end of a particular data entry (like a space bar or an 'enter' key). Each single keystroke represents the entry of a single character for the user, but ambiguously represents three possible characters for the system (four possible characters for the "7" and "9" keys).

For example, the keystrokes 225 represent to the system the following:
[A or B or C] and [A or B or C] and [J or K or L]. This sequence could represent the word "ACK" uttered by Bill the Cat, or could represent the begimiing of other terms such as BALL, CALL, ABJECT, or ACKNOWLEDGE, among many others. If a user then enters the '3' key, the size of the solution set shrinks dramatically, so that only words having D, E, or F as their fourth character can be proper solutions-in the example, only ABJECT. In this manner, the entry of each additional character "prunes" the tree and leads the system closer to a small enough solution set that a selection can be made with a reasonable expectation that it will be accurate.

Keystrokes may also be interpreted in a pair-wise manner or other appropriate manner. Specif cally, a particular letter or character may be identified for each pair of keystrokes so as to allow for entering of certain data using traditional multi-key entry techniques. Characters identified in this manner may also be combined to create ambiguous combinations for presentation to the system. For example, if a telephone user presses 226393, the user could be attempting to enter 'BOY' using a multi-key entry technique. The person could also be using a single key technique to enter the following: [A or B or C] and [A or B or C] and [M or N or 0] and [D

or E or F] and [W or X or Y or Z] and [D or E or F]. The system may resolve both ambiguities, and present the results together for further resolution or completion.

The features just described for text entry may also be applied to systems that obtain data using voice recognition or other means, such as video recognition. The translation of input from a format such as voice may occur by any of a number of well-known means used to incorporate voice recognition with other data entry technologies. For example, sensed voice commands may be translated into a format such as VoiceXML or other usable format. Also, the system may operate on data entered in various different languages.

Other methods for providing input may also be used as appropriate. For example, the device may be provided with an accelerometer that may provide input. For example, the user may jerk the device to indicate that a term has been entered. Also, the user may selected items, such as from a list, by tilting the device forward or backward.

As used herein, the terms "electronic document" and "docuinent" mean a set of electronic data, including both electronic data stored in a file and electronic data received over a network. An electronic document does not necessarily correspond to a file. A docuinent may be stored in a portion of a file that holds other documents, in a single file dedicated to the document in question, or in a set of coordinated files.

Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, specially designed ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various implementations can include implementation in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

These computer programs (also known as programs, software, software applications or code) include machine instructions for a programmable processor, and can be implemented in a high-level procedural and/or object-oriented programming language, and/or in assembly/inachine language. As used herein, the term "machine-readable medium" refers to any computer program product, apparatus and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for exainple, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communieation network). Examples of communication networks inchtde a local area network ("LAN"), a wide area network ("WAN"), and the Internet.

The computing systein can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

Although a few embodiments have been described in detail above, other modifications are possible. Portions of this disclosure discuss operation though portable devices with constrained keyboards, but any of a nuinber of devices may be assisted, including fiilly-functional computers with f-ull keyboards. Also, the logic flows depicted in the figures do not require the particular order shown, or sequential order, to achieve desirable results.
Also, other steps may be provided, or steps may be eliminated, from the described flows, and other components may be added to, or removed from, the described systems. Other embodiments may be within the scope of the following claims.

Claims (35)

1. A computer-implemented method of providing text entry assistance data, comprising:
receiving at a computer information indicative of predictive textual outcomes;
generating dictionary data from the received information; and providing the dictionary data to text entry device remote from the computer.

2. The method of claim 1, wherein the received information relates to search requests made by a plurality of remote searchers.

3. The method of claim 2, wherein the received information is indicative of search term popularity.

4. The method of claim 1, wherein the dictionary data comprises a plurality of terms with a corresponding plurality of predictive weightings.

5. The method of claim 4, wherein the dictionary data includes weightings for co-concurrence events between two or more terms.

6. The method of claim 1, wherein the dictionary data is provided to the remote text entry device in response to a request from the device.

7. The method of claim 6, wherein the request comprises a search request, and the dictionary data is provided along with results to the search request.

8. The method of claim 1, wherein the received information is obtained as the result of crawling one or more information storage locations.

9. The method of claim 8, wherein the one or more information storage locations comprise e-mail storage.

10. The method of claim 8, wherein the one or more storage locations correspond to a predefined group of locations for an organization, and the dictionary data represents predictive textual outcomes for that organization.

11. The method of claim 1, further comprising compressing the dictionary data before providing it to the remote device.

12. The method of claim 1, wherein the dictionary data comprises supplemental data for addition to a preexisting dictionary.

13. The method of claim 1, further comprising receiving a search request, generating a search result, and providing the search result along with the dictionary data.

14. The method of claim 13, wherein the dictionary data comprises data from documents relating to the search result.

15. A data collection and distribution system, comprising:
a request processor to receive data requests from one or more remote clients;
a dictionary generator to produce information for use by the one or more clients containing predictive data entry information for the one or more clients; and a response formatter to receive information responsive to the data requests including predictive data entry information, and provide the information responsive to the data requests for use by the one or more clients.

16. The data collection and distribution system of claim 15, wherein the dictionary generator comprises a concurrence rater that calculates predicted concurrence scores for a plurality of objects.

17. The data collection and distribution system of claim 16, wherein the plurality of objects comprises a plurality of terms that may be entered by a user in generating a data request.

18. The data collection and distribution system of claim 16, further comprising an object picker to identify objects in a document for submission to the concurrence rater.

19. The data collection and distribution system of claim 18, wherein the object picker is adapted to scan a plurality of defined documents for data indicative of the occurrence of words in the documents and concurrence between words in the documents.

20. The data collection and distribution system of claim 15, further comprising a search engine to receive a plurality of requests and to provide the requests for transmission by the response formatter along with predictive data entry information.

21. A computer-implemented system for providing information indicative of probable usage of objects by the user of a data entry device, comprising:
means for obtaining documents containing objects indicative of usage by, a user or user;
a concurrence rater to analyze the documents for usage data of objects in the documents and to generate associated concurrence ratings; and an interface to transmit the concurrence ratings to a data entry device.

22. A computer-implemented method of disambiguating ambiguous information provided to a computing device, comprising:
identifying a set of possible matches for the ambiguous information;
retrieving occurrence data indicative of the probable intended usage of the ambiguous information, the occurrence data reflecting recent usage practices of a user or users; and providing an indication of a probable match from the set of possible matches and the occurrence data.

23. The computer-implemented method of claim 22, further comprising retrieving concurrence data indicative of information having an expected usage in combination with one or more matches of the set of possible matches; and providing an indication of a probable match from the set of possible matches, the occurrence data, and the concurrence data.

24. The computer-implemented method of claim 22, wherein the set of possible matches is identified using a tree-pruned data structure.

25. The computer-implemented method of claim 22, further comprising automatically selecting a match.

26. The computer-implemented method of claim 25, further comprising submitting the automatically selected match to a remote server.

27. The computer-implemented method of claim 25, wherein the match is selected automatically when a score of a best possible match exceeds a score of a second-best possible match by a predetermined level.

28. The computer-implemented method of claim 22, wherein the indication of a probable match is based on data entered and concurrence levels between possible matches and previously entered data.

29. The computer-implemented method of claim 22, further comprising obtaining a match, and increasing the occurrence level for the match.

30. A communication device, comprising:
a transceiver to receive and transmit information;
a vocabulary repository containing information indicative of the probable intended usage of ambiguous information entered by a user of the device, the occurrence data reflecting usage practices of the user or another user or users;
and a disambiguation engine to resolve the ambiguous information provided to the device to a probable solution by identifying possible solutions and to apply the information indicative of probable intended usage to the possible solutions.

31. The communication device of claim 30, wherein the transmitter comprises a wireless transmitter.

32. The communication device of claim 30, wherein the occurrence data contains data that represents usage practices by members of a demographic group.

33. The communication device of claim 30, further comprising a display to present one or more of the identified possible solutions in order from most probable solution to least probable solution.

34. The communication device of claim 30, wherein the disambiguation engine is configured to select a solution and provide the solution to the transceiver for transmission.

35. The communication device of claim 34, wherein the vocabulary repository can be updated with information indicative of probable intended usage based on of the selected solution.