Patents by Inventor Huaiyu Zhu
Huaiyu Zhu 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: 20150220608Abstract: Search results are provided for a search query. A search query including an entity and entity type is received. The entity is parsed into semantic components. Variants are generated based on input from auxiliary information and user configuration information for each of the semantic components. The entity is recomposed in different morphological forms from different variants of the semantic components. At least one morphological form for the entity is presented as a search result.Type: ApplicationFiled: April 17, 2015Publication date: August 6, 2015Inventors: Adriano Crestani Campos, Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Patent number: 9063926Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.Type: GrantFiled: August 27, 2012Date of Patent: June 23, 2015Assignee: International Business Machines CorporationInventors: Adriano Crestani Campos, Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Patent number: 8996358Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.Type: GrantFiled: May 25, 2012Date of Patent: March 31, 2015Assignee: International Business Machines CorporationInventors: Adriano Crestani Campos, Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Patent number: 8856452Abstract: A method and apparatus for prefetching data from memory for a multicore data processor. A prefetcher issues a plurality of requests to prefetch data from a memory device to a memory cache. Consecutive cache misses are recorded in response to at least two of the plurality of requests. A time between the cache misses is determined and a timing of a further request to prefetch data from the memory device to the memory cache is altered as a function of the determined time between the two cache misses.Type: GrantFiled: May 31, 2011Date of Patent: October 7, 2014Assignee: Illinois Institute of TechnologyInventors: Xian-He Sun, Yong Chen, Huaiyu Zhu
-
Patent number: 8775419Abstract: A method for refining a dictionary for information extraction, the operations including: inputting a set of extracted results from execution of an extractor comprising the dictionary on a collection of text, wherein the extracted results are labeled as correct results or incorrect results; processing the extracted results using an algorithm configured to set a score of the extractor above a score threshold, wherein the score threshold balances a precision and a recall of the extractor; and outputting a set of candidate dictionary entries corresponding to a full set of dictionary entries, wherein the candidate dictionary entries are candidates to be removed from the dictionary based on the extracted results.Type: GrantFiled: August 30, 2012Date of Patent: July 8, 2014Assignee: International Business Machines CorporationInventors: Laura Chiticariu, Vitaly Feldman, Frederick R. Reiss, Huaiyu Zhu, Sudeepa Roy
-
Patent number: 8630989Abstract: Described herein are methods, systems, apparatuses and products for automatically discovering patterns in a text corpus. An aspect provides extracting at least one context string related to at least one annotator from the at least one text corpus; analyzing the at least one context string for at least one sequence, the at least one sequence comprised of at least one subsequence; determining at least one sequence signature for each at least one sequence by applying applicable rules to the at least one sequence; and grouping the at least one sequence signature into at least one group.Type: GrantFiled: May 27, 2011Date of Patent: January 14, 2014Assignee: International Business Machines CorporationInventors: Sebastian Johannes Blohm, Vivian Yaw-Wen Chu, Ching-Tien Ho, Yunyao Li, Huaiyu Zhu
-
Publication number: 20130317807Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.Type: ApplicationFiled: August 27, 2012Publication date: November 28, 2013Applicant: International Business Machines CorporationInventors: Adriano CRESTANI CAMPOS, Yunyao LI, Sriram RAGHAVAN, Huaiyu ZHU
-
Publication number: 20130317806Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.Type: ApplicationFiled: May 25, 2012Publication date: November 28, 2013Applicant: International Business Machines CorporationInventors: Adriano Crestani Campos, Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Publication number: 20130318075Abstract: A method for refining a dictionary for information extraction, the operations including: inputting a set of extracted results from execution of an extractor comprising the dictionary on a collection of text, wherein the extracted results are labeled as correct results or incorrect results; processing the extracted results using an algorithm configured to set a score of the extractor above a score threshold, wherein the score threshold balances a precision and a recall of the extractor; and outputting a set of candidate dictionary entries corresponding to a full set of dictionary entries, wherein the candidate dictionary entries are candidates to be removed from the dictionary based on the extracted results.Type: ApplicationFiled: May 25, 2012Publication date: November 28, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Laura Chiticariu, Vitaly Feldman, Frederick R. Reiss, Sudeepa Roy, Huaiyu Zhu
-
Publication number: 20130318076Abstract: A method for refining a dictionary for information extraction, the operations including: inputting a set of extracted results from execution of an extractor comprising the dictionary on a collection of text, wherein the extracted results are labeled as correct results or incorrect results; processing the extracted results using an algorithm configured to set a score of the extractor above a score threshold, wherein the score threshold balances a precision and a recall of the extractor; and outputting a set of candidate dictionary entries corresponding to a full set of dictionary entries, wherein the candidate dictionary entries are candidates to be removed from the dictionary based on the extracted results.Type: ApplicationFiled: August 30, 2012Publication date: November 28, 2013Applicant: International Business Machines CorporationInventors: Laura Chiticariu, Vitaly Feldman, Frederick R. Reiss, Sudeepa Roy, Huaiyu Zhu
-
Publication number: 20130185330Abstract: Described herein are methods, systems, apparatuses and products for rule-driven runtime customization of keyword search engines. An aspect provides a method for rule-driven customization of keyword searches, including: receiving by a computer an input keyword query; determining from the input keyword query and a dataset to be queried at least one rule selected from the group consisting of: a re-write rule; a category ranking rule, and a category grouping rule; and applying the at least one rule to generate search results based on domain knowledge of the dataset. Other embodiments are disclosed.Type: ApplicationFiled: August 27, 2012Publication date: July 18, 2013Applicant: INTERNATIONAL BUSINESS MACHINESInventors: Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Publication number: 20130185304Abstract: Described herein are methods, systems, apparatuses and products for rule-driven runtime customization of keyword search engines. An aspect provides a method for rule-driven customization of keyword searches, including: receiving by a computer an input keyword query; determining from the input keyword query and a dataset to be queried at least one rule selected from the group consisting of: a re-write rule; a category ranking rule, and a category grouping rule; and applying the at least one rule to generate search results based on domain knowledge of the dataset. Other embodiments are disclosed.Type: ApplicationFiled: January 17, 2012Publication date: July 18, 2013Applicant: INTERNATIONAL BUSINESS MACHINESInventors: Yunyao Li, Sriram Raghavan, Huaiyu Zhu
-
Publication number: 20120311270Abstract: A method and apparatus for prefetching data from memory for a multicore data processor. A prefetcher issues a plurality of requests to prefetch data from a memory device to a memory cache. Consecutive cache misses are recorded in response to at least two of the plurality of requests. A time between the cache misses is determined and a timing of a further request to prefetch data from the memory device to the memory cache is altered as a function of the determined time between the two cache misses.Type: ApplicationFiled: May 31, 2011Publication date: December 6, 2012Applicant: Illinois Institute of TechnologyInventors: Xian-He Sun, Yong Chen, Huaiyu Zhu
-
Publication number: 20120303661Abstract: Described herein are methods, systems, apparatuses and products for automatically discovering patterns in a text corpus. An aspect provides extracting at least one context string related to at least one annotator from the at least one text corpus; analyzing the at least one context string for at least one sequence, the at least one sequence comprised of at least one subsequence; determining at least one sequence signature for each at least one sequence by applying applicable rules to the at least one sequence; and grouping the at least one sequence signature into at least one group.Type: ApplicationFiled: May 27, 2011Publication date: November 29, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sebastian Johannes Blohm, Vivian Yaw-Wen Chu, Ching-Tien Ho, Yunyao Li, Huaiyu Zhu
-
Patent number: 8103705Abstract: A text annotation structured storage system stores text annotations with associated type information in a structured data store. The present system persists or stores annotations in a structured data store in an indexable and queryable format. Exemplary structured data stores comprise XML databases and relational databases. The system exploits type information in a type system to develop corresponding schemas in a structured data model. The system comprises techniques for mapping annotations to an XML data model and a relational data model. The system captures various features of the type system, such as complex types and inheritance, in the schema for the persistent store. In particular, the repository provides support for path navigation over the hierarchical type system starting at any type.Type: GrantFiled: October 23, 2008Date of Patent: January 24, 2012Assignee: International Business Machines CorporationInventors: Krishna Prasad Chitrapura, Rahul Gupta, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu, Jennifer L. Beckmann
-
Patent number: 8000957Abstract: The present invention relates to a methodology to translate exact interpretations of keyword queries into meaningful and grammatically correct plain-language queries in order to convey the meaning of these interpretations to the initiator of the search. The method includes the steps of generating at least one grammatically valid plain-language sentence interpretation for a keyword query from a generated sentence plain-language sentence clauses, wherein the grammatically valid plain-language sentence is based upon differing matching elements, and presenting at least one grammatically valid plain-language sentence interpretation for the keyword query to a keyword query system user for the user's review.Type: GrantFiled: May 29, 2008Date of Patent: August 16, 2011Assignee: International Business Machines CorporationInventors: Prasad M. Deshpande, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu
-
Publication number: 20090198646Abstract: Systems, methods and computer program products for an algebraic approach to rule-based information extraction. Exemplary embodiments include a method for rule-based information extraction, the method including specifying an annotator using algebraic operators, wherein each algebraic operator describes annotations identification from text documents.Type: ApplicationFiled: January 31, 2008Publication date: August 6, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rajasekar Krishnamurthy, Sriram Raghavan, Frederick R. Reiss, Shivakumar Vaithyanathan, Huaiyu Zhu
-
Publication number: 20090192987Abstract: Exemplary embodiments of the present invention relate to a method for searching navigational pages within an intranet environment. The method comprises identifying a plurality of navigational pages, performing a page-level analysis upon each identified navigational page in order to determine if a navigational page can be categorized as a candidate navigational page, performing a cross-page analysis upon each determined candidate navigational page in order to generate a final set of navigational pages, associating each final navigational page with a predetermined semantic classification group, generating term variants for each navigational page, building a navigational index for each semantic classification grouping, and filtering user queries in association with a user profile of a user that is posing a query.Type: ApplicationFiled: January 30, 2008Publication date: July 30, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alexander Loeser, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu
-
Patent number: 7548933Abstract: A query interpretation system exploits semantic annotations in keyword queries over a collection of text documents, casting semantic annotations produced by text analysis engines into a formal annotation type system. The system uses the annotation type system to enumerate various interpretations of a keyword query and automatically translate a keyword query into a set of interpretations expressed in some intermediate query language. The system returns a result list of documents by combining the results of executing one or more of these interpretations. Even though the system generates and uses a complex type system, a user is able to use simple keyword queries to locate documents.Type: GrantFiled: October 14, 2005Date of Patent: June 16, 2009Assignee: International Business Machines CorporationInventors: Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu
-
Publication number: 20090049021Abstract: A text annotation structured storage system stores text annotations with associated type information in a structured data store. The present system persists or stores annotations in a structured data store in an indexable and queryable format. Exemplary structured data stores comprise XML databases and relational databases. The system exploits type information in a type system to develop corresponding schemas in a structured data model. The system comprises techniques for mapping annotations to an XML data model and a relational data model. The system captures various features of the type system, such as complex types and inheritance, in the schema for the persistent store. In particular, the repository provides support for path navigation over the hierarchical type system starting at any type.Type: ApplicationFiled: October 23, 2008Publication date: February 19, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Krishna Prasad Chitrapura, Rahul Gupta, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu