International Business Machines Corporation

Bryan J Kyle

Octavian Florin Filoti

Christopher Munjal Nolan

Bridget Briana Beamon

Bradley M Debroni

John Michael Boyer

Mechanisms are provided for performing watched question processing. The mechanisms detect a change in content of electronic documents in a corpus of electronic documents, and retrieve a watched question from a watched question database. The mechanisms determine whether full processing of the watched question through the question answering pipeline is to be bypassed when performing watched question processing in response to the detected change in content of the electronic documents in the corpus. The mechanisms bypass one or more stages of processing of the question answering pipeline in response to determining that full processing of the watched question through the question answering pipeline is to be bypassed. The mechanisms return a result of the watched question processing indicating that no changes to the previously generated answers are caused by the change in the content of the electronic documents in the corpus.

Performance of time intensive question processing in a cognitive system

An approach is provided in which a knowledge manager generates a knowledge structure that includes security annotation tokens and term tokens. Each of the security annotation tokens are stored in a parallel field and align to at least one of the term tokens. The knowledge manager matches security policies corresponding to a search request to one or more of the security annotation tokens and, in turn, generates search results based upon obfuscation of one or more of the term tokens aligned to the matched security annotation tokens.

Multi-focused fine-grained security framework

A transformation process determines whether a predicate of a rule matches a given node of tree structured data containing a set of nodes and, when the predicate of a rule matches the given node, applies a function of an identified rule to the node to generate a compound result and an interim mutated output document, and when the compound result contains a next node, determines whether the next node is compared with the predicate of a next rule. The transform process includes determining that the next node is processed by a next rule, using the interim mutated output document as input, and determining whether a predicate of a rule matches the next node in a set of nodes. When the predicate of a rule matches the next node, a function of an identified rule is applied to the next node to generate a compound result and interim mutated output document. When the compound result does not contain a next node, a final mutated output document is generated.

Tree structured data transform, by determining whether a predicate of a rule matches a given node in a set and applying a function responsive to the match

Growing community of inventors

Victoria, Canada

Bryan J Kyle