International Business Machines Corporation

Balaji Sankar Kumar

Vishal George Palliyathu

John Kurian

Vidya Chandrashekar

Hemalatha Rajendran

Vamshi Dondapati

Harpreet Singh

Akshat Dixit

Michael J Iantosca

Rohan S Zunzarrao

Aparna Srinivasan

Arun Sabaresh Anantha Narayanan

Ranjith E Raman

Arun Aravind

Manu K M

Mohit Sati

Vivekmani Tsk

Kapish Malhotra

Bindu Tank

An embodiment converts, by a voice-to-text converter, voice data to text data. The embodiment extracts, by an extractor, an intent and an entity from the text data. The embodiment predicts, by a predictor, based on the intent and the entity, a sensitive information. The embodiment compares, by an intersector, the text data to the predicted sensitive information. The embodiment determines, by the intersector, responsive to the comparing, whether the text data includes the predicted sensitive information. The embodiment intersects, by the intersector, responsive to a determination that the text data includes the predicted sensitive information, the voice data.

Identification and prevention of sensitive information exposure in telephonic conversations

An embodiment includes generating an intent representative of a verb identified in application programming interface (API) test data associated with an API test case. The embodiment also generates a first entity representative of a first noun identified in the API test data and a second entity representative of a second noun identified in the API test data. The embodiment identifies the intent as being associated with a relationship between the first and second entities in the API test case. The embodiment generates a relationship model associated with the API test case, where the relationship model includes the intent as the relationship between the first entity and the second entity. The embodiment generates a conversation model of an artificial intelligence (AI) conversation agent by mapping the intent and the first and second entities to dialog nodes of the conversation model.

Generating an AI conversation model using API test data

Deploying schematically enriched document content as Representational State Transfer (REST) Application Programming Interfaces (APIs) is provided. Nouns corresponding to topics in a parent-child topic hierarchy of a table of contents of a document are utilized to generate a REST API for each topic in the parent-child topic hierarchy. A REST resource model is generated that contains each generated REST API corresponding to each topic in the parent-child topic hierarchy of the table of contents of the document. The REST resource model corresponding to the parent-child topic hierarchy of the table of contents of the document is deployed to subscribing client applications via a network.

Deploying schematically enriched document content as representational state transfer application programming interfaces

Embodiments relate to an intelligent computer platform to support a chatbot platform. A semantically enriched document is subjected to natural language processing to generate a cache of tokens, and further classify the tokens, including noun and verb tokens. For each verb token, a corresponding intent is generated, and for each noun token a corresponding entity is generated. A relationship between the generated intents and entities is mapped, and a topology representing the mapped relationship is constructed. A primary verb is identified and assigned as a root node in the topology, and an arrangement of entities related to primary verb are identified and assigned as child nodes related to the root node. The constructed topology is consumed to an AI schema for implementation in the chatbot platform to support real-time communication flow.

Natural language artificial intelligence topology mapping for chatbot communication flow

An approach for generating an index in Darwin Information Typing Architecture (DITA) source files. The approach determines one or more similar index entries of a prioritized index. The approach determines a fraternal association exists between at least two of the one or more similar index entries when at least one of the one or more similar index entries occur with one or more similar high priority index entries. Responsive to a determination that a fraternal association exists between at least two of the one or more similar index entries, the approach determines whether an inheritance from a parent exists. The approach determines based, at least in part, on whether a fraternal association exists and whether an inheritance from a parent exists, a Darwin Information Typing Architecture (DITA) index.

Generating index entries in source files

An approach is provided for controlling computer resource usage. A new event in an integration flow in an integration platform is detected. Sender and receiver information is identified and hashed. A portion of data being sent by the sender to the receiver is selected and hashed. It is determined that the hashed sender and receiver information matches a first entry and the hashed selected portion of the data matches a second entry in a pattern repository. A recurring event in the integration flow is identified, where the recurring event uses an amount of computer resources that exceeds a threshold amount. An action is performed which reduces the amount of computer resources used by the integration flow to a new amount that does not exceed the threshold amount.

Identifying recurring actions in a hybrid integration platform to control resource usage

A method and associated systems improve access time of a federated repository that represents a set of individual data repositories as a virtualized aggregated repository. An analyzer module counts the number of entries in each individual repository that are associated with each possible value of a selected concordance parameter. The analyzer stores these counts in a Concordance Frequency Table. When the federated-repository manager receives a data-access request, the analyzer associates the requested data element with a corresponding value of the concordance parameter. The analyzer then uses information stored in the Table to select an optimal sequence in which the federated-repository manager should search the repositories for the requested data. This optimal sequence orders the repositories such that the first repositories to be searched will be those that contain the greatest number of entries associated with the concordance-parameter value of the requested data.

Optimizing data access from a federated repository based on concordance frequency

A computer scans a DITA library to identify DITA topic files. The computer then determines whether the identified DITA file has a concept, task, or reference scheme. Based on determining that the identified DITA topic file has a concept scheme, the computer generates a subject taxonomy. Based on determining that the identified DITA topic file has a task scheme, the computer generates a navigation taxonomy. Based on determining that the identified DITA topic file has a reference scheme, the computer generates a command relational taxonomy. Based on the generated subject, navigation, and command relational taxonomies, the computer generates a DITA file relationship table based on the contextual taxonomy density of the aforementioned taxonomies.

DITA relationship table based on contextual taxonomy density

An approach for generating an index in Darwin Information Typing Architecture (DITA) source files. The approach determines a gerund-noun listing based, at least in part, on one or more files. The approach determines a prioritized index of the gerund-noun listing. The approach determines one or more similar index entries of the prioritized index. The approach determines whether a fraternal association exists between at least two of the one or more similar index entries. Responsive to a determination that a fraternal association exists between at least two of the one or more similar index entries, the approach determines whether an inheritance from a parent exists. The approach determines based, at least in part, on whether a fraternal association exists and whether an inheritance from a parent exists, a DITA index.

Growing community of inventors

Bengaluru, India

Balaji Sankar Kumar