Patents by Inventor David Konopnicki

David Konopnicki 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: 20210042383
    Abstract: A system for generating a summary of a text document is disclosed. In some examples, the system includes a processor configured to generate an initial summary of an original document. The initial summary includes a selection of extracted sentences copied from the original document. For each extracted sentence of the initial summary, the processor processes the extracted sentence to generate an abstracted sentence, and generates vector representations of the extracted sentence, the abstracted sentence, the original document, and the current summary. The vector representations are then input to a decision network to compute an editing decision. The editing decision is selected from a group of possible decisions that includes a decision to add the extracted sentence and a decision to add the abstracted sentence. The processor also updates the current summary based on the editing decision.
    Type: Application
    Filed: August 5, 2019
    Publication date: February 11, 2021
    Inventors: Guy Feigenblat, David Konopnicki, Edward Moroshko, Haggai Roitman
  • Patent number: 10902191
    Abstract: A system for generating a summary of a text document is disclosed. In some examples, the system includes a processor configured to generate an initial summary of an original document. The initial summary includes a selection of extracted sentences copied from the original document. For each extracted sentence of the initial summary, the processor processes the extracted sentence to generate an abstracted sentence, and generates vector representations of the extracted sentence, the abstracted sentence, the original document, and the current summary. The vector representations are then input to a decision network to compute an editing decision. The editing decision is selected from a group of possible decisions that includes a decision to add the extracted sentence and a decision to add the abstracted sentence. The processor also updates the current summary based on the editing decision.
    Type: Grant
    Filed: August 5, 2019
    Date of Patent: January 26, 2021
    Assignee: International Business Machines Corporation
    Inventors: Guy Feigenblat, David Konopnicki, Edward Moroshko, Haggai Roitman
  • Publication number: 20210011937
    Abstract: A method comprising receiving digital documents, a query statement, and a summary length constraint; identifying, for each of said digital documents, a sentence subset, based, at least in part, on said query statement, a modified version of said summary length constraint, and a first set of quality objectives, generating, for each of said sentence subsets, a random forest representation; iteratively (i) sampling, from each of said random forest representations, a plurality of tokens to create a corresponding candidate document summary, based, at least in part, on weights assigned to each of said tokens, (ii) assigning a quality ranking to said candidate document summary, based, at least in part, on said first set of quality objectives and a second set of quality objectives, and (iii) adjusting said weights, based, at least in part, on said quality rankings; and outputting a highest ranking said candidate document as a compressed summary.
    Type: Application
    Filed: July 9, 2019
    Publication date: January 14, 2021
    Inventors: ODELLIA BONI, DORON COHEN, GUY FEIGENBLAT, DAVID KONOPNICKI, HAGGAI ROITMAN
  • Patent number: 10831806
    Abstract: A system comprising at least one hardware processor; and a non-transitory computer-readable storage medium having stored thereon program instructions executable to receive, as input, one or more digital documents, a query statement, and a summary length constraint, automatically generate, for each of said one or more digital documents, an initial summary based, at least in part, on a first sentence selection which satisfies said query statement, a modified said summary length constraint, and a first summary quality goal, automatically extract, from each of said initial summaries, one or more associated feedback metrics, and automatically generate, for each of said one or more digital documents, a final summary based, at least in part, on: (i) a second sentence selection which satisfies said query statement, said summary length constraint, and a second summary quality goal, and (ii) at least one of said associated feedback metrics.
    Type: Grant
    Filed: October 29, 2018
    Date of Patent: November 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Guy Feigenblat, David Konopnicki, Haggai Roitman
  • Publication number: 20200335124
    Abstract: Embodiments of the present systems and methods may provide techniques by which bots may be analyzed using improved representations of bot structure and a means of assessing conversational quality that may provide improved efficiency. For example a method may comprise training, at a computer system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor, a neural network model to learn representations that capture characteristics of the graphs of chatbots, wherein the captured characteristics include at least a content-based representation based on user utterances that are relevant to the nodes and based on the chatbot response for the nodes.
    Type: Application
    Filed: April 16, 2019
    Publication date: October 22, 2020
    Inventors: Jonathan Herzig, David Konopnicki, Tommy Sandbank, Michal Shmueli-Scheuer
  • Patent number: 10777191
    Abstract: For each intent associated with a feature in a discordant conversation, one or more preceding discordant user utterances and one or more following discordant user utterances are collected. A discordant distribution over terms of the one or more preceding discordant user utterances and the one or more following discordant user utterances is created. For each intent associated with a feature in a non-discordant conversation, one or more preceding non-discordant user utterances and one or more following non-discordant user utterances are collected. A non-discordant distribution over terms of the one or more preceding non-discordant user utterances and the one or more following non-discordant user utterances is created. The discordant and non-discordant distributions are compared and the top-k terms that are most specific to user utterances associated with the corresponding discordance feature using Kullback-Leibler divergence are determined.
    Type: Grant
    Filed: December 30, 2018
    Date of Patent: September 15, 2020
    Assignee: International Business Machines Corporation
    Inventors: Michal Shmueli-Scheuer, Ora Peled Nakash, Tommy Sandbank, David Konopnicki, Mordechai Taitelman, Hen Shkedi
  • Patent number: 10733384
    Abstract: Utilizing a computing device to detect and respond to emotion in dialog systems. The computing device receives a dialog structure comprising a plurality of dialog nodes. The computing device determines a node emotion level for each of the dialog nodes in the dialog structure based on analysis of one or more intents of each of the dialog nodes in the dialog structure. The computing device determines emotional hotspot nodes in the dialog structure, the node emotion level for each of the emotional hotspot nodes exceeding an emotional threshold. The computing device generates one or more responses modifying the node emotion level of each of the emotional hotspot nodes.
    Type: Grant
    Filed: June 7, 2019
    Date of Patent: August 4, 2020
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Herzig, David Konopnicki, Tommy Sandbank, Michal Shmueli-Scheuer
  • Publication number: 20200211536
    Abstract: For each intent associated with a feature in a discordant conversation, one or more preceding discordant user utterances and one or more following discordant user utterances are collected. A discordant distribution over terms of the one or more preceding discordant user utterances and the one or more following discordant user utterances is created. For each intent associated with a feature in a non-discordant conversation, one or more preceding non-discordant user utterances and one or more following non-discordant user utterances are collected. A non-discordant distribution over terms of the one or more preceding non-discordant user utterances and the one or more following non-discordant user utterances is created. The discordant and non-discordant distributions are compared and the top-k terms that are most specific to user utterances associated with the corresponding discordance feature using Kullback-Leibler divergence are determined.
    Type: Application
    Filed: December 30, 2018
    Publication date: July 2, 2020
    Inventors: MICHAL SHMUELI-SCHEUER, ORA PELED NAKASH, TOMMY SANDBANK, DAVID KONOPNICKI, MORDECHAI TAITELMAN, HEN SHKEDI
  • Publication number: 20200134020
    Abstract: Method and apparatus for training and using a classifier for words. Embodiments include receiving a first plurality of sentences comprising a first word that is associated with a class and a second plurality of sentences comprising a second word that is not associated with the class. Embodiments include training a classifier using positive training data for the class that is based on the first plurality of sentences and negative training data for the class that is based on the second plurality of sentences. Embodiments include determining a measure of correlation between a third word and the class by using a sentence comprising the third word as an input to the classifier. Embodiments include using the measure of correlation to perform an action selected from the following list: selecting content to provide to a user; determining an automatic chat response; or filtering a set of content.
    Type: Application
    Filed: October 30, 2018
    Publication date: April 30, 2020
    Inventors: Ella Rabinovich, Benjamin Sznajder, Artem Spector, Shnayderman Ilya, RANIT AHARONOV, DAVID KONOPNICKI, Noam Slonim
  • Publication number: 20200134091
    Abstract: A system comprising at least one hardware processor; and a non-transitory computer-readable storage medium having stored thereon program instructions executable to receive, as input, one or more digital documents, a query statement, and a summary length constraint, automatically generate, for each of said one or more digital documents, an initial summary based, at least in part, on a first sentence selection which satisfies said query statement, a modified said summary length constraint, and a first summary quality goal, automatically extract, from each of said initial summaries, one or more associated feedback metrics, and automatically generate, for each of said one or more digital documents, a final summary based, at least in part, on: (i) a second sentence selection which satisfies said query statement, said summary length constraint, and a second summary quality goal, and (ii) at least one of said associated feedback metrics.
    Type: Application
    Filed: October 29, 2018
    Publication date: April 30, 2020
    Inventors: GUY Feigenblat, David Konopnicki, Haggai Roitman
  • Publication number: 20200065346
    Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.
    Type: Application
    Filed: October 31, 2019
    Publication date: February 27, 2020
    Inventors: Odellia Boni, Guy Feigenblat, David Konopnicki, Haggai Roitman
  • Publication number: 20190286705
    Abstract: Utilizing a computing device to detect and respond to emotion in dialog systems. The computing device receives a dialog structure comprising a plurality of dialog nodes. The computing device determines a node emotion level for each of the dialog nodes in the dialog structure based on analysis of one or more intents of each of the dialog nodes in the dialog structure. The computing device determines emotional hotspot nodes in the dialog structure, the node emotion level for each of the emotional hotspot nodes exceeding an emotional threshold. The computing device generates one or more responses modifying the node emotion level of each of the emotional hotspot nodes.
    Type: Application
    Filed: June 7, 2019
    Publication date: September 19, 2019
    Inventors: Jonathan Herzig, David Konopnicki, Tommy Sandbank, Michal Shmueli-Scheuer
  • Patent number: 10372825
    Abstract: Utilizing a computing device to detect and respond to emotion in dialog systems. The computing device receives a dialog structure comprising a plurality of dialog nodes. The computing device determines a node emotion level for each of the dialog nodes in the dialog structure based on analysis of one or more intents of each of the dialog nodes in the dialog structure. The computing device determines emotional hotspot nodes in the dialog structure, the node emotion level for each of the emotional hotspot nodes exceeding an emotional threshold. The computing device generates one or more responses modifying the node emotion level of each of the emotional hotspot nodes.
    Type: Grant
    Filed: December 18, 2017
    Date of Patent: August 6, 2019
    Assignee: International Business Machines Corporation
    Inventors: Jonathan Herzig, David Konopnicki, Tommy Sandbank, Michal Shmueli-Scheuer
  • Publication number: 20190188261
    Abstract: Utilizing a computing device to detect and respond to emotion in dialog systems. The computing device receives a dialog structure comprising a plurality of dialog nodes. The computing device determines a node emotion level for each of the dialog nodes in the dialog structure based on analysis of one or more intents of each of the dialog nodes in the dialog structure. The computing device determines emotional hotspot nodes in the dialog structure, the node emotion level for each of the emotional hotspot nodes exceeding an emotional threshold. The computing device generates one or more responses modifying the node emotion level of each of the emotional hotspot nodes.
    Type: Application
    Filed: December 18, 2017
    Publication date: June 20, 2019
    Inventors: Jonathan Herzig, David Konopnicki, Tommy Sandbank, Michal Shmueli-Scheuer
  • Publication number: 20190146954
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a novel and non-obvious method, system and computer program product for seed lists for hierarchically structured content sources. In one embodiment, a method for crawling seed lists for hierarchically structured content sources can be provided. The method can include specifying a depth of crawling for hierarchically structured content, crawling only seed lists at the specified depth among other seed lists in a hierarchy of seed lists mimicking the hierarchically structured content, and returning indexed data for the crawled seed lists. Optionally, an administrator user interface can be provided for specifying the depth of crawling for the hierarchically structured content.
    Type: Application
    Filed: January 8, 2019
    Publication date: May 16, 2019
    Inventors: David Konopnicki, Laurent D. Hasson
  • Publication number: 20190034537
    Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.
    Type: Application
    Filed: June 12, 2018
    Publication date: January 31, 2019
    Inventors: Odellia Boni, Guy Feigenblat, David Konopnicki, Haggai Roitman
  • Publication number: 20190034538
    Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.
    Type: Application
    Filed: June 12, 2018
    Publication date: January 31, 2019
    Inventors: Odellia Boni, Guy Feigenblat, David Konopnicki, Haggai Roitman
  • Patent number: 10176258
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a novel and non-obvious method, system and computer program product for seed lists for hierarchically structured content sources. In one embodiment, a method for crawling seed lists for hierarchically structured content sources can be provided. The method can include specifying a depth of crawling for hierarchically structured content, crawling only seed lists at the specified depth among other seed lists in a hierarchy of seed lists mimicking the hierarchically structured content, and returning indexed data for the crawled seed lists. Optionally, an administrator user interface can be provided for specifying the depth of crawling for the hierarchically structured content.
    Type: Grant
    Filed: June 28, 2007
    Date of Patent: January 8, 2019
    Assignee: International Business Machines Corporation
    Inventors: David Konopnicki, Laurent D. Hasson
  • Publication number: 20180374000
    Abstract: A method, computer system, and a computer program product for optimizing a plurality of personality traits of a virtual agent based on a predicted customer satisfaction value is provided. The present invention may include identifying a customer. The present invention may also include retrieving a plurality of data associated with the customer. The present invention may then include analyzing the received plurality of data using a customer satisfaction prediction model. The present invention may further include generating a plurality of analyzed data from the customer satisfaction prediction model based on the analyzed plurality of data. The present invention may also include generating a plurality of personality traits for a virtual agent from the generated plurality of analyzed data.
    Type: Application
    Filed: June 27, 2017
    Publication date: December 27, 2018
    Inventors: Jonathan Herzig, David Konopnicki, Michal Shmueli-Scheuer
  • Patent number: 10127323
    Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.
    Type: Grant
    Filed: July 26, 2017
    Date of Patent: November 13, 2018
    Assignee: International Business Machines Corporation
    Inventors: Odellia Boni, Guy Feigenblat, David Konopnicki, Haggai Roitman