Computer-implemented techniques for enhanced tagging of natural language queries that are initially segmented and tagged by a named entity recognition system. By doing so, enhanced tagging of a natural language query that represents a deeper understanding of the query is provided. The enhanced tagging improves the operation of search engines that use the enhanced tags by enabling the search engine to identify and return more relevant search results in answers to natural language queries.

A smart assistant is disclosed that provides for interfaces to capture requirements for a technical assistance request and then execute actions responsive to the technical assistance request. Example embodiments relate to parsing natural language input defining a technical assistance request to determine a series of instructions responsive to the technical assistance request. The smart assistant may also automatically detect a condition and generate a technical assistance request responsive to the condition. One or more driver applications may control or command one or more computing systems to respond to the technical assistance request.

A smart assistant is disclosed that provides for interfaces to capture requirements for a technical assistance request and then execute actions responsive to the technical assistance request. Example embodiments relate to parsing natural language input defining a technical assistance request to determine a series of instructions responsive to the technical assistance request. The smart assistant may also automatically detect a condition and generate a technical assistance request responsive to the condition. One or more driver applications may control or command one or more computing systems to respond to the technical assistance request.

System and method for relation extraction using adaptive thresholding and localized context pooling (ATLOP). The system includes a computing device, the computing device has a processer and a storage device storing computer executable code. The computer executable code is configured to provide a document; embed entities in the document into embedding vectors; and predict relations between a pair of entities in the document using their embedding vectors. The relation prediction is performed based on an improved language model. Each relation has an adaptive threshold, and the relation between the pair of entities is determined to exist when a logit of the relation between the pair of entities is greater than a logit function of the corresponding adaptive threshold.

Examples associated with reading difficulty level based resource recommendation are disclosed. One example may involve instructions stored on a computer readable medium. The instructions, when executed on a computer, may cause the computer to obtain a set of candidate resources related to a source document. The candidate resources may be obtained based on content extracted from the source document. The instructions may also cause the computer to identify reading difficulty levels of members of the set of candidate resources. The instructions may also cause the computer to recommend a selected candidate resource to a user. The selected candidate resource may be recommended based on subject matter similarity between the selected candidate resource and the source document. The selected candidate resource may also be recommended based on reading difficulty level similarity between the selected candidate resource and the source document.

The present disclosure is related in general to software testing and a method and a system for automatically identifying violation in the test cases. A test case validation system categorizes the test cases into event-based test cases and binary test cases. Further, a Part-Of-Speech (POS) pattern is detected in the one or more test cases based on POS tags assigned to each of the tokens in test cases. Thereafter, comparison of the detected POS pattern and the one or more tokens with predefined POS patterns and predefined tokens identifies violations in the one or more test cases if any, using pattern matching and Natural Language Processing (NLP). The predefined POS patterns and tokens used for comparison are filtered based on category of the test case thus accelerating the process of the violation identification. The test case validation system is capable of accurately identifying more than one type of violations simultaneously.

A method is provided for creating a lexical tree from a statement in a natural language. The method is implemented by a natural-language processing module. The method includes: receiving a statement in natural language in the form of a string of characters; iteratively processing the statement as a function of at least one processing parameter and one ontological dictionary, delivering at least one relational graph corresponding to at least one lexical item included in the statement in natural language; and creating a data structure at output having all possible combinations of the lexical items of the statement in natural language on the basis of the at least one relational graph.

Features are disclosed for processing a user utterance with respect to multiple subject matters or domains, and for selecting a likely result from a particular domain with which to respond to the utterance or otherwise take action. A user utterance may be transcribed by an automatic speech recognition (“ASR”) module, and the results may be provided to a multi-domain natural language understanding (“NLU”) engine. The multi-domain NLU engine may process the transcription(s) in multiple individual domains rather than in a single domain. In some cases, the transcription(s) may be processed in multiple individual domains in parallel or substantially simultaneously. In addition, hints may be generated based on previous user interactions and other data. The ASR module, multi-domain NLU engine, and other components of a spoken language processing system may use the hints to more efficiently process input or more accurately generate output.

Embodiments are directed towards a graphical user interface identify locations within event records with splittable timestamp information. A display of event records is provided using any of a variety of formats. A splittable timestamp selector allows a user to select one or more locations within event records as having time related information that may be split across the one or more locations, including, information based on date, time of day, day of the week, or other time information. Any of a plurality of mechanisms is used to associate the selected locations with the split timestamp information, including tags, labels, or header information within the event records. In other embodiments, a separate table, list, index, or the like may be generated that associates the selected locations with the split timestamp information. The split timestamp information may be used within extraction rules for selecting subsets or the event records.

Embodiments are directed towards a graphical user interface identify locations within event records with splittable timestamp information. A display of event records is provided using any of a variety of formats. A splittable timestamp selector allows a user to select one or more locations within event records as having time related information that may be split across the one or more locations, including, information based on date, time of day, day of the week, or other time information. Any of a plurality of mechanisms is used to associate the selected locations with the split timestamp information, including tags, labels, or header information within the event records. In other embodiments, a separate table, list, index, or the like may be generated that associates the selected locations with the split timestamp information. The split timestamp information may be used within extraction rules for selecting subsets or the event records.