-
公开(公告)号:US11573994B2
公开(公告)日:2023-02-07
申请号:US16848144
申请日:2020-04-14
发明人: Michael Robert Glass , Nicholas Brady Garvan Monath , Robert G. Farrell , Alfio Massimiliano Gliozzo , Gaetano Rossiello
IPC分类号: G06F16/30 , G06F16/35 , G06N3/08 , G06F40/40 , G06F40/284 , G06F40/30 , G06F40/216
摘要: A computer-implemented method for performing cross-document coreference for a corpus of input documents includes determining mentions by parsing the input documents. Each mention includes a first vector for spelling data and a second vector for context data. A hierarchical tree data structure is created by generating several leaf nodes corresponding to respective mentions. Further, for each node, a similarity score is computed based on the first and second vectors of each node. The hierarchical tree is populated iteratively until a root node is created. Each iteration includes merging two nodes that have the highest similarity scores and creating an entity node instead at a hierarchical level that is above the two nodes being merged. Further, each iteration includes computing the similarity score for the entity node. The nodes with the similarity scores above a predetermined value are entities for which coreference has been performed in input documents.
-
公开(公告)号:US11507828B2
公开(公告)日:2022-11-22
申请号:US16666800
申请日:2019-10-29
发明人: Md Faisal Mahbub Chowdhury , Robert G. Farrell , Nicholas Brady Garvan Monath , Michael Robert Glass , Md Arafat Sultan
IPC分类号: G06F40/205 , G06N3/08 , G06K9/62 , G06N5/04
摘要: Training a machine learning model such as a neural network, which can automatically extract a hypernym from unstructured data, is disclosed. A preliminary candidate list of hyponym-hypernym pairs can be parsed from the corpus. A preliminary super-term—sub-term glossary can be generated from the corpus, the preliminary super-term—sub-term glossary containing one or more super-term—sub-term pairs. A super-term—sub-term pair can be filtered from the preliminary super-term—sub-term glossary, responsive to detecting that the super-term—sub-term pair is not a candidate for hyponym-hypernym pair, to generate a final super-term—sub-term glossary. The preliminary candidate list of hyponym-hypernym pairs and the final super-term—sub-term glossary can be combined to generate a final list of hyponym-hypernym pairs. An artificial neural network can be trained using the final list of hyponym-hypernym pairs as a training data set, the artificial neural network trained to identify a hypernym given new text data.
-
公开(公告)号:US11461682B2
公开(公告)日:2022-10-04
申请号:US16570263
申请日:2019-09-13
发明人: Mustafa Canim , Robert G. Farrell
IPC分类号: G06N5/04
摘要: A policy violation detection computer-implemented method, system, and computer program product, includes extracting a policy activity from a policy, the policy activity including an actor in the policy, an object of the policy, an action of the policy, and policy scope metadata, capturing a transaction by a user including metadata of the transaction, translating the transaction by the user into an actor in the transaction, an action of the transaction, and an object of the transaction, and alerting the user of a policy violation by navigating a knowledge graph is-a hierarchy to relate the actor in the transaction to the actor in the policy, the object of the transaction to an object of the policy, and the action of the transaction to an action of the policy activity.
-
公开(公告)号:US20220179896A1
公开(公告)日:2022-06-09
申请号:US17115834
申请日:2020-12-09
IPC分类号: G06F16/35 , G06F40/30 , G06F40/131
摘要: Organizing and/or aligning fragments of text that are included in a set of physical and/or digital documents so that the arrangement of the text fragments is in a readily understandable and meaningful format for a given reader. This organization and/or alignment uses a relation model of the various text fragments to correlate a meaning between and amongst the various text fragments to ultimately determine the final alignment and/or arrangement of those text fragments.
-
公开(公告)号:US11316980B2
公开(公告)日:2022-04-26
申请号:US16695401
申请日:2019-11-26
发明人: John Thomas Richards , Rachel Katherine Emma Bellamy , Robert G. Farrell , Qingzi Liao , David John Piorkowski
摘要: A method, a computer program product, and a computer system determine when to transfer a communication session from an agent to a bot. The method includes monitoring the communication session between the agent and a user. The method includes determining a continuing utility value indicating a predicted continuing cost to maintaining the communication session with the agent. The continuing utility value is indicative of a predicted continuing benefit to maintaining the communication with the agent. The method includes determining a transferring utility value indicating a predicted transferring cost to transferring the communication session from the agent to the bot. The transferring utility value is indicative of a predicted transferring benefit to transferring the communication session from the agent to the bot. The method includes, as a result of the predicted transferring benefit being greater than the predicted continuing benefit, transferring the communication session from the agent to the bot.
-
公开(公告)号:US20210109995A1
公开(公告)日:2021-04-15
申请号:US16600774
申请日:2019-10-14
发明人: Nandana Mihindukulasooriya , Robert G. Farrell , Nicolas Rodolfo Fauceglia , Alfio Massimiliano Gliozzo
IPC分类号: G06F17/27 , G06F16/335 , G06F16/901
摘要: Systems and techniques that facilitate spurious relationship filtration from external knowledge graphs based on distributional semantics of an input corpus are provided. In one or more embodiments, a context component can generate a context-based word embedding of one or more first terms in a document collection. The embedding can yield vector representations of the one or more first terms. The one or more first terms can correspond to knowledge terms in one or more first nodes of a knowledge graph. In one or more embodiments, a filtering component can filter out a relationship between the one or more first nodes and a second node of the knowledge graph based on a similarity value being less than a threshold. The similarity value can be a function of the vector representations of the one or more first terms. In various embodiments, cosine similarity can be used to compute the similarity value.
-
公开(公告)号:US10891956B2
公开(公告)日:2021-01-12
申请号:US16507227
申请日:2019-07-10
IPC分类号: G06F40/30 , G10L15/22 , G06N5/02 , G06F16/21 , G06F16/28 , G06F16/335 , G06F16/9032 , G10L15/26
摘要: Mechanisms are provided for customizing responses to future questions based on identified anomalies in user profile information. An automated dialogue system monitors information associated with a plurality of entities, where the information includes quantities for variable values associated with the entities. The automated dialogue system, in response to determining that a quantity of a variable value associated with an entity in the plurality of entities has changed by an amount equal to or exceeding a corresponding threshold value, generates response information associated with a quantity of the variable value and an entity to respond to at least one future question. In addition, the automated dialogue system stores the responsive information in association with the entity for later retrieval in response to initiation of a dialogue session with the automated dialogue system. Time thresholds may be established for determining when to stop using the responsive information for responding to questions.
-
公开(公告)号:US10528880B2
公开(公告)日:2020-01-07
申请号:US15290658
申请日:2016-10-11
发明人: Mustafa Canim , Robert G. Farrell
IPC分类号: G06N5/04
摘要: A policy violation detection computer-implemented method, system, and computer program product, includes extracting a policy activity from a policy, the policy activity including an actor in the policy, an object of the policy, an action of the policy, and policy scope metadata, capturing a transaction by a user including metadata of the transaction, translating the transaction by the user into an actor in the transaction, an action of the transaction, and an object of the transaction, and alerting the user of a policy violation by navigating a knowledge graph is-a hierarchy to relate the actor in the transaction to the actor in the policy, the object of the transaction to an object of the policy, and the action of the transaction to an action of the policy activity.
-
9.
公开(公告)号:US10394963B2
公开(公告)日:2019-08-27
申请号:US14965368
申请日:2015-12-10
摘要: Embodiments are directed to a natural language processing (NLP) system configured to receive a natural language (NL) input and perform an analysis operation to generate a NL output. The NLP system is configured to generate at least one confidence level based at least in part on at least one portion of the analysis operation. The NLP system is further configured to integrate at least one disfluency into the NL output based at least in part on the at least one confidence level.
-
公开(公告)号:US20190087409A1
公开(公告)日:2019-03-21
申请号:US15706580
申请日:2017-09-15
发明人: Robert G. Farrell
CPC分类号: G06F17/2785 , G06F16/3323 , G06F16/3344 , G06F16/338 , G06F16/93 , G06F17/2715 , G06F17/277
摘要: A method, computer system, and a computer program product for comparing documents using latent semantic differences is provided. The present invention may include receiving documents from a user. The present invention may also include extracting linguistic units associated with the received documents. The present invention may then include building latent semantic dimensions based on the extracted linguistic units. The present invention may then include weighting the extracted linguistic units utilizing the built latent semantic dimensions. The present invention may then include determining latent semantic differences between the received documents based on weighted linguistic units. The present invention may also include mapping the weighted linguistic units to a scaled visual feature. The present invention may further include generating a visualization to the user of the received documents based on the determined latent semantic differences and the scaled visual feature.
-
-
-
-
-
-
-
-
-