Abstract: Techniques are disclosed herein for managing date-time intervals in transforming natural language utterances to logical forms by providing an enhanced grammar, a natural language utterance comprising a date-time interval, and database schema information to a machine learning model that has been trained to convert natural language utterances to logical forms; and using the machine learning model to convert the natural language utterance to an output logical form, wherein the output logical form comprises at least one of the date-time interval and an extraction function for extracting date-time information corresponding to the date-time interval from at least one date-time attribute of the database schema information.

Abstract: Techniques are disclosed herein for managing ambiguous date mentions in natural language utterances in transforming natural language utterances to logical forms by encoding the uncertainties of the ambiguous date mentions and including the encoded uncertainties in the logical forms. In a training phase, training examples including natural language utterances, logical forms, and database schema information are automatically augmented and used to train a machine learning model to convert natural language utterances to logical form. In an inference phase, input database schema information is augmented and used by the trained machine learning model to convert an input natural language utterance to logical form.

Abstract: Techniques are disclosed herein for transforming natural language conversations into a visual output. In one aspect, a computer-implement method includes generating an input string by concatenating a natural language utterance with a schema representation comprising a set of entities for visualization actions, generating, by a first encoder of a machine learning model, one or more embeddings of the input string, encoding, by a second encoder of the machine learning model, relations between elements in the schema representation and words in the natural language utterance based on the one or more embeddings, generating, by a grammar-based decoder of the machine learning model and based on the encoded relations and the one or more embeddings, an intermediate logical form that represents at least the query, the one or more visualization actions, or the combination thereof, and generating, based on the intermediate logical form, a command for a computing system.

Abstract: The present disclosure relates to manufacturing training data by leveraging an automated pipeline that manufactures visualization training datasets to train a machine learning model to convert a natural language utterance into meaning representation language logical form that includes one or more visualization actions. Aspects are directed towards accessing an original training dataset, a visualization query dataset, an incremental visualization dataset, a manipulation visualization dataset, or any combination thereof. One or more visualization training datasets are generated by: (i) modifying examples in the original training dataset, the visualization query dataset, or both to include visualization actions, (ii) generating examples, using the incremental visualization dataset, the manipulation visualization dataset, or both, that include visualization actions, or (iii) both (i) and (ii).

Abstract: The present disclosure is related to techniques for converting a natural language utterance to a logical form query and deriving a natural language interpretation of the logical form query. The techniques include accessing a Meaning Resource Language (MRL) query and converting the MRL query into a MRL structure including logical form statements. The converting includes extracting operations and associated attributes from the MRL query and generating the logical form statements from the operations and associated attributes. The techniques further include translating each of the logical form statements into a natural language expression based on a grammar data structure that includes a set of rules for translating logical form statements into corresponding natural language expressions, combining the natural language expressions into a single natural language expression, and providing the single natural language expression as an interpretation of the natural language utterance.

Abstract: The present disclosure is related to techniques for converting a natural language utterance to a logical form query and deriving a natural language interpretation of the logical form query. The techniques include accessing a Meaning Resource Language (MRL) query and converting the MRL query into a MRL structure including logical form statements. The converting includes extracting operations and associated attributes from the MRL query and generating the logical form statements from the operations and associated attributes. The techniques further include translating each of the logical form statements into a natural language expression based on a grammar data structure that includes a set of rules for translating logical form statements into corresponding natural language expressions, combining the natural language expressions into a single natural language expression, and providing the single natural language expression as an interpretation of the natural language utterance.

Abstract: Techniques are disclosed for augmenting training data for training a machine learning model to generate database queries. Training data comprising a first training example comprising a first natural language utterance, a logical form for the first natural language utterance, and associated first metadata is obtained. From the first training example, a template utterance is generated. A second natural language utterance is generated by filling slots in the template utterance based on a database schema and database values. Updated metadata is produced based on the first metadata and the second natural language utterance. A second training example is generated, comprising the second natural language utterance, the logical form for the first natural language utterance, and the updated metadata. The training data is augmented by adding the second training example. A machine learning model is trained to generate a database query comprising the database operation using the augmented training data set.

