WO2007025148A2 - Procede et systeme de traitement de demandes de recherche multitermes ambigues - Google Patents

Procede et systeme de traitement de demandes de recherche multitermes ambigues Download PDF

Info

Publication number
WO2007025148A2
WO2007025148A2 PCT/US2006/033257 US2006033257W WO2007025148A2 WO 2007025148 A2 WO2007025148 A2 WO 2007025148A2 US 2006033257 W US2006033257 W US 2006033257W WO 2007025148 A2 WO2007025148 A2 WO 2007025148A2
Authority
WO
WIPO (PCT)
Prior art keywords
search query
items
user
descriptors
server
Prior art date
Application number
PCT/US2006/033257
Other languages
English (en)
Other versions
WO2007025148A3 (fr
Inventor
Sashikumar Venkataraman
Rakesh Barve
Pankaj Garg
Pranav Rajanala
Murali Aravamudan
Ajit Rajasekharan
Original Assignee
Veveo, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US11/235,928 external-priority patent/US7788266B2/en
Priority claimed from US11/312,908 external-priority patent/US7779011B2/en
Application filed by Veveo, Inc. filed Critical Veveo, Inc.
Publication of WO2007025148A2 publication Critical patent/WO2007025148A2/fr
Publication of WO2007025148A3 publication Critical patent/WO2007025148A3/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/02—Input arrangements using manually operated switches, e.g. using keyboards or dials
    • G06F3/023—Arrangements for converting discrete items of information into a coded form, e.g. arrangements for interpreting keyboard generated codes as alphanumeric codes, operand codes or instruction codes
    • G06F3/0233—Character input methods
    • G06F3/0237—Character input methods using prediction or retrieval techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/332—Query formulation
    • G06F16/3322—Query formulation using system suggestions

Definitions

  • 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.
  • FIGURE 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 alpha-numeric 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • FIGURE 1 illustrates a keypad with overloaded keys in accordance with the prior art.
  • FIGURE 2 illustrates a search system in accordance with one or more embodiments of the invention.
  • FIGURE 3 illustrates various device configuration options for a device for performing searches in accordance with one or more embodiments of the invention.
  • FIGURE 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.
  • FIGURE 5 illustrates a many-to-many mapping of terms to the numeric equivalents.
  • FIGURE 6 illustrates the two different couplings between multiple terms in a query.
  • FIGURE 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.
  • FIGURES 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 FIGURE 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.
  • 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).
  • 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).
  • FIGURE 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.
  • 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.
  • 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).
  • 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).
  • 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.
  • PC Personal Computer
  • FIGURE 3 illustrates multiple exemplary configurations for search devices in accordance with various embodiments of the invention.
  • a search device e.g., PC 2
  • a device configuration for a device such as the hand-held device 206 might not include local persistent storage 312.
  • 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.
  • 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.
  • 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.
  • a television system 207 may have a set-top box or other device with a one-way link to a satellite network.
  • all search data including relevance updates may be downloaded to the device through a satellite link to perform local searching.
  • 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.
  • FIGURE 4 illustrates a search process in accordance with one or more embodiments of the invention.
  • 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.
  • 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.
  • 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.
  • CNBC cerebral abscess ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇
  • 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.
  • 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.
  • FIGURE 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.
  • FIGURE 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.
  • FIGURE 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 Serial No.
  • 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.
  • 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).
  • FIGURES 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.
  • the user has input a single character "5" with the intention that the character represent the letter "J".
  • the user's intent is to find "Tom and Jerry" television programs, and starts with entering "Jerry” in an unordered input.
  • 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.
  • 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.
  • 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Mathematical Physics (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • User Interface Of Digital Computer (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un système pour traiter une demande de recherche saisie par un utilisateur d'un dispositif présentant une interface de saisie de texte pourvue de touches surchargées. La demande de recherche concerne l'identification d'un article dans un ensemble d'articles. Un ou plusieurs descripteurs sont associés à chacun des articles. Le système reçoit une demande de recherche ambiguë concernant l'identification d'un article voulu. La demande de recherche est une sous-chaîne préfixée de chacun d'au moins deux mots en relation avec l'article voulu. Le système identifie de façon dynamique un groupe d'un ou de plusieurs articles dans l'ensemble d'articles. Le système fournit une identification du ou des articles du groupe identifié à afficher sur le dispositif utilisé par l'utilisateur.
PCT/US2006/033257 2005-08-26 2006-08-24 Procede et systeme de traitement de demandes de recherche multitermes ambigues WO2007025148A2 (fr)

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
US71186605P 2005-08-26 2005-08-26
US60/711,866 2005-08-26
US71610105P 2005-09-12 2005-09-12
US60/716,101 2005-09-12
US11/235,928 US7788266B2 (en) 2005-08-26 2005-09-27 Method and system for processing ambiguous, multi-term search queries
US11/235,928 2005-09-27
US11/312,908 2005-12-20
US11/312,908 US7779011B2 (en) 2005-08-26 2005-12-20 Method and system for dynamically processing ambiguous, reduced text search queries and highlighting results thereof

Publications (2)

Publication Number Publication Date
WO2007025148A2 true WO2007025148A2 (fr) 2007-03-01
WO2007025148A3 WO2007025148A3 (fr) 2009-05-07

Family

ID=37772441

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/US2006/033257 WO2007025148A2 (fr) 2005-08-26 2006-08-24 Procede et systeme de traitement de demandes de recherche multitermes ambigues
PCT/US2006/033258 WO2007025149A2 (fr) 2005-08-26 2006-08-24 Procede et systeme pour traiter de façon dynamique des demandes de recherche a texte reduit ambigues et mettre en evidence les resultats de ces demandes

Family Applications After (1)

Application Number Title Priority Date Filing Date
PCT/US2006/033258 WO2007025149A2 (fr) 2005-08-26 2006-08-24 Procede et systeme pour traiter de façon dynamique des demandes de recherche a texte reduit ambigues et mettre en evidence les resultats de ces demandes

Country Status (1)

Country Link
WO (2) WO2007025148A2 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013050225A1 (fr) * 2011-10-05 2013-04-11 Siemens Aktiengesellschaft Dispositif de mémoire pour stocker un dictionnaire, processeur pour développer et éditer le dictionnaire et interface de mot pour utiliser le dictionnaire
US8943083B2 (en) 2006-03-06 2015-01-27 Veveo, Inc. Methods and systems for segmenting relative user preferences into fine-grain and coarse-grain collections
US9087109B2 (en) 2006-04-20 2015-07-21 Veveo, Inc. User interface methods and systems for selecting and presenting content based on user relationships
US9135337B2 (en) 2004-11-09 2015-09-15 Veveo, Inc. Method and system for performing searches for television content using reduced text input
US9177081B2 (en) 2005-08-26 2015-11-03 Veveo, Inc. Method and system for processing ambiguous, multi-term search queries
US9223873B2 (en) 2006-03-30 2015-12-29 Veveo, Inc. Method and system for incrementally selecting and providing relevant search engines in response to a user query
US9703779B2 (en) 2010-02-04 2017-07-11 Veveo, Inc. Method of and system for enhanced local-device content discovery

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008107510A1 (fr) * 2007-03-07 2008-09-12 Cvon Innovations Ltd Procédé et système de contrôle d'accès

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040083198A1 (en) * 2002-07-18 2004-04-29 Bradford Ethan R. Dynamic database reordering system
US20040220926A1 (en) * 2000-01-03 2004-11-04 Interactual Technologies, Inc., A California Cpr[P Personalization services for entities from multiple sources

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6934756B2 (en) * 2000-11-01 2005-08-23 International Business Machines Corporation Conversational networking via transport, coding and control conversational protocols

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040220926A1 (en) * 2000-01-03 2004-11-04 Interactual Technologies, Inc., A California Cpr[P Personalization services for entities from multiple sources
US20040083198A1 (en) * 2002-07-18 2004-04-29 Bradford Ethan R. Dynamic database reordering system

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9135337B2 (en) 2004-11-09 2015-09-15 Veveo, Inc. Method and system for performing searches for television content using reduced text input
US9177081B2 (en) 2005-08-26 2015-11-03 Veveo, Inc. Method and system for processing ambiguous, multi-term search queries
US9128987B2 (en) 2006-03-06 2015-09-08 Veveo, Inc. Methods and systems for selecting and presenting content based on a comparison of preference signatures from multiple users
US9075861B2 (en) 2006-03-06 2015-07-07 Veveo, Inc. Methods and systems for segmenting relative user preferences into fine-grain and coarse-grain collections
US9092503B2 (en) 2006-03-06 2015-07-28 Veveo, Inc. Methods and systems for selecting and presenting content based on dynamically identifying microgenres associated with the content
US8949231B2 (en) 2006-03-06 2015-02-03 Veveo, Inc. Methods and systems for selecting and presenting content based on activity level spikes associated with the content
US8943083B2 (en) 2006-03-06 2015-01-27 Veveo, Inc. Methods and systems for segmenting relative user preferences into fine-grain and coarse-grain collections
US9213755B2 (en) 2006-03-06 2015-12-15 Veveo, Inc. Methods and systems for selecting and presenting content based on context sensitive user preferences
US9223873B2 (en) 2006-03-30 2015-12-29 Veveo, Inc. Method and system for incrementally selecting and providing relevant search engines in response to a user query
US9087109B2 (en) 2006-04-20 2015-07-21 Veveo, Inc. User interface methods and systems for selecting and presenting content based on user relationships
US10146840B2 (en) 2006-04-20 2018-12-04 Veveo, Inc. User interface methods and systems for selecting and presenting content based on user relationships
US9703779B2 (en) 2010-02-04 2017-07-11 Veveo, Inc. Method of and system for enhanced local-device content discovery
WO2013050225A1 (fr) * 2011-10-05 2013-04-11 Siemens Aktiengesellschaft Dispositif de mémoire pour stocker un dictionnaire, processeur pour développer et éditer le dictionnaire et interface de mot pour utiliser le dictionnaire

Also Published As

Publication number Publication date
WO2007025149A3 (fr) 2009-05-07
WO2007025149A2 (fr) 2007-03-01
WO2007025148A3 (fr) 2009-05-07

Similar Documents

Publication Publication Date Title
US11886474B2 (en) Method and system for processing ambiguous, multi-term search queries
US20230384870A1 (en) Method and system for dynamically processing ambiguous, reduced text search queries and highlighting results thereof
US20190253762A1 (en) Method and system for performing searches for television content using reduced text input
US9031962B2 (en) 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
US20070088681A1 (en) Method and system for offsetting network latencies during incremental searching using local caching and predictive fetching of results from a remote server
US8589324B2 (en) System and method for finding desired results by incremental search using an ambiguous keypad with the input containing typographic errors
WO2007025148A2 (fr) Procede et systeme de traitement de demandes de recherche multitermes ambigues

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06802344

Country of ref document: EP

Kind code of ref document: A2