-
公开(公告)号：US20230122429A1
公开(公告)日：2023-04-20
申请号：US17503313
申请日：2021-10-17
摘要： Summarization of customer service dialogs by: receiving, as input, a two-party multi-turn dialog; applying a trained next response prediction (NRP) machine learning model to the received dialog, to determine a level of significance of each utterance in the dialog with respect to performing an NRP task over the dialog; assigning a score to each of the utterances in the dialog, based, at least in part, on the determined level of significance; and selecting one or more of the utterances for inclusion in an extractive summarization of the dialog, based, at least in part, on the assigned scores.
-
公开(公告)号：US20210390418A1
公开(公告)日：2021-12-16
申请号：US16897538
申请日：2020-06-10
发明人： Yosi Mass , Boaz Carmeli , Haggai Roitman , David Konopnicki
IPC分类号： G06N3/08 , G06F16/2457 , G06N3/04
摘要： An example system includes a processor to receive a query. The processor can retrieve ranked candidates from an index based on the query. The processor can re-rank the ranked candidates using a Bidirectional Encoder Representations from Transformers (BERT) query-question (Q-q) model trained to match queries to questions of a frequently asked question (FAQ) dataset, wherein the BERT Q-q model is fine-tuned using paraphrases generated for the questions in the FAQ dataset. The processor can return the re-ranked candidates in response to the query.
-
公开(公告)号：US20200065346A1
公开(公告)日：2020-02-27
申请号：US16670631
申请日：2019-10-31
发明人： Odellia Boni , Guy Feigenblat , David Konopnicki , Haggai Roitman
IPC分类号： G06F16/9535 , G06F16/93 , G06F16/34 , G06F16/33 , G06F16/9038 , G06F16/9032
摘要： 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.
-
公开(公告)号：US10372825B2
公开(公告)日：2019-08-06
申请号：US15844877
申请日：2017-12-18
摘要： 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.
-
公开(公告)号：US20170032018A1
公开(公告)日：2017-02-02
申请号：US14583791
申请日：2014-12-29
发明人： Gadi Aleksandrowicz , Doron Cohen , David Konopnicki , Oded Margalit , Haggai Roitman , Dafna Sheinwald , Michal Shmueli-Scheuer
IPC分类号： G06F17/30
CPC分类号： G06F17/30598 , G06F17/30327 , G06F17/3053
摘要： A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.
摘要翻译： 一种方法包括在包括通过边缘连接的图形节点的图形的图表中，将相应的节点权重与每个图形节点相关联，并且将图形节点组织成祖先节点，每个祖先节点具有一个或多个后代节点，使得 祖先和后代节点包括所有图形节点。 对于给定的后代节点，识别到祖先节点中的一个或多个的相应路径，确定每个相应路径包括一个或多个边缘，并且确定具有所识别的路径的最短的给定祖先节点。 相应的边缘权重被分配给最短路径中的一个或多个边缘中的每个边缘，并且对于给定的后代节点，基于节点权重和每个边缘权重的相应边缘权重来计算节点丢失值， 更多的边缘
-
公开(公告)号：US11269965B2
公开(公告)日：2022-03-08
申请号：US16670631
申请日：2019-10-31
发明人： Odellia Boni , Guy Feigenblat , David Konopnicki , Haggai Roitman
IPC分类号： G06F16/9535 , G06F16/93 , G06F16/34 , G06F16/33 , G06F16/9038 , G06F16/9032
摘要： 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.
-
公开(公告)号：US11188809B2
公开(公告)日：2021-11-30
申请号：US15634496
申请日：2017-06-27
摘要： 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.
-
公开(公告)号：US11182681B2
公开(公告)日：2021-11-23
申请号：US15459134
申请日：2017-03-15
IPC分类号： G06N5/02 , G06F16/338 , G06F16/332 , G06F40/295
摘要： A computerized method comprising receiving, from a question answering system, a minimal answer value to a query submitted by a user. Also received are electronic documents based on the minimal answer value, and a document score value, associated with the query, for each of the electronic documents. The method comprises extracting entities and attributes from electronic documents, and for each computing one or more associated score value, and aggregating the document score value with the associated score values. The method comprises selecting some of entities and attributes based on the respective aggregated score value, thereby producing selected associated elements. The method comprises generating, using a computerized natural language (NL) generating system, a comprehensive NL answer, wherein the generating is based on the minimal answer value and the selected associated elements, and sending the comprehensive NL answer for presentation to the user.
-
公开(公告)号：US20210326346A1
公开(公告)日：2021-10-21
申请号：US16854102
申请日：2020-04-21
发明人： Or Rivlin , Yosi Mass , Haggai Roitman , David Konopnicki
IPC分类号： G06F16/2457 , G06F16/901 , G06N3/08
摘要： An example system includes a processor to receive concepts extracted from a result set corresponding to a query and result associations for each extracted concept. The processor is to build a graph based on the extracted concepts, wherein the graph comprises a number of nodes representing the extracted concepts and weighted edges representing similarity between concepts extracted from shared results. The processor is to partition the graph into subgraphs with vertices corresponding to candidate facets for vertices having higher sums of weighted edges. The processor is to rank the candidate facets. The processor is to select higher ranked candidate facets to use as facets. The processor is to output facets with a result set in response to the query.
-
公开(公告)号：US11100287B2
公开(公告)日：2021-08-24
申请号：US16174819
申请日：2018-10-30
发明人： Ella Rabinovich , Benjamin Sznajder , Artem Spector , Ilya Shnayderman , Ranit Aharonov , David Konopnicki , Noam Slonim
IPC分类号： G06F40/30 , G06N20/00 , G06F16/35 , G06F16/335
摘要： 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.
-
-
-
-
-
-
-
-
-
搜索结果
40 条记录 (耗时 0.022 秒)
