A system for database access comprising a plurality of databases, each database having a plurality of defined data fields and a mapping system coupled to the plurality of databases, the mapping system configured to create an algorithmic relationship between a plurality of first fields of a plurality of first databases, and a corresponding field of a plurality of second fields of a plurality of second databases.

Systems and methods are provided for storing data representing respective sub-elements of a complex task. Data representing one or more links between two or more sub-elements is stored, the links indicating a dependency between said sub-elements. A work order is calculated based on the identified links. A graphical representation of the calculated work order which indicates said sub-elements and their dependencies is provided. The links may indicate a temporal dependency of a second sub-element on a first sub-element and in which the provided graphical representation presents the temporal relationship of the sub-elements. Historical data may be received for association with one or more selected links or sub-elements, the historical data related to a prior event and which affects the temporal relationship between the sub-elements. An updated work order modified by the historical data may be calculated. An updated graphical representation of the work order may be provided.

A method for dialog state tracking includes decoding, by a fertility decoder, encoded dialog information associated with a dialog to generate fertilities for generating dialog states of the dialog. Each dialog state includes one or more domains. Each domain includes one or more slots. Each slot includes one or more slot tokens. The method further includes generating an input sequence to a state decoder based on the fertilities. A total number of each slot token in the input sequence is based on a corresponding fertility. The method further includes encoding, by a state encoder, the input sequence to the state decoder, and decoding, by the state decoder, the encoded input sequence to generate a complete sequence of the dialog states.

Embodiments are provided that relate to a computer system, a computer program product, and a computer-implemented method for improving performance of a virtual dialog agent system employing an automated virtual dialog agent. Embodiments involve generating ground truth (GT) from a user's knowledge base, and leveraging the GT to evaluate how the virtual dialog agent performs with the GT. The evaluation measures quality of a multi-turn virtual dialog, and generates a remediation plan directed at an algorithmic improvement of the virtual dialog agent.

Systems and methods are provided for improved web searching. In one implementation, suggested search queries am provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

Systems and methods are provided for improved web searching. In one implementation, suggested search queries am provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

The present disclosure discloses a task processing method and a distributed computing framework. A specific embodiment of the method includes: parsing an expression corresponding to a distributed computing task, and constructing task description information corresponding to the distributed computing task, the task description information being used to describe a corresponding relationship between an operator and a distributed dataset, and the operator acting on at least one of the distributed dataset or distributed datasets obtained by grouping the distributed dataset; determining, based on the task description information, a distributed dataset the operator acting on; and performing distributed computing on the distributed dataset the operator acting on using the operator. In the distributed computing, the acting scope and nesting relationship of the operator is described by constructing a topology.

The present disclosure provides a search method, an electronic device and a storage medium, and belongs to a technical field of the Internet. The method includes: determining a first set of features corresponding to an original search statement by parsing the original search statement; obtaining each initial search result corresponding to the original search statement; determining a second set of features corresponding to an initial search result by parsing a title of the initial search result; determining a rewritten search statement corresponding to the original search statement and the initial search result by codecing the first set of features and the second set of features; and obtaining a supplementary search result corresponding to the rewritten search statement.

Systems and methods including one or more processors and one or more non-transitory computer readable media storing computing instructions that, when executed on the one or more processors, perform: receiving historical in-session user activity information; receiving, via a graphical user interface (GUI) of a user device, a partial search query from a user; analyzing the partial search query based on the historical in-session user activity information using one or more query suggestion systems to determine a respective score for respective suggested search queries from each of the one or more query suggestion systems; determining a respective absolute position metric for the respective suggested search queries from each of the one or more query suggestion systems; determining a respective efficiency metric for each of the one or more query suggestion systems based on the respective absolute position metric; analyzing the respective efficiency metric for each of the one or more query suggestion systems to determine a query suggestion system of the one or more query suggestion systems that satisfies a threshold; and transmitting instructions to modify the GUI to display the respective suggested search queries from the query suggestion system that satisfied the threshold.

Embodiments relate to an intelligent computer platform to identify a lexical answer type (LAT), a first concept relevant to the received request and a second concept related to the identified first concept. The LAT, together with the first and second concepts are utilized to create a first and second cluster. Documents are selectively populated into the clusters. The clusters are subject to sorting based on a relevancy protocol.