Abstract: Techniques are disclosed herein for converting a natural language utterance to an intermediate database query representation. An input string is generated by concatenating a natural language utterance with a database schema representation for a database. Based on the input string, a first encoder generates one or more embeddings of the natural language utterance and the database schema representation. A second encoder encodes relations between elements in the database schema representation and words in the natural language utterance based on the one or more embeddings. A grammar-based decoder generates an intermediate database query representation based on the encoded relations and the one or more embeddings. Based on the intermediate database query representation and an interface specification, a database query is generated in a database query language.

Abstract: Techniques are disclosed herein for using named entity recognition to resolve entity expression while transforming natural language to a meaning representation language. In one aspect, a method includes accessing natural language text, predicting, by a first machine learning model, a class label for a token in the natural language text, predicting, by a second machine-learning model, operators for a meaning representation language and a value or value span for each attribute of the operators, in response to determining that the value or value span for a particular attribute matches the class label, converting a portion of the natural language text for the value or value span into a resolved format, and outputting syntax for the meaning representation language. The syntax comprises the operators with the portion of the natural language text for the value or value span in the resolved format.

Abstract: Techniques are disclosed herein for synthesizing synthetic training data to facilitate training a natural language to logical form model. In one aspect, training data can be synthesized from original under a framework based on templates and a synchronous context-free grammar. In one aspect, training data can be synthesized under a framework based on a probabilistic context-free grammar and a translator. In one aspect, training data can be synthesized under a framework based on tree-to-string translation. In one aspect, the synthetic training data can be combined with original training data in order to train a machine learning model to translate an utterance to a logical form.

Abstract: Techniques are disclosed herein for synthesizing synthetic training data to facilitate training a natural language to logical form model. In one aspect, training data can be synthesized from original under a framework based on templates and a synchronous context-free grammar. In one aspect, training data can be synthesized under a framework based on a probabilistic context-free grammar and a translator. In one aspect, training data can be synthesized under a framework based on tree-to-string translation. In one aspect, the synthetic training data can be combined with original training data in order to train a machine learning model to translate an utterance to a logical form.

Abstract: Techniques are disclosed herein for synthesizing synthetic training data to facilitate training a natural language to logical form model. In one aspect, training data can be synthesized from original under a framework based on templates and a synchronous context-free grammar. In one aspect, training data can be synthesized under a framework based on a probabilistic context-free grammar and a translator. In one aspect, training data can be synthesized under a framework based on tree-to-string translation. In one aspect, the synthetic training data can be combined with original training data in order to train a machine learning model to translate an utterance to a logical form.

Abstract: Techniques for preprocessing data assets to be used in a natural language to logical form model based on scalable search and content-based schema linking. In one particular aspect, a method includes accessing an utterance, classifying named entities within the utterance into predefined classes, searching value lists within the database schema using tokens from the utterance to identify and output value matches including: (i) any value within the value lists that matches a token from the utterance and (ii) any attribute associated with a matching value, generating a data structure by organizing and storing: (i) each of the named entities and an assigned class for each of the named entities, (ii) each of the value matches and the token matching each of the value matches, and (iii) the utterance, in a predefined format for the data structure, and outputting the data structure.

Abstract: This disclosure describes techniques for determining whether to approve or deny a borrower's lending-product request by selectively using a heuristic and statistical model. More specifically, a borrower may submit a lending-product request to a Statistical Risk Management (SRM) system, and in doing so the SRM system may analyze relationship attributes of the borrower to determine a likelihood of borrower repaying a loan over a predetermined time period, and avoid being charged off. In some examples, the SRM system may execute a plurality of statistical models to determine a charge-off probability score. Each statistical model may be based on a set, or subset of historical lending-product data. A subset of historical lending-product data may be based on a selection bias of shared characteristics within a set of historical lending-product data. The selection bias may be based on characteristics of a lending-product request or relationship attributes of a borrower.

