Described are methods, systems and computer readable media for dynamic updating of query result displays.

Data is received that specifies a term generated by user input in a graphical user interface. Thereafter, the term is looked up in a dictionary in which there are multiple classes for terms. The term can be classified based on a first class having a top ranked effective count for the term within the dictionary when a ratio of the first class relative to a second class having a second ranked effective count for the term in the dictionary is above a pre-defined threshold. In addition, the term is classified using a machine learning model when the ratio of the first class relative to the second class is below the pre-defined threshold. Data can be provided which characterizes the classifying. Related apparatus, systems, techniques and articles are also described.

The present disclosure describes a system, method, and computer program for converting a natural language update instruction to a structured update database statement. In response to receiving a natural language query for a database, an NLU model is applied to the query to identify an intent and entities associated with the query. If the intent is to update a data object, the system evaluates the entities to identify update fields and update values. Update fields are matched to update values based on update parameters, operand type of the update value, and location of the update fields and values. For each update field and value pair, an update context is calculated to determine whether the update value is absolute or relative to an existing field value. An update plan is created with the update field and value pairs and corresponding update contexts, and a database update statement is generated from the update plan.

Provided are systems and methods of a compiler that efficiently processes semantic analysis. For example, the compiler may perform semantic analysis on as much of the source code as possible during compile time. For any instructions, such as dynamic expressions, that are not known at compile time, the compiler may encode semantic bytecode for performing the semantic checks on such dynamic expressions, and their dependent expressions, during execution/runtime of the program. In one example, the method may include compiling source code of a program into bytecode, identifying, during the compiling, a dynamic expression that includes one or more dependent static expressions within the source code, generating semantic bytecode for semantic analysis of the one or more dependent static expressions of the dynamic expression, and adding the semantic bytecode to the bytecode of the program.

Certain aspects of the disclosure are directed to context aggregation in a data communications network. According to a specific example, user-data communications between a client-specific endpoint device and the other participating endpoint device during a first time period can be retrieved from a plurality of interconnected data communications systems. The client entity can be configured and arranged to interface with a data communications server providing data communications services on a subscription basis. A context can be determined for each respective user-data communication between the endpoint devices during the first time period. A plurality of user-data communications between the client-specific endpoint device and the other participating endpoint device can be aggregated during a second time period, and a context can be determined for the aggregated user-data communications during the second time period based on a comparison of the aggregated user-data communications and the user-data communications during the first time period.

A system and method for translating questions into database queries are provided. A text to database query system receives a natural language question and a structure in a database. Question tokens are generated from the question and query tokens are generated from the structure in the database. The question tokens and query tokens are concatenated into a sentence and a sentence token is added to the sentence. A BERT network generates question hidden states for the question tokens, query hidden states for the query tokens, and a classifier hidden state for the sentence token. A translatability predictor network determines if the question is translatable or untranslatable. A decoder converts a translatable question into an executable query. A confusion span predictor network identifies a confusion span in the untranslatable question that causes the question to be untranslatable. An auto-correction module to auto-correct the tokens in the confusion span.

Systems and methods are disclosed for flexibly applying a query term to heterogeneous data. A query system can receive a query that includes a data-determinant query term. As the system executes the query it can generate interim search results. As the system query processes the interim search results based on the query, it can apply the data-determinant query term to records of the interims search results based on the structure of the records.

A search interface is displayed in a table format that includes one or more columns, each column including data items of an event attribute, the data items being of a set of events, and a plurality of rows forming cells with the one or more columns, each cell including one or more of the data items of the event attribute of a corresponding column. Based on a user selecting one or more of the cells, a list of options if displayed corresponding to the selection, and one or more commands are added to a search query that corresponds to the set of events, the one or more commands being based on at least an option that is selected from the list of options and the event attribute for each of the one or more of the data items of each of the selected one or more cells.

A computer retrieves data from a database. The computer retrieves a Machine Learning (ML) model trained to generate database queries. The computer applies the ML model to generate a primary database query based, at least in part, on a user inquiry available to the computer. The computer retrieves the primary database query, an initial set of data from a database available to the computer. The computer, in response to retrieving the initial set of data, receives feedback assessing the initial set of data. The computer, in response to receiving the feedback, applies a Natural Language Processing (NLP) model to identify query adjustment content within the feedback. The computer revises the primary database query based, at least in part, on the model adjustment content, to generate a secondary database query. The computer retrieves using the secondary database query, a secondary set of data from the database.

A method of identifying relationships between data collections is disclosed. Each data collection comprises a plurality of data records made up of data fields. The method comprises performing a relationship search process based on a first seed value and a second seed value. A first set of records from the data collections is identified based on the first seed value. A second set of records from the data collections is identified based on the second seed value. The process then searches for a common value across the first and second record sets, wherein the common value is a value which appears in a first field in a first record of the first record set and in a second field in a second record of the second record set, wherein the first record is from a first data collection and the second record is from a second data collection. In response to identifying the common value, an indication is output identifying a candidate relationship between the first field of the first data collection and the second field of the second data collection.