US 7,536,384 B2Grant
Methods and systems for dynamically rearranging search results into hierarchically organized concept clusters
Issue Date:2009-05-19
•17 Claims
•11 Drawing Sheets
Abstract
Methods of and systems for dynamically rearranging search results into hierarchically organized concept clusters are provided. A method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a set of content items and receiving incremental input to incrementally identify search terms for content items. Content items are selected and grouped into sets based on how the incremental input matches various metadata associated with the content items. The selected content items are grouped into explicit conceptual clusters and user-implied conceptual clusters based on metadata in common to the selected content items. The clustered content items are presented according to the conceptual clusters into which they are grouped.
Metadata
Assignee
- Veveo, Inc.
Inventors
- Sashikumar Venkataraman
- Pankaj Garg
- Pranav Rajanala
Application Information
Application Number:US 11/855,661
Filing Date:2007-09-14
Priority Date:2006-09-14
Art Unit:2164
Classifications
IPC:
G06F17/30G06F17/00
Patent Drawings (11 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims the benefit under 35 U.S.C. § 119(e) to the following application, the contents of which are incorporated by reference herein:
-
- [0002] U.S. Provisional Patent Application No. 60/825,616, entitled A Method Of Dynamically Generating Hierarchically Organized Result Clusters For An Incremental Search Query Matching One Or More Precomputed Hierarchical Clusters, filed on Sep. 14, 2006.
[0003] This application is related to the following applications, the contents of which are incorporated by reference herein:
-
- [0004] U.S. patent application Ser. No. 11/136,261, entitled Method And System For Performing Searches For Television Programming Using Reduced Text Input, filed on May 24, 2005, which claims priority to U.S. Provisional Patent Application No. 60/626,274, entitled Television Systems and Associated Methods, filed on Nov. 9, 2004, and U.S. Provisional Patent Application No. 60/664,879, entitled Method And System For Performing Searches For Television Programming Using Reduced Text Input, filed on Mar. 24, 2005;
- [0005] U.S. patent application Ser. No. 11/312,908, entitled Method And System For Dynamically Processing Ambiguous, Reduced Text Search Queries And Highlighting Results Thereof, filed on Dec. 20, 2005, which claims priority to U.S. Provisional Patent Application No. 60/711,866, entitled A Dynamic Highlighting Interface Of Multiword Prefixes Of Results Obtained By Incremental Search With Reduced Text Entry On Television And Mobile Devices Using A Keypad With Overloaded Keys, filed on Aug. 26, 2005, and U.S. Provisional Patent Application No. 60/716,101, entitled Method And System For Incremental Search With Reduced Text Entry Using A Reduced Keypad With Overloaded Keys, filed Sep. 12, 2005; and
- [0006] U.S. patent application Ser. No. 11/235,928, entitled Method And System For Processing Ambiguous, Multiterm Search Queries, filed on Sep. 27, 2005, which claims priority to U.S. Provisional Patent Application No. 60/716,101, entitled Method And System For Incremental Search With Reduced Text Entry Using A Reduced Keypad With Overloaded Keys, filed Sep. 12, 2005, and U.S. Provisional Patent Application No. 60/711,866, entitled A Dynamic Highlighting Interface Of Multiword Prefixes Of Results Obtained By Incremental Search With Reduced Text Entry On Television And Mobile Devices Using A Keypad With Overloaded Keys, filed on Aug. 26, 2005.
Background
[0007] 1. Field of Invention
[0008] The present invention relates to a method of selecting and presenting content and, more specifically, to a method of dynamically combining and organizing content into hierarchical clusters to facilitate user discovery of desired information.
[0009] 2. Description of Related Art
[0010] One measure of the usability of an information finding and presentation system on input and/or display constrained devices is the effort expended by the user in the discovery of desired information (the discovery of information could be text based search, browsing a content space, or some combination of both). One method of minimizing the effort expended to find information (either via search or browse techniques) on input and display constrained devices is the use of incremental search techniques. The use of incremental search, where results are retrieved as user types in each character, is far superior to full word search interfaces on input constrained device, because incremental search reduces the amount of text the user must input (See, for example, the techniques presented in the applications incorporated below).
[0011] However, one of the challenges in an incremental search system is to present the most relevant results to the user even when the input is sparse or is of an ambiguous nature, such as input using an overloaded keypad with multiple alphanumeric characters mapped to the same physical key. For example, a pure lexical match on incremental input would fail to yield good results where exact matches on prefixes are rated as more relevant than partial word matches. Furthermore, if the input method is using an overloaded keypad, generating an ambiguous text input, then the problem is even worse.
[0012] In addition, ambiguous text inputs can match a wide variety of results because of the nature of the ambiguous input. This is so because the ambiguous input not only represents the search input intended by the user, but can also represent other words or phrases. For example, using the well-known 12-key telephone keypad, the input “227” represents both “car” and “bar”, which can match very different results. Thus, while incremental, ambiguous text input is a convenient way to enter search input on an input constrained device, the increase in the amount of results returned can be cumbersome on a display constrained device, where only a few entries in a result set are visible.
Summary of the Invention
[0013] The invention provides a method of dynamically rearranging search results for an incremental search query into hierarchically organized concept clusters.
[0014] Under one aspect of the invention, a method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a relatively large set of content items. At least some of the content items have metadata to specify explicit concepts associated with the content items. At least some of the metadata include phrases having more than one metadata term. The method further includes receiving from a user incremental input to incrementally identify more than one search term for desired content items and selecting from the relatively large set of content items: a first set of content items, wherein all search terms match metadata terms of a single one of the metadata phrases of each content item of said first set, a second set of content items, wherein a first subset of the search terms matches at least one metadata term of at least a first metadata phrase of each content item of said second set, and a third set of content items, wherein a second subset of the search terms matches at least one metadata term of at least a second metadata phrase of each content item of said third set, the first metadata phrase differing from the second metadata phrase. The method also includes grouping the content items the second and third sets have in common to form an intersection set for user-implied concepts inferred from the explicit concepts associated with the metadata of the content items of the intersection set and organizing the content items of the first set and the intersection set into conceptual cluster sets. The content items of the first set are organized into explicit conceptual cluster sets based on the metadata phrases having metadata terms matching the search terms so that content items having a same metadata phrase matching the search terms are clustered together. The content items of the intersection set are organized into user-implied conceptual clusters based on at least the first and second metadata phrases the content items of the intersection set have in common so that content items having same first and second metadata phrases matching the search terms are clustered together. The method includes presenting the content items organized into the explicit conceptual cluster sets and the user-implied conceptual cluster sets. Each explicit conceptual cluster set is identified based on the metadata phrase common to the content items of said explicit conceptual cluster set having metadata terms matching the search terms. Each user-implied conceptual cluster set is identified based on the first and second metadata phases the content items of said user-implied conceptual cluster set have in common.
[0015] Under another aspect of the invention, the incremental input is ambiguous text input; the ambiguous text input has one or more digits; and each digit represents more than one alphanumeric character.
[0016] Under a further aspect of the invention, the method further comprises modifying the metadata terms of at least one of the metadata phrases of at least some of the content items based on at least one of the date, day, and time of the incremental input.
[0017] Under yet another aspect of the invention, the presenting the content items is on a display-constrained device.
[0018] Under yet a further aspect of the invention, the incremental input comprises at least two prefixes in an ordered format and/or at least two prefixes in an unordered format. The incremental input can comprise at least two prefixes separated by a word separator.
[0019] Under an aspect of the invention, the organized content items are ordered for presentation in accordance with a given relevance function. The relevance function comprises at least one of temporal relevance of the content items, location relevance of the content items, popularity of the content items, and preferences of the user.
[0020] Under another aspect of the invention, at least some of the metadata terms include phonetically equivalent terms to the explicit concepts associated with at least some of the content items and/or commonly misspelled terms of the terms of the metadata phrases.
[0021] Under yet another aspect of the invention, the method further comprises organizing the content items of the large set of content items into a predetermined hierarchy based on a relationship between the informational content of the content items. The metadata to specify the explicit concepts associated with the content items is selected based on the predetermined hierarchy.
[0022] Under an aspect of the invention, a system for searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes a database stored in an electronically readable medium for cataloging a relatively large set of content items. At least some of the content items have metadata to specify explicit concepts associated with the content items. At least some of the metadata include phrases having more than one metadata term. The system also includes input logic for receiving from a user incremental input to incrementally identify more than one search term for desired content items and selection logic for selecting from the relatively large set of content items a first set of content items, wherein all search terms match metadata terms of a single one of the metadata phrases of each content item of said first set, a second set of content items, wherein a first subset of the search terms matches at least one metadata term of at least a first metadata phrase of each content item of said second set, and a third set of content items, wherein a second subset of the search terms matches at least one metadata term of at least a second metadata phrase of each content item of said third set, the first metadata phrase differing from the second metadata phrase. The system further includes grouping logic for grouping the content items the second and third sets have in common to form an intersection set for user-implied concepts inferred from the explicit concepts associated with the metadata of the content items of the intersection set and organization logic for organizing the content items of the first set and the intersection set into conceptual cluster sets. The content items of the first set are organized by the logic into explicit conceptual cluster sets based on the metadata phrases having metadata terms matching the search terms so that content items having a same metadata phrase matching the search terms are clustered together. The content items of the intersection set are organized by the logic into user-implied conceptual clusters based on at least the first and second metadata phrases the content items of the intersection set have in common so that content items having same first and second metadata phrases matching the search terms are clustered together. The system also includes presentation logic for presenting the content items organized into the explicit conceptual cluster sets and the user-implied conceptual cluster sets. Each explicit conceptual cluster set is identified based on the metadata phrase common to the content items of said explicit conceptual cluster set having metadata terms matching the search terms. Each user-implied conceptual cluster set is identified based on the first and second metadata phases the content items of said user-implied conceptual cluster set have in common.
[0023] Under another aspect of the invention, at least a portion of the database stored in an electronically readable medium is implemented in a server system remote from the user.
[0024] Under yet another aspect of the invention, at least one of the input logic, the selection logic, the grouping logic, the organization logic, and the presentation logic is implemented in a server system remote from the user.
[0025] Under a further aspect of the invention, the incremental input is ambiguous text input. The ambiguous text input has one or more digits. Each digit represents more than one alphanumeric character.
[0026] Under yet a further aspect of the invention, the system also includes modification logic for modifying the metadata terms of at least one of the metadata phrases of at least some of the content items based on at least one of the date, day, and time of the incremental input.
[0027] Under another aspect of the invention, the system also includes ranking logic for ordering the organized content items for presentation in accordance with a given relevance function. The relevance function can include at least one of temporal relevance of the content items, location relevance of the content items, popularity of the content items, and preferences of the user.
[0028] These and other features will become readily apparent from the following detailed description where embodiments of the invention are shown and described by way of illustration.
Brief Description of the Several Views of the Drawings
[0029] 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:
[0030] FIG. 1 illustrates a method of organizing content items and concepts into hierarchical time-sensitive concept clusters, matching incremental user input with one or more concept clusters, and generating and presenting relevant dynamic hierarchical clusters to the user.
[0031] FIG. 2 illustrates a concept cluster hierarchy.
[0032] FIG. 3 illustrates different concept cluster hierarchies associated with different results.
[0033] FIG. 4 illustrates an embodiment of the invention where search results for a partial prefix input are returned, including lexical matches, predetermined concept clusters, and dynamically generated concept clusters.
[0034] FIG. 5 illustrates the user's discovery of information, by expanding a concept cluster.
[0035] FIG. 6 illustrates the user's discovery of information, by expanding a concept cluster.
[0036] FIG. 7 illustrates the user's discovery of information, where a dynamic concept cluster is created, based on the partial prefix input entered by the user, and then the dynamic concept cluster is expanded by the user.
[0037] FIG. 8 illustrates a concept cluster hierarchy and the user's discovery of information, by conflating concept clusters.
[0038] FIG. 9 illustrates a content system for the selection, reorganization, and presentation of content items.
[0039] FIG. 10 illustrates a user device for selecting, reorganizing, and presenting selected content items.
Detailed Description
[0040] Preferred embodiments of the invention provide methods of and systems for discovering and dynamically rearranging search results into hierarchically organized concept clusters. A concept cluster is a set of content items and/or topics that are related by one or more common themes or information types. For example, one concept cluster may be “baseball”, which can contain search results related to scores of past Major League Baseball games and/or schedules for future games. In some implementations, the concept clusters are time-sensitive (described below) and include both precomputed concept clusters and dynamically generated concept clusters. The search results can include lexical matches between the content results and the incremental input of search queries, as well as matches between the incremental input and the concept cluster identifiers. This method of generating and presenting search results significantly enhances the user experience of performing incremental search for information because the hierarchical concept-driven clustering of results provides a richer organization of results. The techniques disclosed herein enable the user to more easily find the desired information content, as all results pertaining to a particular concept have been collected together. This stands in contrast to lexical matching, where results pertaining to the same concept may be interleaved among other results, which increases the cognitive load for the user.
[0041] Embodiments of the present invention build on techniques, systems and methods disclosed in earlier filed applications, including but not limited to U.S. patent application Ser. No. 11/204,546, entitled Method and System For Performing Searches For Television Content and Channels Using a Non-intrusive Television Interface and With Reduced Text Input, filed on Aug. 15, 2005; U.S. patent application Ser. No. 11/246,432, entitled Method And System For Incremental Search With Reduced Text Entry Where The Relevance Of Results Is A Dynamically Computed Function of User Input Search String Character Count, filed on Oct. 7, 2005; U.S. patent application Ser. No. 11/509,909, entitled User Interface For Visual Cooperation Between Text Input And Display Device, filed Aug. 25, 2006; U.S. patent application Ser. No. 11/561,197, entitled Method And System For Finding Desired Results By Incremental Search Using An Ambiguous Keypad With The Input Containing Orthographic and Typographic Errors, filed Nov. 17, 2006; and U.S. patent application Ser. No. 11/682,693, entitled Methods and Systems For Selecting and Presenting Content Based On Learned Periodicity Of User Content Selection, filed on Mar. 6, 2007, the contents of each of which are herein incorporated by reference. Those applications taught specific ways to perform incremental searches using ambiguous text input, methods of ordering the search results, and techniques for learning a user's behavior and preferences. The techniques disclosed in those applications can be used with the user's navigation behavior or the user's relationship to a concept cluster described herein in the same or similar ways in which the techniques are applied to the collections of content items described in those applications. The present techniques, however, are not limited to systems and methods disclosed in the incorporated patent applications. Thus, while reference to such systems and applications may be helpful, it is not believed necessary to understand the present embodiments or inventions.
[0042] FIG. 1 is a flowchart illustrating the operation of an embodiment of the invention. The flowchart illustrates a method of searching for content based on the user's incremental search input and reorganizing and presenting the results in hierarchically arranged concept clusters that are dynamically created based on the content item results returned from the search. Content items are associated with metadata that characterizes the content items. This can be done in a number of ways, including organizing the content items into a hierarchy that characterizes the content items and describes the information relationship between the content items and concepts related to the content items. In such an embodiment, content items and concept clusters are first organized into a hierarchy that best represents the relationship between concept clusters and particular content items as well as the relationship between the concept clusters themselves (step 101). Because the content is organized into clusters of the hierarchy, each concept cluster can be a parent, child, or sibling cluster relative to the other clusters in the hierarchy. Similarly, each content item can be a member of one or more concept clusters. The organization of content items into concept clusters can be performed in a precomputation step that occurs on a routine basis before the user enters the search input, or the organization step can be triggered by, and occur immediately before, processing the user's search input, described in more detail below.
[0043] As mentioned above, in some embodiments, this step can be omitted, as the content items can be maintained without a hierarchy, and later organized according to metadata associated with the content items, as described in greater detail below. Thus, in some implementations, the content items are simply associated with metadata and need not be arranged in a hierarchy. In such an embodiment, the content items have a “flat” arrangement in that there is no express hierarchy to the content item collection. The metadata associated with the content items consists of metadata phrases that can have one or more terms to describe the informational content of the content item.
[0044] The next step of the method calls for receiving search input from the user (step 102). As explained above, the search input can be incremental and ambiguous text input, entered using techniques disclosed in the incorporated applications. The search could also be based on browsing an information tree of the content. In an implementation utilizing ambiguous text input, the systems and/or devices employing the methods disclosed herein can provide for an express word separator character, i.e., a character that unambiguously identifies that one ambiguous search term has ended and another has begun. By providing an express word separator, the number of unambiguous search terms that can match the ambiguous input is reduced. Whereas, if an ambiguous character is used to represent a word separator, a text entry intended by the user to be a multiple term entry can be interpreted by a disambiguation system to be a single search term, thereby causing the search system to return results not of interest to the user. In addition, because the number of possible unambiguous search terms matching the ambiguous input is increased, the processing load on the system is increased, which can result in reduced system performance.
[0045] Content items are selected based on the user input (step 103). The content search methods in the incorporated applications is useful for this step. In one implementation, each content item is associated with one or more descriptive metadata terms. This metadata describes, for example, the types of content items, the information contained in the content items, and keywords associated with the content items. Thus, the incremental input can be compared against the various descriptive terms/metadata to identify content that matches what the user seeks.
[0046] The search input is then matched with concept clusters defined in step 101 and/or metadata associated with the content items (step 104). The match can be based on a lexical match between the user's input and one or more identifiers of the concept cluster and/or the metadata associated with the content items, for example, by using the matching and search techniques in the applications incorporated above. When a hierarchy is provided, the relative organization of the concept cluster hierarchy governs the presentation of the content items because the hierarchy determines, in part, what metadata is associated with the content items. Having identified content items, concept clusters, and metadata that match the user's input, the method determines the best hierarchical organization of the selected content items for presentation to the user to aid in the user's selection or navigation of the selected content items (step 105).
[0047] One method of hierarchically organizing the selected content items is to group the content items into explicit conceptual clusters and user-implied conceptual clusters. Explicit conceptual clusters are groups of content items that have metadata phrases with terms that match multiple terms of the user's search input. Thus, it can be said that that concept expressed by the user's input match a concept that is found explicitly in a single metadata phrase. User-implied conceptual clusters are groups of content items are related by a concept that can be inferred from the user's search input. Thus, rather than the concept being found within a single metadata phrase, the concept is formed by the coming-together of multiple metadata phrases. Thus, content items that have a first metadata phrase that matches a first portion of the user's search input and a second metadata phrase that matches a second portion of the user's search input are grouped into user-implied conceptual clusters. Explicit conceptual clusters and user-implied conceptual clusters are illustrated in the examples provided below. Finally, the method calls for reorganizing the selected content items according to the hierarchy, e.g. the conceptual clusters, determined in step 105 and presenting the selected content items in the hierarchy (step 106).
[0048] FIG. 2 is an example of an organization of information into hierarchical time-sensitive clusters (generated by step 101 of FIG. 1 ). FIG. 2 illustrates the organization of information and data relating to entertainers 201. The entertainers cluster is further divided into actors 202 and singers 203. Further still, personalities Tom Cruise 204 and Jack Nicholson 205 are grouped under the actors cluster 202, while Tom Jones 206 is grouped under the singers cluster 203. Note, the entertainers cluster may be a child cluster of an upper-level parent cluster; it may have sibling clusters related to other personalities; and it may have additional child clusters 207.
[0049] The Tom Cruise cluster 204 has child clusters; one such cluster would be a cluster containing all TV content 208 in which Tom Cruise appears. Another meaningful concept cluster would be a cluster of web videos 209 relating to Tom Cruise. Yet another cluster is movies 210 in which Tom Cruise appears. Further clusters 211 can be included in the information hierarchy. These clusters 208-211 are generated based on metadata associated with Tom Cruise. Because Tom Cruise is an actor, there is a wide variety of audio/video content associated with this cluster. Thus, for these audio/video content items, Tom Cruise may be a metadata phase. The Jack Nicholson cluster 205 contains child clusters similar to the Tom Cruise cluster 204 because both are actors. Further actors can be assigned to addition clusters 212. The information in these clusters is said to be time-sensitive because the information contained in the clusters or sub-clusters can change according to the time of day or date. For example, TV shows can begin playing at a certain time of day on a particular date. The organization of data can be done during the precomputation step described above, and the results are subsequently used when user performs an incremental search.
[0050] The Tom Jones cluster 206 also has child clusters, but because Tom Jones is a singer, the child clusters under the Tom Jones cluster 206 differ from those generated for the actor clusters. For example, a CDs cluster 213 containing Tom Jones music CDs available for sale, and a concerts cluster 214 listing known Tom Jones concert dates and information are found under the Tom Jones cluster 206. Thus, Tom Jones is a metadata phase associated with a concert content item. Further child clusters 215 can be included. Likewise, additional personality clusters 216 can be found under the singers cluster 203.
[0051] As mentioned above, the concept clusters can be created based on the metadata associated with the content items. However, not every metadata term may be selected to also serve as a concept cluster. For example, in one implementation, terms that occur among the metadata of the entire set of content items are used to create the concept cluster hierarchy. In a further example, the concept clusters are created based on popular categorizations of the content items. Thus, one concept cluster would be “sports”, which would have sub-clusters “baseball”, “basketball”, etc. Another set of clusters would be “movies”, which would have subsclusters “genres”, “actors”, “directors”, etc. Any meaningful organization of concept clusters can be used with the techniques disclosed herein, and the invention is not limited to any particular method of generating the clusters and the corresponding hierarchy.
[0052] FIG. 3 provides an example of the reorganization and presentation of search results. A user enters “Tom” 301 as a prefix for “Tom Cruise” into a system supporting incremental search. The prefix “Tom” is matched with concept clusters such as “TV content”, “web videos”, and “movies” by way of these clusters' relationship with the parent cluster node “Tom Cruise” 302. Thus, in this example, Tom Cruise is an explicit conceptual cluster. However, rather than presenting the TV content, web videos, and movies of Tom Cruise under a single cluster “Tom Cruise”, the system dynamically creates the “Tom Cruise . . . TV Content”, “Tom Cruise . . . Web Videos”, and “Tom Cruise . . . Movies” clusters, effectively “flattening” a portion of the cluster hierarchy associated with Tom Cruise. This facilitates the user's selection and navigation of the results related to Tom Cruise by displaying the variety of Tom Cruise content on one screen.
[0053] The input also matches other concept clusters associated with the term “Tom”, such as content related to “Tom Jones” 303, again, another example of an explicit conceptual cluster. Because Tom Jones is a singer, there are different concept sub-clusters associated with the parent cluster of “Tom Jones”, for example, CDs of his music, concert dates, etc. As above, the system dynamically flattens a portion of the Tom Jones cluster hierarchy to achieve the benefits described above. The decision of whether to flatten or not flatten portions of the predefined hierarchy can be based on the number of items that would result in the list of results to be presented. The ideal number of results can be determined based on the type of device on which the techniques are employed and user preferences.
[0054] Meanwhile, the system discovers content items based on the matching techniques described in the incorporated applications and/or lexical matches of the content items' metadata with the search input “Tom”. These search results are then presented in the concept cluster hierarchy determined according to the concept cluster match and reorganization described above. Thus, all content related to Tom Cruise is organized according to the sub-clusters that are child nodes under Tom Cruise; all content related to Tom Jones is organized in a similar manner under the sub-clusters associated with Tom Jones.
[0055] FIG. 4 illustrates employment of the techniques disclosed herein to reorganize search results from a partial prefix search input. The hierarchical reorganization in FIG. 4 is generated by performing lexical matches of the search input 401 against the content items and precomputed concept clusters (e.g., the clusters of FIG. 2 ) and dynamically generating new concept clusters 402 based on the matching results. The user incrementally inputs partial prefixes of two cast members 401. In this example, “Tom” for Tom Cruise and “Jac” for Jack Nicholson. The incremental input matches content items from a relatively large set of content items, some of which are arranged into new concept clusters 402 that are dynamically-formed (e.g., the user-implied conceptual clusters), while others are presented directly in the results presentation 403. In both cases, the partial prefix inputs 401 are matched against the results and the results are order by relevance (see the incorporated applications for methods of ordering by relevance).
[0056] Dynamically-created concept clusters 402 can be formed by creating a new cluster that will contain sub-clusters and content items that satisfy both prefixes of the search criteria, i.e., “Tom” and “Jac”. This aspect will be described in greater detail below. One method of naming the dynamically-created concept clusters 402 is to combine the different clusters that came together to form the new cluster. For example, dynamically-formed concept clusters 402 that are presented to the user include “Tom Cruise . . . Jack Nicholson,” “Tom Wilkinson . . . Jackie Chan,” “Tom Jones . . . Jack Nicholson,” and “Marisa Tomei . . . Jack Nicholson”, where each person's name represents a cluster associated with that person. Thus, each of clusters 402 is an example of a user-implied conceptual cluster, in that, no single metadata phrase associated with a content item contains both personalities. The user-implied conceptual cluster is formed based on a combination of two separate metadata phrases common to multiple content items of the cluster. An arrow symbol 404 associated with the various results indicate that additional child cluster nodes and/or content items are organized beneath the result presented.
[0057] Results 403 are directly presented, i.e., are not grouped into concept clusters, and include “The Cat From Outer Space,” a movie with Tom Jackman, “Nothing in Common,” a movie with Jackie Gleason and Tom Hanks, “The Pledge,” a movie with Jack Nicholson and Tom Noonan, and “Sliders:Eggheads” a TV show with Tom Jackson. These results 403 are not organized into dynamic concept clusters because (1) the content item contains metadata matching both partial prefix terms (i.e., an explicit conceptual cluster) and/or (2) only one result is found having the specific terms which caused the content item result to be presented. For example, “The Cat From Outer Space” appears as a match because both search terms, “Tom” and “Jac” appeared in the metadata “Tom Jackman” associated with that movie. Whereas the result “The Pledge” appears as a match because the first term “Tom” matches the metadata item “Tom Noonan” associated with the movie “The Pledge” and the second term “Jac” matches a separate metadata item “Jack Nicholson” associated with the same movie. However, in this example, no other content items are associated with both metadata terms “Tom Noonan” and “Jack Nicholson”. Had other content items been discovered that also shared those two metadata, a “Tom Noonan . . . Jack Nicholson” dynamic cluster would have been created. This cluster would have contained the content item “The Pledge” as well as the other content items associated with both of these metadata terms. An arrow symbol 405 shown next to the result “Nothing in Common” indicates that that result has child nodes, such as video clips, commentaries, and/or links to vendors that sell a DVD of the movie.
[0058] One distinction of the techniques disclosed herein over other search and/or presentation methods is the non-lexical nature of concept clusters. The combination of Tom Cruise and Jack Nicholson can itself form a concept cluster. With such a concept match, the user is presented with a single result for “Tom Cruise . . . Jack Nicholson”. This result can be hierarchical and contain result items, such as particular movies with both actors, and/or sub-clusters, such as lists of movies, lists of TV shows, and/or links to other content with both actors. This dynamic aggregation of results into concept clusters greatly enhances the user experience in contrast to other incremental search systems, where the match is purely lexical in nature. For example, a purely lexical-based search might return results with multiple items matching Tom Cruise and Jack Nicholson where the results of intersecting the sets of content items associated with these two persons may be mixed within other results from other lexical matches, e.g., Tom Wilkinson and Jackie Chan. Furthermore, the ordering of the mixed results may be cumbersome due to the different popularities of the individual results of this intersection.
[0059] FIG. 5 illustrates the user's discovery of information, by expanding a concept cluster. In this example, the user has incrementally entered “RE” as a search term 501. The user can continue to type more text to further refine the search or navigate into one of the results returned from the incremental search. Here the concept cluster “Red Sox” 502 is one of the results currently matching the incremental text input “RE” 501. If the user navigates 503 into the “Red Sox” concept cluster (an explicit conceptual cluster), the sub-clusters within the hierarchy are displayed 504. These sub-clusters include the sub-clusters “Red Sox live games,” “Red Sox TV schedule,” “Red Sox past games,” and “Red Sox web videos”, which, in one implementation, contains only content items associated with the Red Sox in some way. The “Red Sox live games,” “Red Sox TV schedule,” and “Red Sox past games” sub-clusters are time-sensitive clusters 505, whose contents are dynamically adjusted with time. The “Red Sox web videos” sub-cluster is not time sensitive and does not need to be dynamically adjusted with time. A content item “Blue Jays @ Red Sox” 506 is also presented among the results.
[0060] FIG. 6 illustrates the user's discovery of information, by expanding a concept cluster. In this example, the user has incrementally entered “YAN” as a search term 601. As with the previous example, the user can continue to type more text to further refine the search or navigate into one of the results returned from the incremental search. Here the concept cluster “New York Yankees” 602 is one of the results currently matching the incremental text input “YAN” 601. If the user navigates 603 into the “New York Yankees” concept cluster (an explicit conceptual cluster), the sub-clusters within the hierarchy are displayed 604. These sub-clusters include the sub-clusters “New York Yankees live games,” “New York Yankees TV schedule,” “New York Yankees past games,” “New York Yankees web videos,” and “Baseball web videos.” Note, that in this example, in addition to content items associated with the New York Yankees in some way, the list includes an item associated with a related concept, namely, “Baseball web videos” 606, which is associated with the more general concept “baseball”. The “New York Yankees live games,” “New York Yankees TV schedule,” and “New York Yankees past games” sub-clusters are time-sensitive clusters 605, whose contents are dynamically adjusted with time. The “New York Yankees web videos” and “Baseball web videos” sub-clusters are not time sensitive and do not need to be dynamically adjusted with time. A content item “Yankees @ Royals” 607 is also presented.
[0061] FIG. 7 illustrates the presentation output by one implementation of the embodiment, where the information reorganization of a dynamic concept cluster is based on the cluster hierarchy associated with clusters that are common to matches of multiple terms in the user's incremental partial prefix input. In this example, the user has incrementally entered “RE YAN” as a search input 701. Again, the user can continue to type more text to further refine the search or navigate into one of the results returned from the incremental search. In response to the input, the concept cluster “Red Sox . . . New York Yankees” 702 is one of the results currently matching the incremental text input “RE YAN” 701. The “Red Sox . . . New York Yankees” cluster 702 is dynamically created by intersecting the two concepts “Red Sox” and “New York Yankees” (thus, forming a user-implied conceptual cluster). During the pre-computation step (step 101 of FIG. 1 ), the concept “Red Sox” was related to the concept “baseball”, as was the concept “New York Yankees.”
[0062] Because both the concept “Red Sox” and the concept “New York Yankees” are related to the concept “baseball”, the dynamic, user-implied, concept cluster “Red Sox . . . New York Yankees” 702 is created and content associated with matches of the two input terms, “RE” and “YAN”, are organized according to the hierarchy of the shared parent concept “baseball” and presented to the user. Similar to previous examples, if the user selects the “Red Sox . . . New York Yankees” concept cluster 702, the sub-clusters from the intersection of the two concepts are displayed 704. In this case, the dynamically-formed intersection clusters are “Live Games,” “TV schedule,” “web videos,” and “past games.” Again, this organization is governed by the information hierarchy associated with the parent concept “baseball”, which can be determined during the precomputation step described above. Thus, “Live Games,” “TV schedule,” “web videos,” and “past games” are selected as clusters because they are common types of content items associated with the broader concept “baseball”. Note, the content item “Blue Jays @ Red Sox” 506 of FIG. 5 , the content item “Yankees @ Royals” 607 of FIG. 6 , and concept cluster “Baseball Web Videos” 606 of FIG. 6 are not included in the newly formed concept cluster structure presented in FIG. 7 . This is so because those content items and clusters did not match both inputs “RE” and “YAN”.
[0063] The dynamic intersection of concepts is also performed if the user first entered “RE” and then selected the “Red Sox” concept (as described in connection with FIG. 5 ) and then typed “YAN” while in the “Red Sox” concept cluster. Similarly, the user can browse a tree arrangement of information nodes to arrive at a similar result. Thus, the user could browse to a top-level node “Sports”, followed by selection of the child node “Major League Baseball”, further followed by selection of the “Red Sox” node. Once in the “Red Sox” cluster, the user could enter the search term “YAN” to complete the dynamic intersection of the concept clusters “Red Sox” and “New York Yankees”. In the alternate, the user could indicate through the interface that the “Red Sox” cluster is to be part of a dynamic intersection query and browse up the tree to find the “New York Yankees” cluster and add that cluster to the intersection.
[0064] A system implementing such a search can be configured to enable this type of search method by maintaining the query state of the user's search session, e.g., the system tracks that the user is current browsing within the “Red Sox” concept. Thus, when the user begins to enter text after having browsed to the concept cluster “Red Sox”, the system would use the new text entry along with the current cluster to form the completed query rather than take the new text entry as a standalone query entry. Such a system can also be configurable to not track the state of the user, in which case, the new text entry would be treated as a standalone query. Similarly, a device implementing such a system can provide an “escape” key that would allow the user to reset the query state, providing the ability to enter a new standalone query regardless of the user's location in the content hierarchy.
[0065] The description above illustrates how the precomputed cluster hierarchy can be flattened and/or merged to form a new hierarchy into which content items are organized for presentation. Concept clusters can also be combined to form new, conflated concept clusters, which contain an aggregation of content items that are otherwise organized in different clusters. For example, FIG. 8 illustrates another possible concept cluster hierarchy 800 and an example of the formation of a dynamically-formed, conflated concept cluster 801. In this hierarchy, a Tom Jones cluster 802 is organized under the singers cluster 803. However, there is also a Tom Jones cluster 804 under the actors cluster 805 because he has appeared in a movie, there are web videos about him, and some of his concerts have been televised. Thus, when the user enters the incremental search text “TO JO” 806, the content items under the Tom Jones singer cluster 802 and Tom Jones actor cluster 804 will be returned because “TO” incrementally matches “Tom” and “JO” incrementally matched “Jones”. This is another example of an explicit conceptual cluster. In addition, content items for other personalities matching the search text may be returned, such as content items for composer “Tom Johnson”, baseball player “Todd Jones”, and other matches. Each of these personalities can have corresponding concept clusters.
[0066] In order to assist the user in finding the desired content items, the system can organize the content items according to the associated personality concept clusters 807. Thus, the system will dynamically create a general concept cluster for Tom Jones 808 and combine the sub-clusters under the Tom Jones actor cluster 804 and the sub-clusters under the Tom Jones singer cluster 802 so they are grouped under the dynamically-formed general Tom Jones cluster 808. Thus, the user can first select the personality Tom Jones 809 in which he or she is interested, and then further browse into the specific type of content he or she is seeking 810. The dynamically-formed concept cluster Tom Jones 808 can contain sub-clusters as well as content items, e.g., “She's a lady”.
[0067] FIG. 9 is an illustration of a content system 900 for use with the techniques described herein. In one implementation, the content system 900 has an input device 901 for receiving the user's search input and a presentation device 902 for presenting the selected content items in the dynamically-generated hierarchy. The input device 901 has a keypad and/or navigation interface, described below, to enable the user to enter query input. The presentation device 902 has a presentation screen for displaying content item search results and the content itself. The input and presentation devices 901, 902 could be the same device, as in the case of, for example, a mobile telephone, a PDA, or any other handheld computing device. Such a device may have a full QWERTY keyboard or equivalent, or the device may be an input-constrained device. Input constrained devices typically have limited input capabilities compared to devices having full keyboards. The 12-button keypad of a typical mobile phone provides one example of an input constrained device. The input device 901 and presentation device 902 can also be separate devices. For example, a television remote control can serve as the input device 901, while the television itself is the presentation device 902.
[0068] The system 900 also includes a content provider 903 for maintaining and providing content to the presentation device 902. The content provider 903 has a content catalog 904, a hierarchy catalog 905, and a query processing engine 906. The content catalog 904 contains the content items and associated data, such as the metadata terms that describe the various content items. The hierarchy catalog 905 contains the various concept cluster hierarchies associated with the content items, as described above. The query processing engine 906 receives the user query input and selects content items matching the query input (see the incorporated applications for examples of content item selection techniques).
[0069] The components of the content provider 903 can be present in a single server machine, or can be divided among multiple networked machines. Likewise, the various components can be combined or distributed in a number of ways. For example, the content catalog 904 can also store the hierarchies associated with the content items. In addition, a listing of the content items, the associated metadata, and the hierarchy information could be stored separately from the content items. This would enable the content list and associated data to be stored on the input device 901 and/or presentation device 902, while the actual content itself would be retained remotely. In some implementations, some or a portion of the content itself can be stored on the input device 901 and/or the presentation device 902.
[0070] The input device 901 communicates the user input to the content provider 903, and the content provider 903 returns the appropriate content item results to the presentation device 902, using the techniques described and incorporated above. The components of system 900 can communicate by a variety of known networking methods, including wired and wireless methods.
[0071] FIG. 10 illustrates a user device 1000 for use with the techniques and systems described above. The user device 1000 provides one example of a device that serves as both the input device 901 and presentation device 902 of FIG. 9 . The user device 1000 has a keypad 1001 with a full or input-constrained keypad for text entry and a navigation interface 1002, such as a five-button navigation interface, for enabling the user to browse the content items hierarchies, content item results, or content items themselves. The user device 1000 also includes a presentation area 1003 for displaying content items, hierarchies, and content item result lists. Presentation area 1003 includes a query display area 1004 for displaying the user's query input and a content display area 1005 for presenting the content items that have been grouped into the dynamically-formed concept clusters. The content display area 1005 can be further divided into a cluster identification area 1006 for displaying the currently selected cluster and a hierarchy display area 1007 for displaying content items or sub-clusters grouped under the selected cluster.
[0072] Note that the organization of information for browse purposes may differ from the hierarchy used for the presentation of dynamically-formed concept clusters. Furthermore, the incremental search input could have orthographic or typographic errors. The methods described in the incorporated applications can be used to overcome such errors and (1) enable the present methods to match the partial prefix input containing these errors with results and (2) generate dynamic cluster hierarchies, wherever meaningful.
[0073] This form of non-lexical concept-driven clustering of content item search results greatly enhances the user experience on display and/or input constrained devices such as television, cell phones, and PDA (personal digital assistants) because the user can discover the results of interest with minimal effort. However, methods and techniques described herein can be used with other user interfaces, for example, standard keyboards and/or mouse devices to achieve similar benefits.
[0074] It will be appreciated that the scope of the present invention is not limited to the above-described embodiments, but rather is defined by the appended claims, and these claims will encompass modifications of and improvements to what has been described. For example, the embodiments provided above are described in terms of providing audio/video content. However, the techniques, methods, and systems described and incorporated herein can be implemented with other content, such as address book entries, contact information, personal schedule information, or other types of data. In addition, a wide variety of physical devices can employ the techniques disclosed herein, e.g., PDAs, mobile telephones, and handheld PCs. These types of devices share many of the same constraints, namely, limited input and/or output capabilities, and thus, can benefit from aspects of the invention provided herein.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer-implemented method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device, the method comprising:
a database stored in an electronically readable storage medium for cataloging provide a relatively large set of content items, at least some of the content items having metadata to specify explicit concepts associated with the content items, and at least some of the metadata including phrases having more than one metadata term; receiving from a user incremental input to incrementally identify more than one search term for desired content items; selecting from the relatively large set of content items:
a first set of content items, wherein all search terms match metadata terms of a single one of the metadata phrases of each content item of said first set; a second set of content items, wherein a first subset of the search terms matches at least one metadata term of at least a first metadata phrase of each content item of said second set; and a third set of content items, wherein a second subset of the search terms matches at least one metadata term of at least a second metadata phrase of each content item of said third set, the first metadata phrase differing from the second metadata phrase; grouping the content items the second and third sets have in common to form an intersection set for user-implied concepts inferred from the explicit concepts associated with the metadata of the content items of the intersection set; organizing the content items of the first set and the intersection set into conceptual cluster sets:
the content items of the first set being organized into explicit conceptual cluster sets based on the metadata phrases having metadata terms matching the search terms so that content items having a same metadata phrase matching the search terms are clustered together; and the content items of the intersection set being organized into user-implied conceptual clusters based on at least the first and second metadata phrases the content items of the intersection set have in common so that content items having same first and second metadata phrases matching the search terms are clustered together; and presenting on the display-constrained device the content items organized into the explicit conceptual cluster sets and the user-implied conceptual cluster sets:
each explicit conceptual cluster set identified based on the metadata phrase common to the content items of said explicit conceptual cluster set having metadata terms matching the search terms; and each user-implied conceptual cluster set identified based on the first and second metadata phases the content items of said user-implied conceptual cluster set have in common.
2. The method of claim 1, wherein the incremental input is ambiguous text input, the ambiguous text input having one or more digits, each digit representing more than one alphanumeric character.
3. The method of claim 1, further comprising modifying the metadata terms of at least one of the metadata phrases of at least some of the content items based on at least one of the date, day, and time of the incremental input.
4. The method of claim 1, wherein the presenting the content items is on the display-constrained device.
5. The method of claim 1, wherein the incremental input comprises at least two prefixes in an ordered format.
6. The method of claim 1, wherein the incremental input comprises at least two prefixes in an unordered format.
7. The method of claim 1, wherein the incremental input comprises at least two prefixes separated by a word separator.
8. The method of claim 1, wherein the organized content items are ordered for presentation in accordance with a given relevance function, the relevance function comprising at least one of temporal relevance of the content items, location relevance of the content items, popularity of the content items, and preferences of the user.
9. The method of claim 1, wherein at least some of the metadata terms include phonetically equivalent terms to the explicit concepts associated with at least some of the content items.
10. The method of claim 1, wherein at least some of the metadata terms include commonly misspelled terms of the terms of the metadata phrases.
11. The method of claim 1, further comprising organizing the content items of the large set of content items into a predetermined hierarchy based on a relationship between the informational content of the content items, wherein the metadata to specify the explicit concepts associated with the content items is selected based on the predetermined hierarchy.
12. A system for searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display- constrained device, the system comprising:
a database stored in an electronically readable storage, medium for cataloging a relatively large set of content items, at least some of the content items having metadata to specify explicit concepts associated with the content items, and at least some of the metadata including phrases having more than one metadata term; an electronically readable medium containing instructions for causing a computer system to: input logic for receive from a user incremental input to incrementally identify more than one search term for desired content items; select from the relatively large set of content items:
a first set of content items, wherein all search terms match metadata terms of a single one of the metadata phrases of each content item of said first set; a second set of content items, wherein a first subset of the search terms matches at least one metadata term of at least a first metadata phrase of each content item of said second set; and a third set of content items, wherein a second subset of the search terms matches at least one metadata term of at least a second metadata phrase of each content item of said third set, the first metadata phrase differing from the second metadata phrase; for group the content items the second and third sets have in common to form an intersection set for user-implied concepts inferred from the explicit concepts associated with the metadata of the content items of the intersection set; organize the content items of the first set and the intersection set into conceptual cluster sets:
the content items of the first set being organized into explicit conceptual cluster sets based on the metadata phrases having metadata terms matching the search terms so that content items having a same metadata phrase matching the search terms are clustered together; and the content items of the intersection set being organized into user-implied conceptual clusters based on at least the first and second metadata phrases the content items of the intersection set have in common so that content items having same first and second metadata phrases matching the search terms are clustered together; and present on the display-constrained device the content items organized into the explicit conceptual cluster sets and the user-implied conceptual cluster sets:
each explicit conceptual cluster set identified based on the metadata phrase common to the content items of said explicit conceptual cluster set having metadata terms matching the search terms; and each user-implied conceptual cluster set identified based on the first and second metadata phases the content items of said user-implied conceptual cluster set have in common.
13. The system of claim 12, wherein at least a portion of the database stored in an electronically readable medium is implemented in a server system remote from the user.
14. The system of claim 12, wherein the electronically readable medium contains instructions for causing at least one of the receiving incremental input from a user, the selecting, the grouping, the organizing, and the presenting to be performed by the input logic, the selection logic, the grouping logic, the organization logic, and the presentation logic is implemented in a server system remote from the user.
15. The system of claim 12, wherein the incremental input is ambiguous text input, the ambiguous text input having one or more digits, each digit representing more than one alphanumeric character.
16. The system of claim 12, wherein the electronically readable medium contains instructions for causing a computer to comprise, modification logic for modify the metadata terms of at least one of the metadata phrases of at least some of the content items based on at least one of the date, day, and time of the incremental input.
17. The system of claim 12, wherein the electronically readable medium contains instructions for causing a computer to order the organized content items for presentation in accordance with a given relevance function, wherein the relevance function comprises at least one of temporal relevance of the content items, location relevance of the content items, popularity of the content items, and preferences of the user.
Patent Citations (154)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US1261167(A) | 1918-04-01 | Russell | 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 |
| US5623406(A) | 1997-04-01 | Ichbiah | Applicant |
| US5635989(A) | 1997-06-01 | Rothmuller | Applicant |
| US5745889(A) | 1998-04-01 | Burrows | 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 |
| 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 |
| 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 |
| US6011554(A) | 2000-01-01 | King et al. | Applicant |
| US6075526(A) | 2000-06-01 | Rothmuller | Applicant |
| US6133909(A) | 2000-10-01 | Schein et al. | Applicant |
| US6184877(B1) | 2001-02-01 | Dodson et al. | Applicant |
| US6189002(B1) | 2001-02-01 | Roitblat | 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 |
| US6307548(B1) | 2001-10-01 | Flinchem et al. | Applicant |
| US6307549(B1) | 2001-10-01 | King 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. | 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 |
| US6664980(B2) | 2003-12-01 | Bryan 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 |
| US6772147(B2) | 2004-08-01 | Wang | Applicant |
| US6785671(B1) | 2004-08-01 | Bailey 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 | 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. | Applicant |
| US7136854(B2) | 2006-11-01 | Smith | Applicant |
| US7149983(B1) | 2006-12-01 | Robertson et al. | 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 |
| US7293231(B1) | 2007-11-01 | Gunn et al. | Applicant |
| US2002/0042791(A1) | 2002-04-01 | Smith et al. | Applicant |
| US2002/0083448(A1) | 2002-06-01 | Johnson | Applicant |
| US2002/0133481(A1) | 2002-09-01 | Smith et al. | Applicant |
| US2003/0011573(A1) | 2003-01-01 | Villet et al. | Applicant |
| US2003/0014753(A1) | 2003-01-01 | Beach et al. | Applicant |
| US2003/0023976(A1) | 2003-01-01 | Kamen et al. | Applicant |
| US2003/0037043(A1) | 2003-02-01 | Chang et al. | Applicant |
| US2003/0046698(A1) | 2003-03-01 | Kamen et al. | Applicant |
| US2003/0066079(A1) | 2003-04-01 | Suga | Applicant |
| US2003/0084270(A1) | 2003-05-01 | Coon et al. | Examiner |
| US2003/0237096(A1) | 2003-12-01 | Barrett et al. | Applicant |
| US2004/0021691(A1) | 2004-02-01 | Dostie et al. | Applicant |
| US2004/0046744(A1) | 2004-03-01 | Rafii et al. | Applicant |
| US2004/0049783(A1) | 2004-03-01 | Lemmons 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 | Examiner |
| US2004/0155908(A1) | 2004-08-01 | Wagner | 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/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/0192944(A1) | 2005-09-01 | Flinchem | Applicant |
| US2005/0210020(A1) | 2005-09-01 | Gunn et al. | Applicant |
| 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. | Examiner |
| US2005/0278175(A1) | 2005-12-01 | Hyvonen | Applicant |
| US2005/0283468(A1) | 2005-12-01 | Kamvar et al. | Applicant |
| US2006/0013487(A1) | 2006-01-01 | Longe et al. | Applicant |
| US2006/0036640(A1) | 2006-02-01 | Tateno et al. | Examiner |
| US2006/0059044(A1) | 2006-03-01 | Chan et al. | Applicant |
| US2006/0075429(A1) | 2006-04-01 | Istvan 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. | Applicant |
| US2006/0173818(A1) | 2006-08-01 | Berstis et al. | Applicant |
| US2006/0190308(A1) | 2006-08-01 | Janssens et al. | Applicant |
| US2006/0206454(A1) | 2006-09-01 | Forstall et al. | Applicant |
| US2006/0256078(A1) | 2006-11-01 | Flinchem et al. | Applicant |
| US2006/0274051(A1) | 2006-12-01 | Longe 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. | Applicant |
| US2007/0050337(A1) | 2007-03-01 | Venkataraman et al. | Applicant |
| US2007/0061317(A1) | 2007-03-01 | Ramer et al. | Applicant |
| US2007/0061321(A1) | 2007-03-01 | Venkataraman | 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/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/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 |
| US2008/0071771(A1) | 2008-03-01 | Venkataraman et al. | Applicant |
| US2008/0086704(A1) | 2008-04-01 | Aravamudan | Applicant |
| US2008/0114743(A1) | 2008-05-01 | Venkataraman et al. | Applicant |
| US2008/0209229(A1) | 2008-08-01 | Ramakrishnan et al. | Applicant |
| EP1143691 | 2001-10-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 (25)
- 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
- 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
- Digital Video Broadcasting, http://www.dvb.org (Oct. 12, 2007).Applicant
- Gadd, Phonix: The Algorith, Program, vol. 24(4), Oct. 1990 (pp. 363-369).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 and Written Opinion, International Patent Application No. PCT/US07/67114, mailed Jul. 2, 2008 (6 pages).Applicant
- International Search Report and Written Opinion, International Patent Application No. PCT/US07/78490, mailed Jul. 3, 2008 (6 pages).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/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
- Mackenzie et al., LetterWise: Prefix-based disambiguation for mobile text input, Proceedings of the ACM Symposium on User Interface Software and Technology—UIST2001, pp. 111-120.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
- 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
- Review of Personalization Technologies: Collaborative Filtering vs. ChoiceStreams's Attributized Bayesian Choice Modeling, Technology Brief, ChoiceStream Technologies, Cambridge, MA.Applicant
- Silfverberg et al., Predicting text entry speed on mobile phones, Proceedings of the ACM Conference of Human Factors in Computing System—Chi, 2000. pp. 1-16.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 Applciation 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/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