Patents by Inventor Christopher F. Ackermann

Christopher F. Ackermann 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: 11132358
    Abstract: A method includes searching an initial set of documents for an initial set of query names. Each query name of the initial set of query names is associated with at least one document of the initial set of documents. The method also includes prioritizing the initial set of query names based on at least one topic label. The method also includes searching an additional set of documents to generate candidate query names. The method also includes prioritizing the candidate query names based on the at least one topic label. The method further includes applying a temporal search filter to each candidate query name to determine whether the candidate query name was processed within a time frame. The method further includes performing disambiguation processing on each candidate query name not processed within the time frame.
    Type: Grant
    Filed: February 19, 2019
    Date of Patent: September 28, 2021
    Assignee: International Business Machines Corporation
    Inventors: Charles E. Beller, Kristen Maria Summers, Christopher F. Ackermann, Michael Drzewucki, Andrew Doyle
  • Publication number: 20210256049
    Abstract: A mechanism is provided in a data processing system to implement a cognitive natural language processing (NLP) system with descriptor uniqueness identification to support named entity mention clustering. The mechanism annotates a set of documents from a corpus of documents for entity types and mentions, collects descriptor usages from all documents in the corpus of documents, analyzes the descriptor usages to classify the descriptors as base terms or modifier terms, generates compatibility scores for the descriptors, and performs entity merging of entity clusters based on the compatibility scores.
    Type: Application
    Filed: February 17, 2020
    Publication date: August 19, 2021
    Inventors: Donna K. Byron, Edward Graham Katz, Christopher F. Ackermann, Charles E. Beller
  • Publication number: 20210165772
    Abstract: A service receives, from a query entity store, a query store result in response to an initial query referencing at least one of a name element and a first identifier component related to an entity, the query store result comprising a query store record comprising information related to the entity. The service receives, from a target entity store, a target store result to a target store query referencing the query store record, the target store result comprising one or more target store records related to the information found in the query store record. The service compares the one or more target store records to the information in the query store record. The service, responsive to determining a relevancy assessment indicates a match between the information in the query store record and two or more particular target store records from among the one or more target store records, triggers the target entity store to merge the two or more particular target store records.
    Type: Application
    Filed: December 3, 2019
    Publication date: June 3, 2021
    Inventors: CHRISTOPHER F. ACKERMANN, CHARLES E. BELLER, EDWARD G. KATZ, MICHAEL DRZEWUCKI
  • Publication number: 20210073329
    Abstract: Embodiments relate to an intelligent computer platform to selectively amend one or more tokens in a document. A first document set is subjected to natural language processing (NLP) and a vector score is identified for two or more documents of the first document set. Upon receipt of a new document, the new document is subjected to NLP and a new document vector score is identified. The new document is analyzed against the first document set, and the identified vector score of the first document set is compared to the vector score of the new document. One or more tokens of the new document are amended responsive to the comparison, and a new document version is created from the selective amendment.
    Type: Application
    Filed: September 9, 2019
    Publication date: March 11, 2021
    Applicant: International Business Machines Corporation
    Inventors: Charles E. Beller, Christopher F. Ackermann, Kristen Maria Summers, David McQuenney, Rob High
  • Publication number: 20210073334
    Abstract: Embodiments relate to an intelligent computer platform to selectively amend one or more document elements. A first document is subjected to natural language processing (NLP) and two or more document characteristics are subjected to an assessment to produce a characteristic value. The document characteristics and corresponding characteristic values are analyzed to produce a characteristic profile for each identified document characteristic. Upon receipt of a new document, document characteristic data and corresponding characteristic value(s) are identified. The corresponding characteristic value(s) of the new document is applied against the produced characteristic profile. New document characteristic data is selectively amended responsive to the comparison, and a new document version is created from the selective amendment.
    Type: Application
    Filed: September 9, 2019
    Publication date: March 11, 2021
    Applicant: International Business Machines Corporation
    Inventors: Charles E. Beller, Christopher F. Ackermann, Kristen Maria Summers, David McQuenney, Rob High
  • Patent number: 10936819
    Abstract: A query system identifies a collection of discovered entity bins each comprising unstructured documents with mentions of a name element from a name query and each identified with a particular named entity identifiable from the name element. The query system identifies, from a knowledge base of structured documents, based on identifier components with the name element, candidate records identifying the respective identifier components with the name element, the one or more identifier components identified among the discovery entity bins. For each respective selection of candidate records associated with each bin, the query system applies one or more alignment threshold rules to rank the likelihood that each candidate record within each respective selection matches one or more characteristics of the respective discovery entity bin.
    Type: Grant
    Filed: February 19, 2019
    Date of Patent: March 2, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Charles E. Beller, Christopher F. Ackermann, Michael Drzewucki, Andrew Doyle, Edward G. Katz, Kristen M. Summers
  • Patent number: 10803100
    Abstract: A computer-implemented method, a computer program product, and a computer processing system are provided. The method includes identifying, by a processor using a topic identification system, topic information for a source topic-domain in a corpus. The method further includes extracting, by the processor, an entity from the source topic-domain. The method also includes tagging, by the processor, the entity with the topic information to obtain a tagged entity that includes a tag specifying the topic information. The method additionally includes storing the tagged entity in a memory device. The method further includes performing, by the processor, downstream processing of the tagged entity in a natural language processing pipeline using the tag of the tagged entity as an additional data point.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: October 13, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Christopher F. Ackermann, William G. Dubyak, Edward Graham Katz, Nicole O'Connor
  • Publication number: 20200265114
    Abstract: A query system identifies a collection of discovered entity bins each comprising unstructured documents with mentions of a name element from a name query and each identified with a particular named entity identifiable from the name element. The query system identifies, from a knowledge base of structured documents, based on identifier components with the name element, candidate records identifying the respective identifier components with the name element, the one or more identifier components identified among the discovery entity bins. For each respective selection of candidate records associated with each bin, the query system applies one or more alignment threshold rules to rank the likelihood that each candidate record within each respective selection matches one or more characteristics of the respective discovery entity bin.
    Type: Application
    Filed: February 19, 2019
    Publication date: August 20, 2020
    Inventors: CHARLES E. BELLER, CHRISTOPHER F. ACKERMANN, MICHAEL DRZEWUCKI, ANDREW DOYLE, EDWARD G. KATZ, KRISTEN M. SUMMERS
  • Publication number: 20200265042
    Abstract: A method includes searching an initial set of documents for an initial set of query names. Each query name of the initial set of query names is associated with at least one document of the initial set of documents. The method also includes prioritizing the initial set of query names based on at least one topic label. The method also includes searching an additional set of documents to generate candidate query names. The method also includes prioritizing the candidate query names based on the at least one topic label. The method further includes applying a temporal search filter to each candidate query name to determine whether the candidate query name was processed within a time frame. The method further includes performing disambiguation processing on each candidate query name not processed within the time frame.
    Type: Application
    Filed: February 19, 2019
    Publication date: August 20, 2020
    Inventors: Charles E. Beller, Kristen Maria Summers, Christopher F. Ackermann, Michael Drzewucki, Andrew Doyle
  • Publication number: 20200265054
    Abstract: Query service receives a query comprising at least a name component. The query service searches a document corpus to identify multiple passages, each comprising a mention of the name component within a selection of one or more documents of the document corpus. The query service collects bins, each bin comprising a distinct selection of the passages from the one or more documents, each of the bins identifying a separate relationship the name component participates in within the distinct selection of passages. The query service assesses a separate score of each respective bin reflecting the relevance of each respective bin to the query. The query service returns a response to the query with the bins each ranked according to each separate score.
    Type: Application
    Filed: February 19, 2019
    Publication date: August 20, 2020
    Inventors: KRISTIN M. SUMMERS, CHRISTOPHER F. ACKERMANN, ANDREW DOYLE, MICHAEL DRZEWUCKI, CHARLES E. BELLER
  • Publication number: 20200142720
    Abstract: A method, system and computer program product are provided for implementing an interface for rapid ground truth binning. A set of documents are received wherein each document has at least one entity in a set of entities. A user interface is provided for each received document allowing a user to view passages and select options related to confirming or denying an equivalence between the entity in the received document and an output document entity bin including the entity. Responsive to the user utilizing the user interface and confirming the equivalence, combining the received document with the output document entity bin with reference to the entity.
    Type: Application
    Filed: November 6, 2018
    Publication date: May 7, 2020
    Inventors: Christopher F. Ackermann, Charles E. Beller, Michael Drzewucki
  • Patent number: 10572597
    Abstract: According to one embodiment, a method, computer system, and computer program product for acronym resolution is provided. The present invention may include receiving documents; identifying explicit expansions within the documents; receiving an input from a user; retrieving passages relevant to the received input from the documents; for each acronym within the one or more relevant passages, determining whether the acronym corresponds with explicit expansions within the relevant passages; for each of the acronyms that do not correspond with explicit expansions, determining whether the acronym corresponds with implicit expansions within the relevant passages; and for each of the acronyms that do not correspond with implicit expansions, determining whether the acronym corresponds with acronyms within a universal acronym list, and transmitting the one or more resolved acronyms to a question answering system.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: February 25, 2020
    Assignee: International Business Machines Corporation
    Inventors: Christopher F. Ackermann, Charles E. Beller, Stephen A. Boxwell, Edward G. Katz, Kristen M. Summers
  • Publication number: 20190340297
    Abstract: Approaches presented herein enable presenting, as an initial response to a search query from a user, a set of analytic summaries prior to initiating a document security protocol in a secured document environment. Each analytic summary represents a set or cluster of documents. A summary relevance value is calculated for each analytic summary and a document relevance value is calculated for each individual document. Analytic summaries are presented to the user while each document within each analytic summary are prioritized for a security review based on its related summary relevance value and document relevance value. Based on the priorities, a security review is initiated for the documents so that a highly relevant document within an analytic summary undergoes the security review before a less relevant document. Access to a particular document is granted to the user according to the security review of the document.
    Type: Application
    Filed: May 4, 2018
    Publication date: November 7, 2019
    Inventors: Christopher F. Ackermann, Michael Drzewucki, Charles E. Beller
  • Publication number: 20190163811
    Abstract: A computer-implemented method, a computer program product, and a computer processing system are provided. The method includes identifying, by a processor using a topic identification system, topic information for a source topic-domain in a corpus. The method further includes extracting, by the processor, an entity from the source topic-domain. The method also includes tagging, by the processor, the entity with the topic information to obtain a tagged entity that includes a tag specifying the topic information. The method additionally includes storing the tagged entity in a memory device. The method further includes performing, by the processor, downstream processing of the tagged entity in a natural language processing pipeline using the tag of the tagged entity as an additional data point.
    Type: Application
    Filed: November 30, 2017
    Publication date: May 30, 2019
    Inventors: Christopher F. Ackermann, William G. Dubyak, Edward Graham Katz, Nicole O'Connor
  • Publication number: 20190163781
    Abstract: A system and a method for determining user synonyms in a query processing system is disclosed. A first query is received from a user of the query processing system. The query is processed through the query processing system to generate results for the first query. The user then provides a second query. The system determines a contextual similarity between the first query and the second query. When the first query and the second query are determined to be contextually similar, a first term is identified in the first query that is different from a second term in the second query. Once identified, the system determines if the first term and the second term are not listed as synonyms in the thesaurus. If they are not listed as synonyms they can be added as synonyms to the thesaurus.
    Type: Application
    Filed: November 30, 2017
    Publication date: May 30, 2019
    Inventors: Christopher F. Ackermann, Charles E. Beller, Stephen A. Boxwell, Edward G. Katz, Kristen M. Summers
  • Publication number: 20190163740
    Abstract: According to one embodiment, a method, computer system, and computer program product for acronym resolution is provided. The present invention may include receiving documents; identifying explicit expansions within the documents; receiving an input from a user; retrieving passages relevant to the received input from the documents; for each acronym within the one or more relevant passages, determining whether the acronym corresponds with explicit expansions within the relevant passages; for each of the acronyms that do not correspond with explicit expansions, determining whether the acronym corresponds with implicit expansions within the relevant passages; and for each of the acronyms that do not correspond with implicit expansions, determining whether the acronym corresponds with acronyms within a universal acronym list, and transmitting the one or more resolved acronyms to a question answering system.
    Type: Application
    Filed: November 30, 2017
    Publication date: May 30, 2019
    Inventors: CHRISTOPHER F. ACKERMANN, Charles E. Beller, STEPHEN A. BOXWELL, EDWARD G. KATZ, KRISTEN M. SUMMERS
  • Publication number: 20190163789
    Abstract: The present invention may receive the question, a plurality of the candidate answers, and a plurality of documents associated with the plurality of candidate answers in the natural language. Then the present invention may tokenize the question, the plurality of the candidate answers, and the plurality of the documents into a corresponding n-gram sequence. The present invention may map n-gram elements from the tokenized question to the n-gram elements of the plurality of the tokenized candidate answers and the plurality of the tokenized documents using the latent token representation technique. The present invention may score the plurality of tokenized candidate answers based on the latent token representation technique. Then, the present invention may determine the precise answer based on the plurality of scored candidate answers.
    Type: Application
    Filed: November 29, 2017
    Publication date: May 30, 2019
    Inventors: CHRISTOPHER F. ACKERMANN, Charles E. BELLER, STEPHEN A. BOXWELL, EDWARD G. KATZ, Kristen M. Summers
  • Patent number: 10303766
    Abstract: Embodiments can provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a mixed-language question answering supplement system, the method comprising receiving a question in a target language; applying natural language processing to parse the question into at least one focus; for each focus, determining if one or more target language verbs share direct syntactic dependency with the focus; for each of the one or more verbs sharing direct syntactic dependency, determining if one or more target language entities share direct syntactic dependency with the verb; determining one or more Abstract Universal Verbal Types associated with each verb; for each of the one or more Abstract Universal Verbal Types, determining whether a dependency between a source language entity and a source language verb is of the same type as the dependency between the target language verb and the ta
    Type: Grant
    Filed: June 8, 2018
    Date of Patent: May 28, 2019
    Assignee: International Business Machines Corporation
    Inventors: Christopher F. Ackermann, Charles E. Beller, Stephen A. Boxwell, Stanley J. Vernier
  • Patent number: 10303767
    Abstract: Embodiments can provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a mixed-language question answering supplement system, the method comprising receiving a question in a target language; determining the question cannot be answered using a target-language only corpus; applying natural language processing to parse the question into at least one focus; for each focus, determining if one or more target language verbs share direct syntactic dependency with the focus; for each of the one or more verbs sharing direct syntactic dependency, determining if one or more target language entities share direct syntactic dependency with the verb; determining one or more Abstract Universal Verbal Types associated with each verb; for each of the one or more Abstract Universal Verbal Types, determining whether a dependency between a source language entity and a source language verb
    Type: Grant
    Filed: June 8, 2018
    Date of Patent: May 28, 2019
    Assignee: International Business Machines Corporation
    Inventors: Christopher F. Ackermann, Charles E. Beller, Stephen A. Boxwell, Stanley J. Vernier
  • Publication number: 20180293222
    Abstract: Embodiments can provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a mixed-language question answering supplement system, the method comprising receiving a question in a target language; applying natural language processing to parse the question into at least one focus; for each focus, determining if one or more target language verbs share direct syntactic dependency with the focus; for each of the one or more verbs sharing direct syntactic dependency, determining if one or more target language entities share direct syntactic dependency with the verb; determining one or more Abstract Universal Verbal Types associated with each verb; for each of the one or more Abstract Universal Verbal Types, determining whether a dependency between a source language entity and a source language verb is of the same type as the dependency between the target language verb and the ta
    Type: Application
    Filed: June 8, 2018
    Publication date: October 11, 2018
    Inventors: Christopher F. Ackermann, Charles E. Beller, Stephen A. Boxwell, Stanley J. Vernier