Patents by Inventor Shyam Kapur

Shyam Kapur has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20070233650
    Abstract: A system and method to facilitate automatic categorization of events in a network, wherein one or more keywords are retrieved from a keyword database, each retrieved keyword matching a corresponding event unit of an event input by a user over a network. A dominant keyword corresponding to a highest parameter value calculated for each retrieved keyword is then selected. Finally, the event is categorized based on one or more categories associated with the dominant keyword. The dominant keyword may be selected based on one or more keyword categories associated with each retrieved keyword and an ambiguity parameter value calculated for each keyword. Alternatively, the dominant keyword may be selected based on a highest-ranked output value calculated for each retrieved keyword. One or more categories associated with the dominant keyword are subsequently retrieved from the keyword database and the event is categorized based on the category associated with the dominant keyword.
    Type: Application
    Filed: March 29, 2006
    Publication date: October 4, 2007
    Inventors: Chad Brower, Shyam Kapur, Brian Coppola, Joshua M. Koran, Jignashu Parikh
  • Publication number: 20070233814
    Abstract: The present invention relates to systems and methods for facilitating the interaction with data using interactive data structures. The method of the present invention comprises generating one or more objects associated with one or more items of content. The one or more objects are combined to form an interactive data structure. The content associated with the one or more objects and the interactive data structure are delivered to a client device. One or more modifications may be made to the one or more objects comprising the interactive data structure. The one or more modifications made to the one or more objects comprising the interactive data structure may be propagated to the content associated with the one or more objects.
    Type: Application
    Filed: March 31, 2006
    Publication date: October 4, 2007
    Inventor: Shyam Kapur
  • Publication number: 20070226198
    Abstract: Systems and methods for processing search requests include analyzing received queries in order to provide a more sophisticated understanding of the information being sought. In one embodiment, queries are parsed into units, which may comprise one or more words or tokens of the query, and the units are related in concept networks. Trend analysis is performed by sorting the queries into subsets along a dimension of interest and comparing concept networks for different subsets. Trend information is usable to enhance a response of an automated search agent to a subsequently received query.
    Type: Application
    Filed: May 30, 2007
    Publication date: September 27, 2007
    Inventor: Shyam Kapur
  • Patent number: 7240049
    Abstract: Systems and methods for processing search requests include analyzing received queries in order to provide a more sophisticated understanding of the information being sought. In one embodiment, queries are parsed into units, which may comprise one or more words or tokens of the query, and the units are related in concept networks. Trend analysis is performed by sorting the queries into subsets along a dimension of interest and comparing concept networks for different subsets. Trend information is usable to enhance a response of an automated search agent to a subsequently received query.
    Type: Grant
    Filed: November 12, 2003
    Date of Patent: July 3, 2007
    Assignee: Yahoo! Inc.
    Inventor: Shyam Kapur
  • Publication number: 20070136256
    Abstract: Embodiments of a data representation system for describing specific data sets, such as documents, web pages, or search engine queries, based on data tokens, such as words or n-grams, contained in a collection of documents are described. Such a system can be used in any type of information retrieval application, such as a document, web page, or online advertisement serving process, based on an information request, such as a query executed through an Internet search engine. For example, when a search is performed at a search engine, a content provider uses the system to represent the search query and compares the query representation against representations of a set of content in order to identify, retrieve and aggregate the content from the set most relevant to the search query, in the form of a web page or other data unit for display or access through the web browser.
    Type: Application
    Filed: December 1, 2006
    Publication date: June 14, 2007
    Inventors: Shyam Kapur, Ayman Farahat, Richard Chatwin
  • Publication number: 20070100798
    Abstract: The present invention is directed towards methods and systems that facilitate the searching for and retrieval of one or more result sets, each result set generated by a one or more users. A method according to one embodiment of the present invention comprises receiving one or more query terms from a given user and identifying one or more result set data structures as falling within the scope of the one or more query terms from the given user, a given result set data structure comprising one or more query terms and one or more items in a result set. A community result set is generated on the basis of the one or more result set data structures falling within the scope of the one or more query terms from the given user, which is presented to the given user.
    Type: Application
    Filed: October 31, 2005
    Publication date: May 3, 2007
    Inventor: Shyam Kapur
  • Publication number: 20070094250
    Abstract: In a computer system including a search engine that receives queries and returns search results comprising zero or more hits from a document index, a method of post-rocessing queries and results comprising collecting search sets, wherein a search set comprises a query and at least some set of the search results provided by the search engine in response to the query from a corpus, storing the plurality of search set in reference symbol storage, identifying an analysis set comprising at least two documents in the corpus to comparatively analyze, retreating from the retrievable storage search sets containing at least one document of the analysis set, thus obtaining a group of one or more search sets, generating an inference between the documents in the analysis set based on which is search sets occur in the group.
    Type: Application
    Filed: October 20, 2005
    Publication date: April 26, 2007
    Applicant: Yahoo! Inc.
    Inventor: Shyam Kapur
  • Publication number: 20070078828
    Abstract: In a computerized search system, a document corpus is searched according to a query and results of the search are presentable as an ordered search result set comprising one or more search hits, a search hit being a document of the document corpus or reference thereto. Based on content of the search result set, a number of suggested queries and/or parameter options are presented to a querier, thereby allowing the querier to select a suggested query and/or provide values for the parameters and those selections can be used to reorder the hits of the search result set. The particular suggested queries and/or parameters presented depend on the page elements of the search result set's documents and their categorization. The categorization might be done using concept networks.
    Type: Application
    Filed: October 5, 2005
    Publication date: April 5, 2007
    Applicant: Yahoo! Inc.
    Inventors: Jignashu Parikh, J. Harish, Shyam Kapur
  • Publication number: 20070055652
    Abstract: Providing a speculative search result for a search query prior to completion of the search query. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user.
    Type: Application
    Filed: August 24, 2005
    Publication date: March 8, 2007
    Inventors: Stephen Hood, Ralph Rabbat, Mihir Shah, Adam Durfee, Alastair Gourlay, Peter Anick, Richard Kasperski, Oliver Bayley, Ashley Hall, Shyam Kapur, John Thrall
  • Publication number: 20060206476
    Abstract: Techniques are provided for reranking and increasing the relevance of the results Internet searches. A search query is initially parsed into individual units. Each unit corresponds to one or more words that represents a natural concept. A concept network is analyzed to locate concepts that are related to the units in the search query. Particular concepts are selected from the concept network. Independent Internet searches are performed for each of the selected concepts. The search results from these searches are then compared to units in the original search query and ranked according to their relevance to the original search query.
    Type: Application
    Filed: March 10, 2005
    Publication date: September 14, 2006
    Applicant: Yahoo!, Inc.
    Inventors: Shyam Kapur, Jignashu Parikh
  • Publication number: 20060206474
    Abstract: Techniques are provided for modifying queries to increase the number of sponsored links that are returned in response to the queries. A query modification system uses a predefined set of rules that are designated to modify a query to increase the chance that the modified query will match more sponsored links. The modified query is then matched against a listing of search query strings that have been pre-selected by sponsors. Each pre-selected search query strings corresponds to one or more sponsored web links. If the modified query matches one of the pre-selected search query strings, the corresponding sponsored web links are returned and displayed to the user.
    Type: Application
    Filed: March 10, 2005
    Publication date: September 14, 2006
    Applicant: Yahoo!, Inc.
    Inventors: Shyam Kapur, Nitin Sharma
  • Publication number: 20060167896
    Abstract: Multiple concept networks are generated from subsets of received queries. These concept networks can be used in various ways to enhance response to subsequent queries. In one embodiment, concept networks can be merged into a larger concept network that can be used to infer a user's likely intent given a query. In another embodiment, suggestions for related searches obtained using different concept networks can be merged or aggregated. Other users for concept networks in query processing, including assisted search, are also described.
    Type: Application
    Filed: December 5, 2005
    Publication date: July 27, 2006
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20060122979
    Abstract: Search results are processed using search requests, including analyzing received queries in order to provide a more sophisticated understanding of the information being sought. A concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units. From these concept networks, queries can be automatically categorized into categories, or more generally, can be associated with one or more nodes of a taxonomy. The categorization can be used to alter the search results or the presentation of the results to the user. As an example of alterations of search results or presentation, the presentation might include a list of “suggestions” for related search query terms. As other examples, the corpus searched might vary depending on the category or the ordering or selection of the results to present to the user might vary depending on the category.
    Type: Application
    Filed: December 6, 2004
    Publication date: June 8, 2006
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20060122994
    Abstract: Systems and methods for processing search requests are provided, including automatic generation of taxonomies and query processing using those taxonomies.
    Type: Application
    Filed: December 6, 2004
    Publication date: June 8, 2006
    Applicant: Yahoo! Inc.
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Patent number: 7051023
    Abstract: Systems and method for enhancing search functionality provided to a user. In certain aspects, a query processing engine automatically decomposes queries into constituent units that are related to concepts in which a user may be interested. The query processing engine decomposes queries into one or more constituent units per query using statistical methods. In certain aspects, no real world knowledge is used in determining units. In other aspects, aspects of world and content knowledge are introduced to enhance and optimize performance, for example, manually using a team of one or more information engineers.
    Type: Grant
    Filed: November 12, 2003
    Date of Patent: May 23, 2006
    Assignee: Yahoo! Inc.
    Inventors: Shyam Kapur, Deepa Joshi
  • Publication number: 20050228780
    Abstract: A method and apparatus for generating search results including searching by subdomain and providing sponsored results by subdomain is provided. A search system according to embodiments of the present invention analyzes search queries to determine if they are to be routed to subdomains and presents results include sponsored hits sponsored on a subdomain by subdomain basis.
    Type: Application
    Filed: April 5, 2004
    Publication date: October 13, 2005
    Applicant: Yahoo! Inc.
    Inventors: Ali Diab, Scott Gatz, Shyam Kapur, David Ku, Chuck Kung, Phu Hoang, Qi Lu, Lynne Pogue, Yuan Shen, Norman Shi, Thai Tran, Eckart Walther, Jeff Weiner
  • Publication number: 20050102259
    Abstract: Systems and methods for processing search requests include analyzing received queries in order to provide a more sophisticated understanding of the information being sought. In one embodiment, queries are parsed into units, which may comprise one or more words or tokens of the query, and the units are related in concept networks. Trend analysis is performed by sorting the queries into subsets along a dimension of interest and comparing concept networks for different subsets. Trend information is usable to enhance a response of an automated search agent to a subsequently received query.
    Type: Application
    Filed: November 12, 2003
    Publication date: May 12, 2005
    Applicant: YAHOO! INC.
    Inventor: Shyam Kapur
  • Publication number: 20050080795
    Abstract: In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.
    Type: Application
    Filed: March 9, 2004
    Publication date: April 14, 2005
    Applicant: Yahoo! Inc.
    Inventors: Shyam Kapur, Jignashu Parikh, Deepa Joshi
  • Publication number: 20040249801
    Abstract: Systems and methods for enhancing information retrieval and communication functionality through the use of a universal interface that is configurable to interface with multiple applications resident on a user computer, and which provides a persistent two-way communication channel for communicating with search intelligence on a remote system. Sharable, actionable labels and codebooks of labels may be defined by a user. Each label may be defined in a natural language format and may include a mapping to a specific application or set of applications executable on a user system. Transfer of labels and codebooks between user systems allows for enhanced information exchange and retrieval among users as well as information exchange tracking and analysis by a server system.
    Type: Application
    Filed: April 5, 2004
    Publication date: December 9, 2004
    Applicant: Yahoo!
    Inventor: Shyam Kapur
  • Publication number: 20040199498
    Abstract: Systems and method for enhancing search functionality provided to a user. In certain aspects, a query processing engine automatically decomposes queries into constituent units that are related to concepts in which a user may be interested. The query processing engine decomposes queries into one or more constituent units per query using statistical methods. In certain aspects, no real world knowledge is used in determining units. In other aspects, aspects of world and content knowledge are introduced to enhance and optimize performance, for example, manually using a team of one or more information engineers.
    Type: Application
    Filed: November 12, 2003
    Publication date: October 7, 2004
    Applicant: Yahoo! Inc.
    Inventors: Shyam Kapur, Deepa Joshi