Intuit, Inc.

Yonatan Ben-Simhon

Alexander Zhicharevich

Oren Sar Shalom

Rami Cohen

Yair Horesh

Yehezkel Shraga Resheff

Liron Hayman

Ido Farhi

Nitzan Gado

Aspects of the present disclosure provide techniques for predicting content relevant to questions based on reference links. Embodiments include receiving a set of question and answer (Q/A) pairs and identifying a set of references in the set of Q/A pairs that link pairs of Q/A pairs of the set of Q/A pairs. Embodiments include identifying popular Q/A pairs of the set of Q/A pairs based on the set of references. The popular Q/A pairs may be referenced by a subset of the set of Q/A pairs and each respective Q/A pair of the subset of the set of Q/A pairs may comprise a respective question of a plurality of questions. Embodiments include training a model based on the plurality of questions, the popular Q/A pairs, and the set of references, to predict Q/A pairs of the set of Q/A pairs that are relevant to a given question.

Document similarity through reference links

Embodiments disclosed herein may extract trending topics from phone call transcripts or any type of text data. The phone call transcripts may be collected for a time period and the time period may be divided into time spans. For each time span having more than a threshold number of phone call transcripts, n-grams from the phone call transcripts may be extracted. The extracted n-grams may be contextually clustered by converting the n-grams into their embedding vectors, reducing the dimensionality of the embedding vectors, and clustering similar reduced dimensionality embedding vectors. Normalized occurrences of one or more clusters may be generated. The recent mean of the number of occurrences of the normalized clusters may be compared with the historical mean and offset by historical standard deviation to generate a modified Z-score. N-grams corresponding to the clusters with high Z-scores may be identified as trending topics.

Unsupervised extraction of trends from call center transcripts

A method involves receiving search queries, having search terms, submitted to at least one computerized search engine. For each query, a corresponding pairwise relation in the search queries is calculated. The corresponding pairwise relation is a corresponding probability of a potential edge relationship between at least two terms. Thus, potential edges are formed. A general graph of the terms is constructed by selecting edges from the potential edges. The general graph is nodes representing the terms used in the search queries. The general graph also is edges representing semantic relationships among the nodes. A hierarchical graph is constructed from the general graph by altering at least one of the edges among the nodes in the general graph to form the hierarchical graph.

Unsupervised automatic taxonomy graph construction using search queries

A computer-implemented method is provided to preforming re-categorization of financial transactions. The re-categorization is implemented by a server computing device which receives the financial transactions associated with a merchant and a first category. The server computing device receives user inputs that are each associated with re-categorizing a financial transaction from the first category to one or more other categories. Based at least in part on a count of the first category and counts of the one or more other categories, the server computing device determines a set of normalized ratios for the first category and the one or more other categories with respect to a total number of respective financial transactions received. The server computing device determines a second category corresponding to a minimum value in the set of the normalized ratios for each financial transaction associated with the merchant.

Growing community of inventors

Tel Aviv, Israel

Yonatan Ben-Simhon