Keyboard with a suggested search query region
US-2017308292-A1 · Oct 26, 2017 · US
US11308173B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11308173-B2 |
| Application number | US-201816145760-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 28, 2018 |
| Priority date | Dec 19, 2014 |
| Publication date | Apr 19, 2022 |
| Grant date | Apr 19, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
In one embodiment, a method includes receiving a first query comprising one or more n-grams inputted by the first user at the client system, accessing by the client system a plurality of ideograms each being associated with one or more tags matching at least one of the n-grams of the first query, where the one or more ideograms are ranked in an order based on their respective user-probabilities each being calculated based at least in part on a frequency of use associated with the respective ideogram, presenting one or more of the ideograms at the client system in ranked order where each ideogram is selectable by the first user, and receiving a selection of one of the presented ideograms at the client system.
Opening claim text (preview).
What is claimed is: 1. A method comprising, by a client system of a first user: accessing, by the client system responsive to an authorization of the first user, a authorized set of ideograms with a restrictive condition from a plurality of ideograms, wherein the restrictive condition specifies user-specific information required for accessing the authorized set of ideograms, wherein the authorized set of ideograms are determined based on comparing user-specific information associated with the first user against the specified user-specific information in the restrictive condition, wherein the authorized set of ideograms are ranked in an order based on their respective user-probabilities, and wherein each user-probability is calculated based at least in part on a frequency of use associated with the respective ideogram; receiving, at the client system, a first query inputted by the first user, wherein the first query comprises one or more n-grams; selecting, based on the first query, one or more of the authorized set of ideograms; presenting, at the client system, the one or more selected ideograms, wherein the ideograms are presented in ranked order, each ideogram being selectable by the first user; and receiving, at the client system, a selection of one of the presented ideograms. 2. The method of claim 1 , wherein at least one of the one or more n-grams corresponds to an emoticon. 3. The method of claim 1 , wherein the first user is a user of an online social network and wherein the frequency of use is determined for a plurality of users of the online social network. 4. The method of claim 1 , wherein the frequency of use is determined with respect to the first user. 5. The method of claim 1 , wherein s denotes an ideogram, q denotes the first query, and the use-probability, P(s|q), is computed as: P ( s | q ) = P ( q | s ) · P ( s ) P ( q ) = P ( q | s ) · P ( s ) wherein [ 1 ] P ( q | s ) = number of times s was sent for q number of time s was sent for
Search customisation based on user profiles and personalisation · CPC title
Search customisation based on social or collaborative filtering · CPC title
using probabilistic model · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.