Abstract: This disclosure describes techniques for determining whether to approve or deny a borrower's lending-product request by selectively using a heuristic and statistical model. More specifically, a borrower may submit a lending-product request to a Heuristic-Statistical Risk Management (HS-RM) system, and in doing so the HS-RM system may analyze relationship attributes of the borrower to determine a likelihood of borrower repaying a loan over a predetermined time period, and avoid being charged off. In some examples, the HS-RM system may execute a plurality of statistical models to determine a charge-off probability score. Each statistical model may be based on a set, or subset of historical lending-product data. A subset of historical lending-product data may be based on a selection bias of shared characteristics within a set of historical lending-product data. The selection bias may be based on characteristics of a lending-product request or relationship attributes of a borrower.

Abstract: This disclosure describes techniques for determining whether to approve or deny a borrower's lending-product request by selectively using a heuristic and statistical model. More specifically, a borrower may submit a lending-product request to a Heuristic-Statistical Risk Management (HS-RM) system, and in doing so the HS-RM system may analyze relationship attributes of the borrower to determine a likelihood of borrower repaying a loan over a predetermined time period, and avoid being charged off. In some examples, the HS-RM system may execute a plurality of statistical models to determine a charge-off probability score. Each statistical model may be based on a set, or subset of historical lending-product data. A subset of historical lending-product data may be based on a selection bias of shared characteristics within a set of historical lending-product data. The selection bias may be based on characteristics of a lending-product request or relationship attributes of a borrower.

Abstract: This disclosure describes techniques for determining whether to approve or deny a borrower's lending-product request by selectively using a heuristic and statistical model. More specifically, a borrower may submit a lending-product request to a Statistical Risk Management (SRM) system, and in doing so the SRM system may analyze relationship attributes of the borrower to determine a likelihood of borrower repaying a loan over a predetermined time period, and avoid being charged off. In some examples, the SRM system may execute a plurality of statistical models to determine a charge-off probability score. Each statistical model may be based on a set, or subset of historical lending-product data. A subset of historical lending-product data may be based on a selection bias of shared characteristics within a set of historical lending-product data. The selection bias may be based on characteristics of a lending-product request or relationship attributes of a borrower.

Abstract: A statistical model enables a lender financial institution to leverage multiple relationship attributes of a borrower to predict whether the borrower is capable of timely paying back a loan. The statistical model is generated to provide a multitude of relationship attribute coefficients based on historical borrower data of a multiple borrowers from an alternative loan approval process. The multitude of relationship attribute coefficients are applied to corresponding relationship attribute values of a borrower that is seeking a loan from a financial institution to generate an intermediate borrower score for the borrower. A probability of the borrower not being charged off on a loan after a predetermine time period is then calculated based on the intermediate borrower score. Accordingly, the loan may be determined to be approved or denied based on a comparison of the probability to an approval cutoff threshold.

Abstract: Aspects describe a wideband active quasi-circulator that has the advantages of small size, lightweight, and compatibility with monolithic microwave integrated circuit (MMIC) technology. An active quasi-circulator is provided that comprises both a power amplifier and a low noise amplifier. The active quasi-circulator can operate over a wide frequency range with isolation or substantial isolation between a power amplifier and a low noise amplifier that is tunable with isolation or substantial isolation at any frequency within the wide frequency range. The provided quasi-circulator is suitable for use in mobile units in multi-band radio frequency communication systems, as well as in other configurations.

Abstract: Aspects describe a wideband active quasi-circulator that has the advantages of small size, lightweight, and compatibility with monolithic microwave integrated circuit (MMIC) technology. An active quasi-circulator is provided that comprises both a power amplifier and a low noise amplifier. The active quasi-circulator can operate over a wide frequency range with isolation or substantial isolation between a power amplifier and a low noise amplifier that is tunable with isolation or substantial isolation at any frequency within the wide frequency range. The provided quasi-circulator is suitable for use in mobile units in multi-band radio frequency communication systems, as well as in other configurations.