公开(公告)号：US20200012686A1

公开(公告)日：2020-01-09

申请号：US16575806

申请日：2019-09-19

Applicant: OATH INC.

Inventor： Liane Lewin-Eytan ,  David Carmel ,  Ariel Raviv ,  Alexander Libov ,  Yoelle Maarek ,  Peter Monaco

IPC: G06F16/9032

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.

公开(公告)号：US10459981B2

公开(公告)日：2019-10-29

申请号：US15402391

申请日：2017-01-10

Applicant: OATH INC.

Inventor： Liane Lewin-Eytan ,  David Carmel ,  Ariel Raviv ,  Alexander Libov ,  Yoelle Maarek ,  Peter Monaco

IPC: G06F16/9032 ,  G06Q10/10 ,  G06F16/332

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.

公开(公告)号：US10652187B2

公开(公告)日：2020-05-12

申请号：US15150918

申请日：2016-05-10

Applicant: OATH INC.

Inventor： Liane Lewin-Eytan ,  David Carmel ,  Yoelle Maarek ,  Ariel Raviv ,  Alexander Libov ,  Peter Monaco

IPC: H04L12/58 ,  G06Q10/10 ,  G06F16/335

Abstract: Relevant messages, or “hero results”, which are not ranked at the uppermost part of a time-based listing of search results are identified and such hero results can be displayed apart from the time-based listing of search results. A user can be provided with messages in a time-based presentation as well as messages in a relevance-based presentation. The user can be presented with the most relevant messages from a set of message generated from a search query, even where the most relevant messages are not the most recent ones.

公开(公告)号：US10013672B2

公开(公告)日：2018-07-03

申请号：US13667205

申请日：2012-11-02

Applicant: OATH INC.

Inventor： Richard Earle Seeger, III ,  Peter Monaco

IPC: G06F17/30 ,  G06Q10/10

CPC classification number: G06Q10/101 ,  G06F16/9535

Abstract: Systems and methods to extract a string from a communication. A method includes: receiving a communication comprising a plurality of strings; assigning a score to each of the strings, wherein the score assigned to each of the strings corresponds to a frequency of usage of the respective string for a first function relative to an overall frequency of usage of the respective string; determining a respective total sum for each of a plurality of sequences in the communication, the respective total sum determined as a sum of the scores for each string in the respective sequence; and extracting a first sequence of the sequences from the communication based on the total sum for the first sequence. In one embodiment, the total sum includes an additional score for each of a starting word and an ending word of the first word sequence, wherein each respective additional score is associated with a probability that the starting (or ending) word is used as the first (or last word) of an address.