Thoughtspot, Inc.

Nikhil Yadav

Rakesh Kothari

Ravi Tandon

Hungpin Kao

Manikanta Venkata Rahul Balakavi

Rahul Manikanta Balakavi

Generating object morphisms during object search includes obtaining object-search request data, wherein the object-search request data includes object-search terms, obtaining resolved-request data representing the object-search terms, determining that a first analytical object partially consistent with the resolved-request data is available, wherein the first analytical object is consistent with a first portion of the resolved-request data, generating candidate object-morphism data with respect to the first analytical object in accordance with a second portion of the resolved-request data, outputting object-search response data including the candidate object-morphism data for presentation to a user, obtaining data indicating a selected object morphism from the candidate object-morphism data, generating a second analytical object in accordance with the first analytical object and the selected object morphism, wherein the second analytical object differs from the first analytical object, and outputting response data including the second analytical object for presentation to the user.

Generating object morphisms during object search

Systems and methods for mapping natural language to queries using a query grammar are described. For example, methods may include generating, based on a string, a set of tokens of a database syntax; generating a query graph for the set of tokens from a finite state machine representing a query grammar, wherein nodes of the finite state machine represent token types, directed edges of the finite state machine represent valid transitions between token types in the query grammar, vertices of the query graph correspond to respective tokens of the set of tokens, and directed edges of the query graph represent a transition between two tokens in a sequencing of the tokens; determining, based on a tour of the query graph, a sequence of the tokens in the set of tokens, forming a database query; and invoking a search of a database using a query based on the database query to obtain search results.

Mapping natural language to queries using a query grammar

Systems and methods for mapping natural language to queries using a query grammar are described. For example, methods may include generating, based on a string, a set of tokens of a database syntax; generating a query graph for the set of tokens using a finite state machine representing a query grammar, wherein nodes of the finite state machine represent token types, directed edges of the finite state machine represent valid transitions between token types in the query grammar, vertices of the query graph correspond to respective tokens of the set of tokens, and directed edges of the query graph represent a transition between two tokens in a sequencing of the tokens; determining, based on the query graph, a sequence of the tokens in the set of tokens, forming a database query; and invoking a search of a database using a query based on the database query to obtain search results.

Growing community of inventors

Sunnyvale, CA, United States of America

Nikhil Yadav