US 7,788,266 B2Grant
Method and system for processing ambiguous, multi-term search queries
Issue Date:2010-08-31
•31 Claims
•11 Drawing Sheets
Abstract
In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query is a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user.
Metadata
Assignee
- Veveo, Inc.
Inventors
- Sashikumar Venkataraman
- Rakesh D. Barve
- Pankaj Garg
- Pranav Rajanala
- Murali Aravamudan
- Ajit Rajasekharan
Application Information
Application Number:US 11/235,928
Filing Date:2005-09-27
Priority Date:2005-08-26
Art Unit:2161
Classifications
IPC:
G06F7/00
Patent Drawings (11 sheets)
Description
Related Applications
[0001] The present invention is based on and claims priority from U.S. Patent Application Ser. No. 60/716,101, filed Sep. 12, 2005, and entitled “Method And System For Incremental Search With Reduced Text Entry Using A Reduced Keypad With Overloaded Keys,” and U.S. Patent Application No. 60/711,866, filed Aug. 26, 2005, and entitled “A Dynamic Highlighting Interface of Multi Word Prefixes of Results Obtained by Incremental Search with Reduced Text Entry on Television and Mobile Devices Using a Keypad with Overloaded Keys,”, both of which are incorporated by reference herein in their entirety.
Background of the Invention
[0002] 1. Field of Invention
[0003] The present invention generally relates to processing search queries and, more particularly, to methods and systems for processing ambiguous, reduced text, multi-term search queries.
[0004] 2. Description of Related Art
[0005] There are many user-operated devices such as mobile phones, PDAs (personal digital assistants), and television remote control devices that have small keypads, which a user can use for text entry. In many of these devices, largely because of device size restrictions, the keypad is small and has only a small number of keys, which are overloaded with alpha-numeric characters. Text input using these keypads is cumbersome.
[0006] FIG. 1 illustrates a common twelve-key keypad interface found in many cell phones and other mobile devices, and also increasingly in television remote control devices. The keypad 10 includes twelve keys 12, most of which are overloaded with multiple alphanumeric characters or functions. The same key can be used to enter different characters. For instance, the “2” key can be used to enter the number “2” and the letters “A”, “B” and “C”. Text entry using such a keypad with overloaded keys can result in an ambiguous text entry, which requires some type of a disambiguation action. For instance, with a multi-press interface, a user can press a particular key multiple times in quick succession to select a desired character (e.g., to choose “B”, the user would press the “2” key twice quickly, and to choose “C”, the user would press the key three times). Alternatively, text entry can be performed using T9 and other text input mechanisms that provide vocabulary based completion choices for each word entered. Neither of these methods is however particularly useful for performing searches because of the number of steps needed to get to the result. One deficiency of the multi-press interface is that too many key strokes are needed. A drawback of applying a vocabulary based word completion interface is the need for the additional step of making a choice from a list of all possible word matches generated by the ambiguous text input. Furthermore vocabulary based word disambiguation systems are designed typically for composition applications (as opposed to search applications) where user explicitly disambiguates each word by performing a word completion action to resolve that word before proceeding to the next word in the composition.
Brief Summary of Embodiments of the Invention
[0007] In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query comprises a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user.
[0008] These and other features will become readily apparent from the following detailed description wherein embodiments of the invention are shown and described by way of illustration. As will be realized, the invention is capable of other and different embodiments and its several details may be capable of modifications in various respects, all without departing from the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature and not in a restrictive or limiting sense with the scope of the application being indicated in the claims.
Brief Description of the Drawings
[0009] For a more complete understanding of various embodiments of the present invention, reference is now made to the following descriptions taken in connection with the accompanying drawings in which:
[0010] FIG. 1 illustrates a keypad with overloaded keys in accordance with the prior art.
[0011] FIG. 2 illustrates a search system in accordance with one or more embodiments of the invention.
[0012] FIG. 3 illustrates various device configuration options for a device for performing searches in accordance with one or more embodiments of the invention.
[0013] FIG. 4 is a flow chart illustrating a method for finding results with reduced text entry using an overloaded keypad in accordance with one or more embodiments of the invention.
[0014] FIG. 5 illustrates a many-to-many mapping of terms to the numeric equivalents.
[0015] FIG. 6 illustrates the two different couplings between multiple terms in a query.
[0016] FIG. 7 illustrates a data structure for retrieving results incrementally for each character input using the many-to-many mapping scheme in accordance with one or more embodiments of the invention.
[0017] FIGS. 8A to 8C illustrate the incremental results retrieved when a user enters characters in a search query in accordance with one or more embodiments of the invention.
[0018] Like reference numerals generally refer to like elements in the drawings.
Detailed Description of the Preferred Embodiments
[0019] Briefly, methods and systems are provided in accordance with various embodiments of the invention for performing searches using ambiguous text input from devices having limited text input interfaces.
[0020] As described in further detail below, in accordance with various embodiments of the invention, methods and systems are provided for processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The descriptors can include words in the name of the item or other information relating to the item. For example, in a television application, the item can be a television content item such as a movie, and the descriptors can be information on the title of the movie, the cast, directors, and other keywords and descriptions of the movie.
[0021] Using the text input interface, the user can enter an ambiguous search query directed at identifying a desired item. The search query comprises a prefix substring of each of at least two words relating to the desired item. A prefix substring of a word is a variable length string of characters that contains fewer than all the characters making up the word.
[0022] The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The group of the one or more items is displayed on the device operated by the user. The items are preferably displayed in an order of expected interest to the user.
[0023] The user types in the multiple term prefix input query by pressing overloaded keys of the text input interface once to form an ambiguous query string. In accordance with one or more embodiments of the invention, the search space is initially indexed by performing a many-to-many mapping from the alphanumeric space of terms to numeric strings corresponding to the various prefixes of each alphanumeric term constituting the query string. In a numeric string, each alphanumeric character in the string is replaced by its corresponding numeric equivalent based on, e.g., the arrangement of characters on the commonly used twelve-key reduced keypad shown in FIG. 1 . This mapping scheme enables the system in accordance with one or more embodiments to incrementally retrieve results matching the ambiguous alphanumeric input query, as the user types in each character of the query. The user does not have to explicitly specify the termination of each term to assist the system in disambiguating the input query; instead, the user only enters an input query that includes prefix substrings from multiple terms. The system can leverage off the multiple term prefixes to disambiguate it. The multiple term prefix based disambiguation method in accordance with one or more embodiments of the invention reduces the amount of text and steps needed to enter a multiple term input query and retrieve results.
[0024] There are various possible applications for the search techniques described herein including, e.g., assisting television viewers in identifying desired television content items and channels, and assisting users of mobile devices such as cell phones and PDAs in performing searches for items in various databases (e.g., performing searches in directories of people or businesses, and searching for and purchasing products/services like airline tickets).
[0025] In the context of television systems, the term “television content items” can include a wide variety of video/audio content including, but not limited to, television shows, movies, music videos, or any other identifiable content that can be selected by a television viewer. Searching for television content items can be performed across disparate content sources including, but not limited to, broadcast television, VOD, IPTV, and PVR (local and network).
[0026] FIG. 2 schematically illustrates an overall system for performing searches with reduced text entry using various devices in accordance with one or more embodiments of the invention. The system includes a server farm or system 202, a network 204, and a variety of devices 206, 208, 210 operated by users with text input interfaces. In accordance with one or more embodiments of the invention, the server 202 processes search queries received from the user devices 206, 208, 210. In other embodiments, the search queries are processed on the devices themselves. As discussed below, the server 202 can be the source of search data and relevance updates. If part of a television system, the server 202 can also be the source of or be linked to a source of at least some of the available television content (e.g., a cable or satellite television operator).
[0027] The network 204 functions as the distribution framework for transmitting data from the server 202 to the devices operated by the users. The distribution network 204 could be wired or wireless connections or some combination thereof. Examples of possible networks include computer networks, cable television networks, satellite television networks, IP-based television networks, and mobile communications networks (such as, e.g., wireless CDMA and GSM networks).
[0028] The search devices could have a wide range of interface capabilities. A device, e.g., could be a hand-held mobile communications device 206 such as a phone or PDA having a limited display size and a reduced keypad with overloaded keys. Another type of search device is a television system 207 with a remote control device 208 having an overloaded keypad. Another possible search device is a Personal Computer (PC) 210 with a full or reduced keyboard and a computer display.
[0029] FIG. 3 illustrates multiple exemplary configurations for search devices in accordance with various embodiments of the invention. In one configuration, a search device (e.g., PC 210) can have a display 302, a processor 304, volatile memory 306, text input interface 308, remote connectivity 310 to the server 202 through the network 204, and a persistent storage 312. A device configuration for a device such as the hand-held device 206 might not include local persistent storage 312. In this case, the device 206 could have remote connectivity 310 to submit the query to the server 202 and retrieve results from it. Another configuration of the devices 206, 208, 210 may not have remote connectivity 310. In this case, the search database may be locally resident on a local persistent storage 312. The persistent storage 312 may be, e.g., a removable storage element such as SD, SmartMedia, CompactFlash card etc. In a configuration of the device with remote connectivity 310 and persistent storage 312 for performing searches (e.g., a television system 207), the device may use the remote connectivity for search relevance data update or for the case where the search database is distributed on the local storage 312 and on the server 202. A preferred configuration in a memory constrained device is the search data residing remotely on a server. Unlike composition applications where the “most frequently used or popular terms space” are small in size and can be maintained in a local vocabulary, search spaces are typically larger inherently because people instinctively use “unique word signatures” to recall a document of interest. Hence maintaining search spaces locally may not be practical in many devices that have insufficient local memory, making a network based search configuration preferable.
[0030] In one exemplary embodiment, a television system 207 may have a set-top box or other device with a one-way link to a satellite network. In this configuration, all search data including relevance updates may be downloaded to the device through a satellite link to perform local searching. In this case, the set-top box preferably has sufficient storage capacity to maintain search spaces locally. Local storage is preferably large in this case to circumvent the deficiency of a one-way link.
[0031] FIG. 4 illustrates a search process in accordance with one or more embodiments of the invention. At step 402, the user enters a character using an ambiguous text input interface, e.g., using a keypad with overloaded keys where a single key press is performed for each character entered. At 404, an incremental search system determines and displays results that match the input character entered at 402. Since the input is ambiguous, the match of results would include the matches for all the ambiguous input characters represented by the single key press. To address this increased set of matches, an ordering scheme is preferably used to order the results to improve accessibility to results expected to be more of interest to the user. The ordering of results can be based on a variety of criteria including, e.g., temporal relevance, location relevance, popularity and personal preferences (that may have been determined implicitly or explicitly) or some combination of these criteria. (In a television application, temporal relevance can be used to favor programs whose timing may be more of interest to the viewer. For example, if the user entered NBA, then the system would list the games in order of temporal relevance such as those in progress or are scheduled to begin in the near future are listed at the higher on the list. The popularity criterion can be used to favor programs or channels that are more popular than others. The personal preference criterion can be used to favor programs or channels that the user has indicated preference for in prior user selections. For example, if a user frequently scrolls down to “CNBC” and selects it, the system would over time place CNBC higher in the list of results over a more generally popular channel such as CNN. Furthermore, identity independent time-based usage pattern learning algorithms can be applied in conjunction with personalization to apply the results ordering rules in an appropriate context. Also, e.g., when using a PDA or cell phone to search for a business, the system may use location relevance as part of the ordering criteria.)
[0032] In addition, other ordering schemes can also or instead be used such as, e.g., character count based subspace biasing, examples of which are described in U.S. Patent Application Ser. No. 60/695,463 entitled “Method And System For Incremental Search With Minimal Text Entry On Television Where The Relevance Of Results Is A Dynamically Computed Function Of User Input Search String Character Count” and filed on Jun. 30, 2005, which is assigned to the assignee of the present application and is incorporated by reference herein in its entirety.
[0033] The ordering criteria can give preference to the results matching the search query based on a lexical match of the type of query input, e.g., in the following order of preference: single term prefixes, multiple term prefixes, and lastly abbreviation matches.
[0034] If the user does not find the desired results at 406, he or she can continue to enter more characters to the search query at step 402. Then at step 404, the system will perform the search based on the cumulative substring of characters of the search query entered by the user up to that point.
[0035] FIG. 5 illustrates an example of the many-to-many mapping scheme from an alphanumeric terms space to a numeric string space. The exemplary terms “TOON”, “TOM”, “TOMMY”, which can be search terms entered by a television viewer to identify television content, are mapped to the numeric equivalents of their prefix strings: “T”(8), “TO”(86), “TOO”(866), “TOON”(8666), “TOMMY”(86669). This many-to-many mapping scheme enables incremental search processing by enabling even a single character entered by the user to retrieve relevant results. This many-to-many mapping is done during an indexing phase for all terms that can be used to discover a result.
[0036] FIG. 6 illustrates the two broad categories of multiple prefix terms 602 that can be used in search queries. The terms 602 can be tightly coupled terms 604, which are closely related such the terms from movie title or name of a person (e.g., all the terms in the names Gods Must Be Crazy, and Harrison Ford). The terms may be either ordered or unordered (e.g., Ford Harrison or Harrison Ford). Loosely coupled terms 606, on the other hand, are terms that are semantically related, e.g., as in the terms “Tom Volleyball” (Tom Hanks playing a role in a movie cast away with volleyball being a keyword). The prefix based multiple terms input described herein, in addition to being an intuitive mechanism for reduced text input significantly reduces the size of the result space compared to other search techniques in which any query substring could match with results. With these other search techniques, the ambiguity in input could significantly increase the result space size, particularly when the number of characters input is low. This would force the user to enter more characters and diminish the effectiveness of the search process.
[0037] FIG. 7 illustrates a trie data structure that can be used in identifying search results in accordance with one or more embodiments of the invention. Each node 702 of the structure has numerical values from 0-9. Each node has the top M records 704 (determined from some ordering criteria) preferably in “in-memory” storage, which can be a memory that permits quick retrieval. These records are returned immediately to user based on the match string. The illustrated diagram shows the layout of the data structure for the terms “TOMMY BOY”. The number of prefix terms and the size of the prefix terms used for pre-computing the trie index are determined by the memory availability and computational capabilities of the system. One example of a trie structure used for incremental searching is described in U.S. patent application Ser. No. 11/136,261 entitled “Method And System For Performing Searches For Television Content Using Reduced Text Input”, which is incorporated by reference herein in its entirety. In the FIG. 7 example, the size of the prefix terms used is 2 and the number of terms for pre-computing the trie index is 2. So when the user enters any of the search queries, “8 269”(T BOY), “86 269”(TO BOY), “8 2”(T B), “86 2”(T BO), the results would be retrieved from the top M records 704 if present there. If it is beyond the top M records, the records are retrieved from the secondary storage structure 706 if it is present there. If the results are not found in the secondary structure either, the system can perform an intersection of the top “N” records (N>=M) for the individual terms, in this case, e.g., “T BOY”. In preferred embodiments of the invention, the system would return the results obtained both from the trie walk (where results are obtained either from the top “M” records or from the secondary memory) and from the intersection method, where the intersection method would be deployed once the input character count exceeds a given threshold. The multiple prefix terms based search is thus realized in accordance with one or more embodiments of the invention preferably by the combination of a (1) trie walk whose strength and efficiency is highest when input character count is low, and (2) an intersection process whose strength and efficiency is highest when the input character count is above a given threshold.
[0038] One characteristic of this method of multiple prefix terms based search in accordance with one or more embodiments of the invention is the absence of an explicit term/word termination action. In other words, the system does not require each word in a search entry to be successively and separately resolved. The system in accordance with one or more embodiments of the invention disambiguates the input by leveraging off the multiple terms (both in the case of loosely coupled and tightly coupled terms).
[0039] FIGS. 8A-8C illustrate the incremental results obtained for an exemplary search query as characters of the query are input by a user in a television application. In FIG. 8A , the user has input a single character “5” with the intention that the character represent the letter “J”. In this example, the user's intent is to find “Tom and Jerry” television programs, and starts with entering “Jerry” in an unordered input. However, there are multiple matches for different terms due to the input ambiguity since the single button pressed represents several characters, in this case results relate to Koala, Lola, Life etc. These terms are ordered in the displayed results list 802, e.g., by the popularity of the matching document and the relevance of the matching term to the document, and displayed on the users' television screen.
[0040] As the user has not found the desired content relating to Tom and Jerry, he or she enters additional characters in the search query. As shown in FIG. 8B , the user enters a multiple term text input: “5 86”, which is intended to represent the letters “J TO”. The results for this query are shown at 804. Because of the input ambiguity ([Koala, Tooth], [Hallie Todd in cast for Lizzie McGuire] etc.), matches for several unrelated programs are retrieved and displayed.
[0041] As shown in FIG. 8C , the user then inputs a further character in the search query: “5 866”, which is intended to represent “J TOM”. With this further character input, the system is able to identify the content of interest, and displays the results in list 806.
[0042] Methods of processing ambiguous search query inputs from users in accordance with various embodiments of the invention are preferably implemented in software, and accordingly one of the preferred implementations is as a set of instructions (program code) in a code module resident in the random access memory of a computer. Until required by the computer, the set of instructions may be stored in another computer memory, e.g., in a hard disk drive, or in a removable memory such as an optical disk (for eventual use in a CD ROM) or floppy disk (for eventual use in a floppy disk drive), or downloaded via the Internet or some other computer network. In addition, although the various methods described are conveniently implemented in a general purpose computer selectively activated or reconfigured by software, one of ordinary skill in the art would also recognize that such methods may be carried out in hardware, in firmware, or in more specialized apparatus constructed to perform the specified method steps.
[0043] Having described preferred embodiments of the present invention, it should be apparent that modifications can be made without departing from the spirit and scope of the invention.
[0044] Method claims set forth below having steps that are numbered or designated by letters should not be considered to be necessarily limited to the particular order in which the steps are recited.
Claims
The invention claimed is:
1. A user-interface method for searching a relatively large set of content items in response to unresolved keystroke entry by a user from a keypad with overloaded keys in which a given key is in fixed association with a plurality of alphabetical and numerical symbols and the entry has relatively few keystrokes so that a subset of targeted content item results is quickly presented, the method comprising:
using an ordering criteria to rank and associate subsets of content items with corresponding strings of one or more unresolved keystrokes for overloaded keys so that the subsets of content items are directly mapped to the corresponding strings of unresolved keystrokes;
subsequent to ranking and associating the content items with strings of unresolved
keystrokes, receiving a first unresolved keystroke from a user, wherein one of the plurality of alphabetical and numerical symbols in fixed association with the first unresolved keystroke is a symbol the user is using to search for desired content items;
selecting and presenting the subset of content items that is associated with the first unresolved keystroke based on the direct mapping of unresolved keystrokes to the subsets of content items;
subsequent to receiving the first unresolved keystroke, receiving subsequent unresolved keystrokes from the user and forming a string of unresolved keystrokes including the first unresolved keystroke and the subsequent unresolved keystrokes in the order received; an
selecting and presenting the subset of content items that is associated with the string of unresolved keystrokes received based on the direct mapping of unresolved keystrokes to the subsets of content items;
wherein at least one of selecting the subset of content items associated with the first unresolved keystroke and selecting the subset of content items associated with the string of unresolved keystrokes is performed using a data structure or a term intersection process or a combination thereof, the data structure including a first storage structure and a second storage structure, the first storage structure including a plurality of subsets of content items, each subset being associated with a corresponding string of unresolved keystrokes, wherein using the data structure to select a subset of content items includes returning the subset of content items of the first storage structure that is associated with the string of unresolved keystrokes entered by the user and retrieving additional content items from the second storage structure if the desired content items are not present in the first storage structure.
2. The method of claim 1 wherein said ordering criteria include one or more of: temporal relevance, location relevance, popularity, personal preferences and character count.
3. The method of claim 1 wherein associating subsets of content items with corresponding strings of unresolved keystrokes comprises indexing said content items by performing a many-to-many mapping of descriptors associated with said content items to unresolved keystroke strings corresponding to various search query prefix substrings.
4. The method of claim 1 wherein the user presses one of said overloaded keys once to generate each character of said unresolved keystroke entry.
5. The method of claim 1 wherein said unresolved keystroke entry comprises words in an ordered format.
6. The method of claim 1 wherein said unresolved keystroke entry comprises words in an unordered format.
7. The method of claim 1 wherein said unresolved keystroke entry comprises words separated by a word separator.
8. The method of claim 1 wherein said unresolved keystroke entry is processed by a server system remote from said user.
9. The method of claim 1 wherein said unresolved keystroke entry is processed by said device operated by said user.
10. The method of claim 1 further comprising determining descriptors to describe the content items, wherein content items having similar descriptors are grouped into the same subsets of content items.
11. The method of claim 10 wherein said content items comprise television content items, and wherein each descriptor includes title, cast, director, description, or keyword information relating to a content item.
12. The method of claim 1 wherein said content items include a product or service sought by the user.
13. The method of claim 1 wherein the unresolved keystrokes are input by a user on one of a cell phone, a PDA or a remote control device for a television.
14. The method of claim 1, further comprising, from time-to-time, using the ordering criteria to update the subsets of content items associated with the corresponding strings of one or more unresolved keystrokes.
15. A system for searching a relatively large set of content items in response to unresolved keystroke entry by a user from a keypad with overloaded keys in which a given key is in fixed association with a plurality of alphabetical and numerical symbols and the entry has relatively few keystrokes so that a subset of targeted content item results is quickly presented, the system comprising:
a collection of subsets of content items associated with corresponding strings of one or more unresolved keystrokes for overloaded keys, the subsets of content items being ranked and associated with the content items based on an ordering criteria so that the subsets of content items are directly mapped to the corresponding strings of unresolved keystrokes; and
a computer memory comprising instructions for causing a computer system to:
receive a first unresolved keystroke from a user, wherein one of the plurality of alphabetical and numerical symbols in fixed association with the first unresolved keystroke is a symbol the user is using to search for desired content items select and present the subset of content items that is associated with the first unresolved keystroke based on the direct mapping of unresolved keystrokes to the subsets of content items;
subsequent to receiving the first unresolved keystroke, receive subsequent unresolved keystrokes from the user and form a string of unresolved keystrokes including the first unresolved keystroke and the subsequent unresolved keystrokes in the order received; and
select and present the subset of content items that is associated with the string of unresolved keystrokes received based on the direct mapping of unresolved keystrokes to the subsets of content items;
wherein at least one of selecting and presenting the subset of content items that is associated with the first unresolved keystroke and selecting and presenting the subset of content items that is associated with the string of unresolved keystrokes selects the subset of content items using a data structure or a term intersection process or a combination thereof, the data structure including a first storage structure and a second storage structure, the first storage structure including a plurality of subsets of content items, each subset being associated with a corresponding string of unresolved keystrokes, wherein using the data structure to select a subset of content items includes returning the subset of content items of the first storage structure that is associated with the string of unresolved keystrokes entered by the user and retrieving additional content items from the second storage structure if the desired content items are not present in the first storage structure.
16. The system of claim 15 wherein said ordering criteria include one or more of: temporal relevance, location relevance, popularity, personal preferences and character count.
17. The system of claim 15 wherein the collection of subsets of content items associated with corresponding strings includes a many-to-many mapping of descriptors associated with said content items to unresolved keystroke strings corresponding to various search query prefix substrings.
18. The system of claim 15 wherein the user presses one of said overloaded keys once to generate each character of said unresolved keystroke entry.
19. The system of claim 15 wherein said unresolved keystroke entry comprises words in an ordered format.
20. The system of claim 15 wherein said unresolved keystroke entry comprises words in an unordered format.
21. The system of claim 15 wherein said unresolved keystroke entry comprises words separated by a word separator.
22. The system of claim 15 wherein at least one of receiving a first unresolved keystroke from the user, selecting and presenting the subset of content items that is associated with the first unresolved keystroke, receiving subsequent unresolved keystrokes from the user and forming a string of unresolved keystrokes, and selecting and presenting the subset of content items that is associated with the string of unresolved keystrokes occurs on a server system remote from said user.
23. The system of claim 15 wherein at least one of receiving a first unresolved keystroke from the user, selecting and presenting the subset of content items that is associated with the first unresolved keystroke, receiving subsequent unresolved keystrokes from the user and forming a string of unresolved keystrokes, and selecting and presenting the subset of content items that is associated with the string of unresolved keystrokes occurs on said device operated by said user.
24. The system of claim 15 wherein content items having similar descriptors are grouped into the same subsets of content items.
25. The system of claim 24 wherein said content items comprise television content items, and wherein each descriptor includes title, cast, director, description, or keyword information relating to a content item.
26. The system of claim 15 wherein said items comprise products or services sought by said user.
27. The system of claim 15 wherein the unresolved keystrokes are input by a user on one of a cell phone, a PDA or a remote control device for a television.
28. The system of claim 15, the computer memory further comprising instructions for causing the computer system to use the ordering criteria to update the subsets of content items associated with the corresponding strings of one or more unresolved keystrokes from time-to-time.
29. The system of claim 15, wherein at least a portion of the collection of subsets of content items associated with corresponding string of one or more unresolved keystrokes is on a server system remote from said user.
30. The system of claim 15, wherein at least a portion of the collection of subsets of content items associated with corresponding string of one or more unresolved keystrokes is on said device operated by said user.
31. The system of claim 15, wherein said content items comprise information about audio/video content.
Patent Citations (219)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US1261167(A) | 1918-04-01 | Russell | Applicant |
| US4045777(A) | 1977-08-01 | Mierzwinski et al. | Applicant |
| US4453217(A) | 1984-06-01 | Boivie | Applicant |
| US4760528(A) | 1988-07-01 | Levin | Applicant |
| US4893238(A) | 1990-01-01 | Venema | Applicant |
| US5224060(A) | 1993-06-01 | Ma et al. | Applicant |
| US5337347(A) | 1994-08-01 | Halstead-Nussloch et al. | Applicant |
| US5369605(A) | 1994-11-01 | Parks | Applicant |
| US5487616(A) | 1996-01-01 | Ichbiah | Applicant |
| US5532754(A) | 1996-07-01 | Young et al. | Applicant |
| US5623406(A) | 1997-04-01 | Ichbiah | Applicant |
| US5635989(A) | 1997-06-01 | Rothmuller | Applicant |
| US5745889(A) | 1998-04-01 | Burrows | Applicant |
| US5774588(A) | 1998-06-01 | Li | Applicant |
| US5802361(A) | 1998-09-01 | Wang et al. | Applicant |
| US5805155(A) | 1998-09-01 | Allibhoy et al. | Applicant |
| US5818437(A) | 1998-10-01 | Grover et al. | Applicant |
| US5828420(A) | 1998-10-01 | Marshall et al. | Applicant |
| US5828991(A) | 1998-10-01 | Skiena et al. | Applicant |
| US5835087(A) | 1998-11-01 | Herz et al. | Applicant |
| US5859662(A) | 1999-01-01 | Cragun et al. | Applicant |
| US5880768(A) | 1999-03-01 | Lemmons et al. | Applicant |
| US5912664(A) | 1999-06-01 | Eick et al. | Applicant |
| US5937422(A) | 1999-08-01 | Nelson et al. | Applicant |
| US5945928(A) | 1999-08-01 | Kushler et al. | Applicant |
| US5945987(A) | 1999-08-01 | Dunn | Applicant |
| US5953541(A) | 1999-09-01 | King et al. | Applicant |
| US6005565(A) | 1999-12-01 | Legall et al. | Applicant |
| US6005597(A) | 1999-12-01 | Barrett et al. | Applicant |
| US6006225(A) | 1999-12-01 | Bowman et al. | Applicant |
| US6009459(A) | 1999-12-01 | Belfiore et al. | Applicant |
| US6011554(A) | 2000-01-01 | King et al. | Applicant |
| US6041311(A) | 2000-03-01 | Chislenko et al. | Applicant |
| US6047300(A) | 2000-04-01 | Walfish et al. | Applicant |
| US6075526(A) | 2000-06-01 | Rothmuller | Applicant |
| US6133909(A) | 2000-10-01 | Schein et al. | Applicant |
| US6169984(B1) | 2001-01-01 | Bogdan | Applicant |
| US6184877(B1) | 2001-02-01 | Dodson et al. | Applicant |
| US6189002(B1) | 2001-02-01 | Roitblat | Applicant |
| US6223059(B1) | 2001-04-01 | Haestrup et al. | Applicant |
| US6260050(B1) | 2001-07-01 | Yost et al. | Applicant |
| US6266048(B1) | 2001-07-01 | Carau, Sr. | Applicant |
| US6266814(B1) | 2001-07-01 | Lemmons et al. | Applicant |
| US6269361(B1) | 2001-07-01 | Davis et al. | Applicant |
| US6286064(B1) | 2001-09-01 | King et al. | Applicant |
| US6292804(B1) | 2001-09-01 | Ardoin et al. | Applicant |
| US6307548(B1) | 2001-10-01 | Flinchem et al. | Applicant |
| US6307549(B1) | 2001-10-01 | King et al. | Applicant |
| US6377945(B1) | 2002-04-01 | Risvik | Examiner |
| US6438579(B1) | 2002-08-01 | Hosken et al. | Applicant |
| US6438751(B1) | 2002-08-01 | Voyticky et al. | Applicant |
| US6466933(B1) | 2002-10-01 | Huang et al. | Applicant |
| US6529903(B2) | 2003-03-01 | Smith | Applicant |
| US6564213(B1) | 2003-05-01 | Ortega et al. | Examiner |
| US6564313(B1) | 2003-05-01 | Kashyap | Applicant |
| US6594657(B1) | 2003-07-01 | Livowsky et al. | Applicant |
| US6600496(B1) | 2003-07-01 | Wagner et al. | Applicant |
| US6614455(B1) | 2003-09-01 | Cuijpers et al. | Applicant |
| US6615248(B1) | 2003-09-01 | Smith | Applicant |
| US6631496(B1) | 2003-10-01 | Li et al. | Applicant |
| US6721954(B1) | 2004-04-01 | Nickum | Applicant |
| US6732369(B1) | 2004-05-01 | Schein et al. | Applicant |
| US6757906(B1) | 2004-06-01 | Look et al. | Applicant |
| US6766526(B1) | 2004-07-01 | Ellis | Applicant |
| US6772147(B2) | 2004-08-01 | Wang | Applicant |
| US6785671(B1) | 2004-08-01 | Bailey et al. | Applicant |
| US6801909(B2) | 2004-10-01 | Delgado et al. | Applicant |
| US6839702(B1) | 2005-01-01 | Patel et al. | Applicant |
| US6839705(B1) | 2005-01-01 | Grooters | Applicant |
| US6850693(B2) | 2005-02-01 | Young et al. | Applicant |
| US6865575(B1) | 2005-03-01 | Smith et al. | Applicant |
| US6865746(B1) | 2005-03-01 | Herrington et al. | Applicant |
| US6907273(B1) | 2005-06-01 | Smethers | Applicant |
| US6965374(B2) | 2005-11-01 | Villet et al. | Applicant |
| US7013304(B1) | 2006-03-01 | Schuetze et al. | Examiner |
| US7117207(B1) | 2006-10-01 | Kerschberg et al. | Applicant |
| US7130866(B2) | 2006-10-01 | Schaffer | Applicant |
| US7136854(B2) | 2006-11-01 | Smith et al. | Examiner |
| US7146627(B1) | 2006-12-01 | Ismail et al. | Applicant |
| US7149983(B1) | 2006-12-01 | Robertson et al. | Applicant |
| US7213256(B1) | 2007-05-01 | Kikinis | Applicant |
| US7225180(B2) | 2007-05-01 | Donaldson et al. | Applicant |
| US7225184(B2) | 2007-05-01 | Carrasco et al. | Applicant |
| US7225455(B2) | 2007-05-01 | Bennington et al. | Applicant |
| US7269548(B2) | 2007-09-01 | Fux et al. | Applicant |
| US7293231(B1) | 2007-11-01 | Gunn et al. | Applicant |
| US7487151(B2) | 2009-02-01 | Yamamoto et al. | Applicant |
| US7594244(B2) | 2009-09-01 | Scholl et al. | Applicant |
| US2002/0002550(A1) | 2002-01-01 | Berman | Examiner |
| US2002/0042791(A1) | 2002-04-01 | Smith et al. | Applicant |
| US2002/0052873(A1) | 2002-05-01 | Delgado et al. | Applicant |
| US2002/0059621(A1) | 2002-05-01 | Thomas et al. | Applicant |
| US2002/0083448(A1) | 2002-06-01 | Johnson | Applicant |
| US2002/0133481(A1) | 2002-09-01 | Smith et al. | Applicant |
| US2002/0144267(A1) | 2002-10-01 | Gutta et al. | Applicant |
| US2002/0152190(A1) | 2002-10-01 | Biebesheimer et al. | Applicant |
| US2002/0184373(A1) | 2002-12-01 | Maes | Applicant |
| US2002/0188488(A1) | 2002-12-01 | Hinkle | Applicant |
| US2002/0199194(A1) | 2002-12-01 | Ali | Applicant |
| US2003/0005452(A1) | 2003-01-01 | Rodriguez | Applicant |
| US2003/0005462(A1) | 2003-01-01 | Broadus et al. | Applicant |
| US2003/0011573(A1) | 2003-01-01 | Villet et al. | Applicant |
| US2003/0014753(A1) | 2003-01-01 | Beach et al. | Examiner |
| US2003/0023976(A1) | 2003-01-01 | Kamen et al. | Applicant |
| US2003/0037043(A1) | 2003-02-01 | Chang et al. | Applicant |
| US2003/0037333(A1) | 2003-02-01 | Ghashghai et al. | Applicant |
| US2003/0046698(A1) | 2003-03-01 | Kamen et al. | Applicant |
| US2003/0051240(A1) | 2003-03-01 | Schaffer et al. | Applicant |
| US2003/0066068(A1) | 2003-04-01 | Gutta et al. | Applicant |
| US2003/0066079(A1) | 2003-04-01 | Suga | Applicant |
| US2003/0084270(A1) | 2003-05-01 | Coon et al. | Applicant |
| US2003/0103088(A1) | 2003-06-01 | Dresti et al. | Applicant |
| US2003/0217121(A1) | 2003-11-01 | Willis | Applicant |
| US2003/0226146(A1) | 2003-12-01 | Thurston et al. | Applicant |
| US2003/0229900(A1) | 2003-12-01 | Reisman | Applicant |
| US2003/0237096(A1) | 2003-12-01 | Barrett et al. | Applicant |
| US2004/0013909(A1) | 2004-01-01 | Shimizu et al. | Applicant |
| US2004/0021691(A1) | 2004-02-01 | Dostie et al. | Applicant |
| US2004/0024777(A1) | 2004-02-01 | Schaffer | Applicant |
| US2004/0046744(A1) | 2004-03-01 | Rafii et al. | Applicant |
| US2004/0049783(A1) | 2004-03-01 | Lemmons et al. | Applicant |
| US2004/0054520(A1) | 2004-03-01 | Dehlinger et al. | Applicant |
| US2004/0073926(A1) | 2004-04-01 | Nakamura et al. | Applicant |
| US2004/0078815(A1) | 2004-04-01 | Lemmons et al. | Applicant |
| US2004/0078816(A1) | 2004-04-01 | Johnson | Applicant |
| US2004/0078820(A1) | 2004-04-01 | Nickum | Applicant |
| US2004/0083198(A1) | 2004-04-01 | Bradford et al. | Applicant |
| US2004/0093616(A1) | 2004-05-01 | Johnson | Applicant |
| US2004/0111745(A1) | 2004-06-01 | Schein et al. | Applicant |
| US2004/0128686(A1) | 2004-07-01 | Boyer et al. | Applicant |
| US2004/0139091(A1) | 2004-07-01 | Shin | Applicant |
| US2004/0143569(A1) | 2004-07-01 | Gross et al. | Applicant |
| US2004/0163032(A1) | 2004-08-01 | Guo et al. | Applicant |
| US2004/0194141(A1) | 2004-09-01 | Sanders | Applicant |
| US2004/0216160(A1) | 2004-10-01 | Lemmons et al. | Applicant |
| US2004/0220926(A1) | 2004-11-01 | Lamkin et al. | Applicant |
| US2004/0221308(A1) | 2004-11-01 | Cuttner et al. | Applicant |
| US2004/0261021(A1) | 2004-12-01 | Mittal et al. | Applicant |
| US2005/0015366(A1) | 2005-01-01 | Carrasco et al. | Applicant |
| US2005/0071874(A1) | 2005-03-01 | Elcock et al. | Applicant |
| US2005/0086234(A1) | 2005-04-01 | Tosey | Applicant |
| US2005/0086691(A1) | 2005-04-01 | Dudkiewicz et al. | Applicant |
| US2005/0086692(A1) | 2005-04-01 | Dudkiewicz et al. | Applicant |
| US2005/0174333(A1) | 2005-08-01 | Robinson et al. | Applicant |
| US2005/0192944(A1) | 2005-09-01 | Flinchem | Applicant |
| US2005/0210020(A1) | 2005-09-01 | Gunn et al. | Applicant |
| US2005/0210383(A1) | 2005-09-01 | Cucerzan et al. | Examiner |
| US2005/0210402(A1) | 2005-09-01 | Gunn et al. | Applicant |
| US2005/0223308(A1) | 2005-10-01 | Gunn et al. | Applicant |
| US2005/0240580(A1) | 2005-10-01 | Zamir et al. | Applicant |
| US2005/0246311(A1) | 2005-11-01 | Whelan et al. | Applicant |
| US2005/0267994(A1) | 2005-12-01 | Wong et al. | Applicant |
| US2005/0278175(A1) | 2005-12-01 | Hyvonen | Applicant |
| US2005/0283468(A1) | 2005-12-01 | Kamvar et al. | Applicant |
| US2006/0010477(A1) | 2006-01-01 | Yu | Applicant |
| US2006/0013487(A1) | 2006-01-01 | Longe et al. | Applicant |
| US2006/0036640(A1) | 2006-02-01 | Tateno et al. | Applicant |
| US2006/0059044(A1) | 2006-03-01 | Chan et al. | Applicant |
| US2006/0075429(A1) | 2006-04-01 | Istvan et al. | Examiner |
| US2006/0090182(A1) | 2006-04-01 | Horowitz et al. | Applicant |
| US2006/0090185(A1) | 2006-04-01 | Zito et al. | Applicant |
| US2006/0101499(A1) | 2006-05-01 | Aravamudan et al. | Applicant |
| US2006/0101503(A1) | 2006-05-01 | Venkataraman | Applicant |
| US2006/0101504(A1) | 2006-05-01 | Aravamudan et al. | Applicant |
| US2006/0112162(A1) | 2006-05-01 | Marot et al. | Applicant |
| US2006/0117019(A1) | 2006-06-01 | Sylthe et al. | Applicant |
| US2006/0163337(A1) | 2006-07-01 | Unruh | Applicant |
| US2006/0167676(A1) | 2006-07-01 | Plumb | Applicant |
| US2006/0167859(A1) | 2006-07-01 | Verbeck Sibley et al. | Examiner |
| US2006/0173818(A1) | 2006-08-01 | Berstis et al. | Applicant |
| US2006/0190308(A1) | 2006-08-01 | Janssens et al. | Applicant |
| US2006/0195435(A1) | 2006-08-01 | Laird-McConnell et al. | Applicant |
| US2006/0206454(A1) | 2006-09-01 | Forstall et al. | Applicant |
| US2006/0242178(A1) | 2006-10-01 | Butterfield et al. | Applicant |
| US2006/0256078(A1) | 2006-11-01 | Flinchem et al. | Applicant |
| US2006/0259344(A1) | 2006-11-01 | Patel et al. | Applicant |
| US2006/0274051(A1) | 2006-12-01 | Longe et al. | Applicant |
| US2006/0282856(A1) | 2006-12-01 | Errico et al. | Applicant |
| US2007/0005526(A1) | 2007-01-01 | Whitney et al. | Applicant |
| US2007/0005563(A1) | 2007-01-01 | Aravamudan | Applicant |
| US2007/0016476(A1) | 2007-01-01 | Hoffberg et al. | Applicant |
| US2007/0027852(A1) | 2007-02-01 | Howard et al. | Examiner |
| US2007/0027861(A1) | 2007-02-01 | Huentelman et al. | Applicant |
| US2007/0044122(A1) | 2007-02-01 | Scholl et al. | Applicant |
| US2007/0050337(A1) | 2007-03-01 | Venkataraman et al. | Applicant |
| US2007/0050348(A1) | 2007-03-01 | Aharoni et al. | Applicant |
| US2007/0061244(A1) | 2007-03-01 | Ramer et al. | Applicant |
| US2007/0061317(A1) | 2007-03-01 | Ramer et al. | Applicant |
| US2007/0061754(A1) | 2007-03-01 | Ardhanari et al. | Applicant |
| US2007/0067272(A1) | 2007-03-01 | Flynt et al. | Applicant |
| US2007/0088681(A1) | 2007-04-01 | Aravamudan et al. | Applicant |
| US2007/0100650(A1) | 2007-05-01 | Ramer et al. | Applicant |
| US2007/0130128(A1) | 2007-06-01 | Garg et al. | Applicant |
| US2007/0143567(A1) | 2007-06-01 | Gorobets | Applicant |
| US2007/0150606(A1) | 2007-06-01 | Flinchem et al. | Applicant |
| US2007/0208718(A1) | 2007-09-01 | Javid et al. | Applicant |
| US2007/0219984(A1) | 2007-09-01 | Aravamudan et al. | Applicant |
| US2007/0219985(A1) | 2007-09-01 | Aravamudan et al. | Applicant |
| US2007/0255693(A1) | 2007-11-01 | Ramaswamy et al. | Applicant |
| US2007/0256070(A1) | 2007-11-01 | Bykov et al. | Applicant |
| US2007/0260703(A1) | 2007-11-01 | Ardhanari et al. | Applicant |
| US2007/0266021(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0266026(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0266406(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0271205(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0276773(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0276821(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0276859(A1) | 2007-11-01 | Aravamudan et al. | Applicant |
| US2007/0288456(A1) | 2007-12-01 | Aravamudan et al. | Applicant |
| US2007/0288457(A1) | 2007-12-01 | Aravamudan et al. | Applicant |
| EP1050794(A) | 2000-11-01 | Applicant | |
| EP1143691 | 2001-10-01 | Applicant | |
| EP1338967(A2) | 2003-08-01 | Applicant | |
| EP1463307(A2) | 2004-09-01 | Applicant | |
| WO-0070505 | 2000-11-01 | Applicant | |
| WO-2004010326 | 2004-01-01 | Applicant | |
| WO-2004/031931(A1) | 2004-04-01 | Applicant | |
| WO-2005/033967(A3) | 2005-04-01 | Applicant | |
| WO-2005/084235(A2) | 2005-09-01 | Applicant |
Non-Patent Literature (41)
- Press Release From Tegic Communications, Tegic Communications is Awarded Patent for Japanese T9(R) Text Input Software From the Japan Patent Office, Oct. 12, 2004. Retrieved Nov. 18, 2005 From http://www.tegic.com/press—view.html?release—num=55254242.Applicant
- Gadd T.N., Phonix: The Algorithm, Program 24(4), Oct. 1990, pp. 363-369.Applicant
- Dalianis, Improving Search Engine Retrieval Using a Compound Splitter for Swedish, Abstract of Presentation at Nodalida 2005—15th Nordic Conference on Computational Linguistics, Joensuu Finland, May 21-22, 2005. Retrieved Jan. 5, 2006 From http://phon.joensuu.fi/nodalida/abstracts/03.shtml.Applicant
- Silfverberg et al., Predicting Text Entry Speed on Mobile Phones, Proceedings of the ACM Conference on Human Factors in Computing Systems—CHI 2000. pp. 9-16.Applicant
- Mackenzie et al, Letterwise: Prefix-Based Disambiguation for Mobile Text Input, Proceedings of the ACM Symposium on User Interface Software and Technology—UIST 2001, pp. 111-120.Applicant
- U.S. Appl. No. 60/548,589, filed Sep. 1, 2005, Flinchem.Applicant
- U.S. Appl. No. 11/855,661, Venkataraman et al.Applicant
- U.S. Appl. No. 11/862,917, Aravamudan.Applicant
- U.S. Appl. No. 11/939,086, Ramakrishnan et al.Applicant
- U.S. Appl. No. 12/018,566, Venkataraman et al.Applicant
- Ardissono, L. et al., User Modeling and Recommendation Techniques for Personalized Electronic Program Guides, Personalized Digital Television, Editors: Ardissono, et al., Kluwer Academic Press, 2004.Applicant
- Digital Video Broadcasting, http://www.dvb.org (Oct. 12, 2007).Applicant
- Good, N. et al., Combining Collaborative Filtering with Personal Agents for Better Recommendations, in Proc. of the 16th National Conference on Artificial Intelligence, pp. 439-446, Orlando, Florida, Jul. 18-22, 1999.Applicant
- International Search Report, International Application No. PCT/US06/25249, mailed Jan. 29, 2008 (2 pages).Applicant
- International Search Report, International Application No. PCT/US06/33204, mailed Sep. 21, 2007 (2 pages).Applicant
- International Search Report, International Application No. PCT/US06/33257, mailed Mar. 26, 2008 (2 pages).Applicant
- International Search Report, International Application No. PCT/US06/33258, mailed Mar. 26, 2008 (2 pages).Applicant
- International Search Report, International Application No. PCT/US06/40005, mailed Jul. 3, 2007 (4 Pages).Applicant
- International Search Report, International Application No. PCT/US07/65703, mailed Jan. 25, 2008 (2 pages).Applicant
- International Search Report, International Application No. PCT/US07/67100, mailed Mar. 7, 2008 (2 pages).Applicant
- Matthom, “Text Highlighting in Search Results”, Jul. 22, 2005. Available at www.matthom.com/archive/2005/07/22/text-highlighting-in-search-results; retrieved Jun. 23, 2006. (4 pages).Applicant
- Mokotoff, Soundexing and Genealogy, Available at http://www.avotaynu.com/soundex.html, retrieved Mar. 19, 2008, last updated Sep. 8, 2007 (6 pages).Applicant
- Review of Personalization Technologies: Collaborative Filtering vs. ChoiceStream's Attributized Bayesian Choice Modeling, Technology Brief, ChoiceStream Technologies, Cambridge, MA.Applicant
- Roe, David et al., “Mapping UML Models Incorporating OCL Constraints into Object-Z”, Technical Report, Sep. 2003, Department of Computing, Imperial College London (17 pages).Applicant
- Talbot, David. “Soul of a New Mobile Machine.” Technology Review: The Design Issue May/Jun. 2007. (pp. 46-53).Applicant
- Wikipedia's entry for Levenshtein distance (n.d.). Retrieved Nov. 15, 2006 from http://en.wikipedia.org/wiki/Levenshtein—distance.Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US06/25249, mailed Jan. 29, 2008 (4 pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US06/33204, mailed Sep. 21, 2007 (3 pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US06/33257, mailed Mar. 26, 2008 (4 pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US06/33258, mailed Mar. 26, 2008 (4 pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US06/40005, mailed Jul. 3, 2007 (4 Pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US07/65703, mailed Jan. 25, 2008 (4 pages).Applicant
- Written Opinion of the International Searching Authority, International Application No. PCT/US07/67100, mailed Mar. 7, 2008 (3 pages).Applicant
- Supplementary European Search Report for PCT/US2005040415, dated Aug. 11, 2009, 15 pages.Applicant
- Supplementary European Search Report for PCT/US2005040424, dated Aug. 20, 2009, 13 pages.Applicant
- Nardi, et al., “Integrating Communication and Information Through Contact Map,” Communications of the ACM, vol. 45, No. 4, Apr. 2002, 7 pages, retrieved from URL:http://portal.acm.org/citation.cfm?id+505251>.Applicant
- Supplemental European Search Report for 05826114.0 dated Aug. 20, 2009, 13 pages.Applicant
- Supplemental European Search Report for 05826129.8 dated Aug. 11, 2009, 15 pages.Applicant
- Supplemental European Search Report for 06838179.7 dated Dec. 9, 2009, 7 pages.Applicant
- Supplemental European Search Report for 07761026.9 dated Jan. 28, 2010, 8 pages.Applicant
- Turski, et al., “Inner Circle—People Centered Email Client,” CHI 2005 Conference on Human Factors in Computing Systems, Apr. 2005, pp. 1845-1848, 4 pages, retrieved from URL:http://portal.acm.org/citation.cfm?id+1056808.1057037.Applicant