Patents by Inventor Avinesh Polisetty Venkata Sai

Avinesh Polisetty Venkata Sai 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).

  • Patent number: 11281680
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Grant
    Filed: August 19, 2019
    Date of Patent: March 22, 2022
    Assignee: International Business Machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 11281679
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Grant
    Filed: August 19, 2019
    Date of Patent: March 22, 2022
    Assignee: International Business Machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Publication number: 20190370261
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Application
    Filed: August 19, 2019
    Publication date: December 5, 2019
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Publication number: 20190370260
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Application
    Filed: August 19, 2019
    Publication date: December 5, 2019
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 10387434
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Grant
    Filed: May 24, 2016
    Date of Patent: August 20, 2019
    Assignee: International Business Machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 10311065
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Grant
    Filed: December 1, 2015
    Date of Patent: June 4, 2019
    Assignee: International Business Machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 10303689
    Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.
    Type: Grant
    Filed: June 27, 2016
    Date of Patent: May 28, 2019
    Assignee: International Business Machines Corporation
    Inventors: Chinnappa Guggilla, Prabhakar R. Majjiga, Praveen K. Midde, Avinesh Polisetty Venkata Sai
  • Patent number: 10198504
    Abstract: A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision.
    Type: Grant
    Filed: June 15, 2015
    Date of Patent: February 5, 2019
    Assignee: International Business machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 10191946
    Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.
    Type: Grant
    Filed: March 11, 2015
    Date of Patent: January 29, 2019
    Assignee: International Business Machines Corporation
    Inventors: Chinnappa Guggilla, Prabhakar R. Majjiga, Praveen K. Midde, Avinesh Polisetty Venkata Sai
  • Patent number: 10055485
    Abstract: A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: August 21, 2018
    Assignee: International Business Machines Corporation
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Publication number: 20170154045
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Application
    Filed: December 1, 2015
    Publication date: June 1, 2017
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Publication number: 20170154103
    Abstract: Scoring candidate evidence passages for criteria validation. Evidence data associated with a criteria, such that the evidence data entries include a decision indicator indicating that the criteria is either met or not met by the evidence data, is collected. Candidate evidences, making up a corpus of data associated with the criteria, against which the criteria is to be validated, are generated. Each candidate evidence is evaluated against the evidence data. A score indicating the validity of the criteria with respect to the candidate evidence is generated, based on the decision indicators associated with the evidence data entries.
    Type: Application
    Filed: May 24, 2016
    Publication date: June 1, 2017
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Patent number: 9535894
    Abstract: Machine logic that automatically detects natural language processing (NLP) system annotation errors and correspondingly updates NLP annotators to prevent future erroneous annotations by performing the following steps: (i) determining that a first annotation error has occurred in an annotation of a corpus by the natural language processing system; (ii) generating a candidate set of annotation correction actions, where each annotation correction action of the set is adapted to prevent an occurrence of an error similar to the first annotation error by the natural language processing system; (iii) selecting an annotation correction action from the candidate set of annotation correction actions, based, at least in part, on a set of annotation correction confidence characteristics; and (iv) automatically applying the selected annotation correction action to the natural language processing system.
    Type: Grant
    Filed: April 27, 2015
    Date of Patent: January 3, 2017
    Assignee: International Business Machines Corporation
    Inventors: Scott R. Carrier, Joy Mustafi, Anil M. Omanwar, Avinesh Polisetty Venkata Sai
  • Publication number: 20160314106
    Abstract: Machine logic that automatically detects natural language processing (NLP) system annotation errors and correspondingly updates NLP annotators to prevent future erroneous annotations by performing the following steps: (i) determining that a first annotation error has occurred in an annotation of a corpus by the natural language processing system; (ii) generating a candidate set of annotation correction actions, where each annotation correction action of the set is adapted to prevent an occurrence of an error similar to the first annotation error by the natural language processing system; (iii) selecting an annotation correction action from the candidate set of annotation correction actions, based, at least in part, on a set of annotation correction confidence characteristics; and (iv) automatically applying the selected annotation correction action to the natural language processing system.
    Type: Application
    Filed: April 27, 2015
    Publication date: October 27, 2016
    Inventors: Scott R. Carrier, Joy Mustafi, Anil M. Omanwar, Avinesh Polisetty Venkata Sai
  • Publication number: 20160306852
    Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.
    Type: Application
    Filed: June 27, 2016
    Publication date: October 20, 2016
    Inventors: Chinnappa Guggilla, Prabhakar R. Majjiga, Praveen K. Midde, Avinesh Polisetty Venkata Sai
  • Publication number: 20160267117
    Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.
    Type: Application
    Filed: March 11, 2015
    Publication date: September 15, 2016
    Inventors: Chinnappa Guggilla, Prabhakar R. Majjiga, Praveen K. Midde, Avinesh Polisetty Venkata Sai
  • Publication number: 20160147870
    Abstract: A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision.
    Type: Application
    Filed: June 15, 2015
    Publication date: May 26, 2016
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai
  • Publication number: 20160147872
    Abstract: A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision.
    Type: Application
    Filed: November 25, 2014
    Publication date: May 26, 2016
    Inventors: Lalit Agarwalla, Ankur Parikh, Avinesh Polisetty Venkata Sai