# US 11,308,173 B2 · Searching for ideograms in an online social network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 11,308,173 B2
- Document ID: US11308173B2
- Status: Granted
- Kind: B2
- Application number: 16/145,760
- Filed: 2018-09-28
- Published: 2019-01-31
- Granted: 2022-04-19
- Earliest claimed: 2014-12-19
- Assignees: Meta Platforms, Inc.
- Applicants: Meta Platforms, Inc.
- Inventors: Brian Paihan Sa; Stephen Moore Davis; Nikola Vilimonovic; Jireh Yiwei Tan; Aaron Payne Goldsmid
- Web page: https://patentgrep.com/patent/US11308173B2

## CPC

- G06F 16/9536: Search customisation based on social or collaborative filtering
- G06F 16/3346: {using probabilistic model}
- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

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.

## Claims

### Claim 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.

### Claim 2 (depends on 1)

The method of claim 1, wherein at least one of the one or more n-grams corresponds to an emoticon.

### Claim 3 (depends on 1)

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.

### Claim 4 (depends on 1)

The method of claim 1, wherein the frequency of use is determined with respect to the first user.

### Claim 5 (depends on 1)

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
⁢
⁢
any
⁢
⁢
query
,
⁢
and
[
2
]
P
⁡
(
s
)
=
number
⁢
⁢
of
⁢
⁢
times
⁢
⁢
s
⁢
⁢
was
⁢
⁢
sent
number
⁢
⁢
of
⁢
⁢
times
⁢
⁢
any
⁢
⁢
sticker
⁢
⁢
was
⁢
⁢
sent
.
[
3
]

### Claim 6 (depends on 1)

The method of claim 1, wherein the first user is a user of an online social network, and wherein the online social network comprises a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user; and
a plurality of second nodes that each correspond to a second user or a concept associated with the online social network.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
determining one or more tags that match at least one of the one or more n-grams of the received first query based on natural-language processing of the received first query.

### Claim 8 (depends on 1)

The method of claim 1, wherein the first query is broadcast by the first user to one or more second users.

### Claim 9 (depends on 8)

The method of claim 8, wherein each of the one or more second users is connected to the first user within a social graph by a threshold degree of separation.

### Claim 10 (depends on 1)

The method of claim 1, wherein the authorized set of ideograms are ranked in an order further based on their respective calculated misspelling-probabilities, wherein each misspelling-probability indicates that at least one of the one or more n-grams of the received first query corresponds to a different n-gram.

### Claim 11 (depends on 1)

The method of claim 1, wherein the authorized set of ideograms are ranked in an order further based on one or more attributes of the first user.

### Claim 12 (depends on 11)

The method of claim 11, wherein the one or more attributes comprise age, gender, cultural background, country of birth, current location, languages spoken, occupation, or any combination thereof.

### Claim 13 (depends on 7)

The method of claim 7, wherein one or more of the tags matching a particular n-gram are dynamically generated using machine learning based on the frequency of use of the respective ideogram associated with the particular n-gram by one or more users of an online social network.

### Claim 14 (depends on 7)

The method of claim 7, wherein one or more of the tags matching a particular n-gram are generated based on sentiment analysis comprising one or more of:
polarity classification;
sentiment classification according to a pre-defined set of emotional states;
subjectivity identification;
objectivity identification; or
feature-based sentiment analysis.

### Claim 15 (depends on 7)

The method of claim 7, wherein one or more of the tags matching a particular n-gram are generated based on one or more categories associated with the respective ideogram associated with the particular n-gram.

### Claim 16 (depends on 1)

The method of claim 1, further comprising:
receiving a request at the client system to access one or more restricted ideograms, wherein the first user is not authorized to access the restricted ideograms; and
presenting instructions for purchasing access to the one or more restricted ideograms at the client system to the first user.

### Claim 17 (depends on 1)

The method of claim 1, wherein the one or more ideograms are presented on a user interface of a native application associated with an online social network at the client system.

### Claim 18 (depends on 1)

The method of claim 1, wherein the one or more selected ideograms are presented on a webpage of an online social network accessed by a browser client of the client system.

### Claim 19

One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access, 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;
receive, at the client system, a first query inputted by the first user, wherein the first query comprises one or more n-grams;
select, based on the first query, one or more of the authorized set of ideograms;
present, 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
receive, at the client system, a selection of one of the presented ideograms.

### Claim 20

A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
access, 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;
receive, at the client system, a first query inputted by the first user, wherein the first query comprises one or more n-grams;
select, based on the first query, one or more of the authorized set of ideograms;
present, 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
receive, at the client system, a selection of one of the presented ideograms.