EP2750056A1 - Structuration des interrogations de recherche structurée ambiguës sur des réseaux sociaux en ligne - Google Patents

Structuration des interrogations de recherche structurée ambiguës sur des réseaux sociaux en ligne Download PDF

Info

Publication number
EP2750056A1
EP2750056A1 EP13197982.5A EP13197982A EP2750056A1 EP 2750056 A1 EP2750056 A1 EP 2750056A1 EP 13197982 A EP13197982 A EP 13197982A EP 2750056 A1 EP2750056 A1 EP 2750056A1
Authority
EP
European Patent Office
Prior art keywords
user
social
query
nodes
structured
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP13197982.5A
Other languages
German (de)
English (en)
Inventor
Yofay Kari Lee
Keith L. Peiris
William R. Maschmeyer
Lars Eilstrup Rasmussen
Joshua Keith Duck
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Meta Platforms Inc
Original Assignee
Facebook Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US13/732,101 external-priority patent/US8868603B2/en
Application filed by Facebook Inc filed Critical Facebook Inc
Priority to PCT/US2013/076590 priority Critical patent/WO2014105640A1/fr
Priority to JP2015550673A priority patent/JP5937280B2/ja
Priority to KR1020167001848A priority patent/KR101780310B1/ko
Priority to CA2895892A priority patent/CA2895892C/fr
Priority to CA2914587A priority patent/CA2914587C/fr
Priority to MX2015008571A priority patent/MX344124B/es
Priority to CN201380074095.5A priority patent/CN105009117B/zh
Priority to KR1020177025118A priority patent/KR101942440B1/ko
Priority to KR1020157020903A priority patent/KR101593191B1/ko
Priority to MX2016016064A priority patent/MX363282B/es
Priority to AU2013370951A priority patent/AU2013370951B2/en
Priority to CN201710213689.XA priority patent/CN107368509B/zh
Priority to BR112015015869A priority patent/BR112015015869A2/pt
Publication of EP2750056A1 publication Critical patent/EP2750056A1/fr
Priority to IL239664A priority patent/IL239664A/en
Priority to JP2016095284A priority patent/JP6130020B2/ja
Priority to IL247790A priority patent/IL247790B/en
Priority to JP2017078726A priority patent/JP6562962B2/ja
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/248—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation
    • G06F16/2423—Interactive query statement specification based on a database schema
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24575—Query processing with adaptation to user needs using context
    • G06Q50/40—

Definitions

  • This disclosure generally relates to social graphs and performing searches for objects within a social-networking environment, in particular to a computer implemented method.
  • a social-networking system which may include a social-networking website, may enable its users (such as persons or organizations) to interact with it and with each other through it.
  • the social-networking system may, with input from a user, create and store in the social-networking system a user profile associated with the user.
  • the user profile may include demographic information, communication-channel information, and information on personal interests of the user.
  • the social-networking system may also, with input from a user, create and store a record of relationships of the user with other users of the social-networking system, as well as provide services (e.g. wall posts, photo-sharing, event organization, messaging, games, or advertisements) to facilitate social interaction between or among users.
  • services e.g. wall posts, photo-sharing, event organization, messaging, games, or advertisements
  • the social-networking system may transmit over one or more networks content or messages related to its services to a mobile or other computing device of a user.
  • a user may also install software applications on a mobile or other computing device of the user for accessing a user profile of the user and other data within the social-networking system.
  • the social-networking system may generate a personalized set of content objects to display to a user, such as a newsfeed of aggregated stories of other users connected to the user.
  • Social-graph analysis views social relationships in terms of network theory consisting of nodes and edges.
  • Nodes represent the individual actors within the networks, and edges represent the relationships between the actors.
  • the resulting graph-based structures are often very complex.
  • a social graph is a map of all of the relevant edges between all the nodes being studied.
  • a social-networking system in response to a text query received from a user, may generate structured queries that include references to particular social-graph elements.
  • the social-networking system may provide a powerful way for users of an online social network to search for elements represented in a social graph based on their social-graph attributes and their relation to various social-graph elements.
  • the social-networking system may parse queries containing ambiguous terms with structured queries.
  • the social-networking system may receive an unstructured text query from a user that contains an ambiguous n-gram.
  • the social-networking system may access a social graph and then parse the text query to identify social-graph elements that corresponded to ambiguous n-grams from the text query.
  • a term in a query may be ambiguous when it possibly matches multiple social-graph elements.
  • the social-networking system may generate a set of structured queries, where each structured query corresponds to one of the possible matching social-graph elements.
  • the querying user may then select among the structured queries to indicate which social-graph element the querying user intended to reference with the ambiguous term.
  • the social-networking system may then effectively lock the ambiguous term to the social-graph element selected by the querying user, and then generate a new set of structured queries based on the selected social-graph element.
  • the social-networking system may generate a set of default structured queries for a page of the online social network.
  • the social-networking system may identify a page that a user is currently viewing or otherwise accessing and then identifying any social-graph elements corresponding to that page.
  • the social-graph elements corresponding to a page may be, for example, the node corresponding to a user- or concept-profile page, or the nodes/edges referenced in a structured query used to generate a particular search-results page.
  • the social-networking system may then generate a set of default structured queries for the page based on the identified social-graph elements for that page. For example, when accessing a user-profile page for the user "Mark", some of the default structured queries for that page may include "Friends of Mark" or "Photos of Mark". These default structured queries may then be transmitted and presented to the user.
  • Embodiments according to the invention are in particular disclosed in the attached claims directed to a method, a storage medium and a system, wherein any feature mentioned in one claim category, e.g. method, can be claimed in another claim category, e.g. system, as well.
  • a method comprises, by a computing device:
  • Receiving from the first user the unstructured text query can comprise receiving one or more characters of a character string as the first user at a client system enters the character string into a graphical user interface.
  • the graphical user interface can comprise a query field, and the character string can be entered by the first user into the query field.
  • the reference to the identified second node or identified edge can be highlighted to indicate the reference corresponds to the ambiguous n-gram.
  • the structured query further can comprise a snippet comprising contextual information about the identified second node or identified edge corresponding to the structured query.
  • the method further can comprise transmitting the first set of structured queries to the first user, wherein each structured query of the first set of structured queries is selectable by the first user to indicate that the identified second node or identified edge referenced in the structured query matches an intent of the user for the ambiguous n-gram.
  • the method further can comprise transmitting the first set of structured queries for presentation to the first user as the first user enters the unstructured text query into a graphical user interface, the presentation of the first set of structured queries to the first user enabling the first user to select the first structured query from the first set of structured queries.
  • the method further can comprise receiving from the first user a selection of a second structured query from the second set of structured queries.
  • the method further can comprise generating one or more search results corresponding to the second structured query.
  • the second structured query further can comprise reference to zero or more additional second nodes of the plurality of second nodes and zero or more additional edges of the plurality of edges, and wherein each search result corresponds to a second node of the plurality of second nodes that is connect to either the selected second node or one of the additional second nodes by one or more of either the selected edge or one of the additional edges.
  • the unstructured text query can be received as a portion of a third structured query, wherein the third structured query comprises:
  • the ambiguous n-gram can comprise one or more characters of text entered by the first user.
  • the ambiguous n-gram can further comprise a contiguous sequence of n items from the unstructured text query.
  • One or more of the structured queries of the second set of structured queries further can comprise references to one or more second nodes of the plurality of second nodes and one or more edges of the plurality of edges.
  • Identifying the plurality of second nodes or the plurality of edges corresponding to the ambiguous n-gram can comprise:
  • the score for each n-gram can be a probability that the n-gram correspond to a second node of the plurality of second nodes or an edge of the plurality of edges.
  • Determining the score that an n-gram corresponds to a second node of the plurality of second nodes can be based on the degree of separation between the first node and the second node.
  • Determining the score for each n-gram can also be based on a search history associated with the first user.
  • one or more computer-readable non-transitory storage media embody software that is operable when executed to:
  • a system comprises: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
  • one or more computer-readable non-transitory storage media embody software that is operable when executed to perform a method according to the invention or any of the above mentioned embodiments.
  • a system comprises: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to perform a method according to the invention or any of the above mentioned embodiments.
  • FIG. 1 illustrates an example network environment 100 associated with a social-networking system.
  • Network environment 100 includes a client system 130, a social-networking system 160, and a third-party system 170 connected to each other by a network 110.
  • FIG. 1 illustrates a particular arrangement of client system 130, social-networking system 160, third-party system 170, and network 110, this disclosure contemplates any suitable arrangement of client system 130, social-networking system 160, third-party system 170, and network 110.
  • two or more of client system 130, social-networking system 160, and third-party system 170 may be connected to each other directly, bypassing network 110.
  • client system 130 may be physically or logically co-located with each other in whole or in part.
  • FIG. 1 illustrates a particular number of client systems 130, social-networking systems 160, third-party systems 170, and networks 110, this disclosure contemplates any suitable number of client systems 130, social-networking systems 160, third-party systems 170, and networks 110.
  • network environment 100 may include multiple client system 130, social-networking systems 160, third-party systems 170, and networks 110.
  • network 110 may include any suitable network 110.
  • one or more portions of network 110 may include an ad hoc network, an intranet, an extranet, a virtual private network (VPN), a local area network (LAN), a wireless LAN (WLAN), a wide area network (WAN), a wireless WAN (WWAN), a metropolitan area network (MAN), a portion of the Internet, a portion of the Public Switched Telephone Network (PSTN), a cellular telephone network, or a combination of two or more of these.
  • Network 110 may include one or more networks 110.
  • Links 150 may connect client system 130, social-networking system 160, and third-party system 170 to communication network 110 or to each other.
  • This disclosure contemplates any suitable links 150.
  • one or more links 150 include one or more wireline (such as for example Digital Subscriber Line (DSL) or Data Over Cable Service Interface Specification (DOCSIS)), wireless (such as for example Wi-Fi or Worldwide Interoperability for Microwave Access (WiMAX)), or optical (such as for example Synchronous Optical Network (SONET) or Synchronous Digital Hierarchy (SDH)) links.
  • wireline such as for example Digital Subscriber Line (DSL) or Data Over Cable Service Interface Specification (DOCSIS)
  • wireless such as for example Wi-Fi or Worldwide Interoperability for Microwave Access (WiMAX)
  • optical such as for example Synchronous Optical Network (SONET) or Synchronous Digital Hierarchy (SDH) links.
  • SONET Synchronous Optical Network
  • SDH Synchronous Digital Hierarchy
  • one or more links 150 each include an ad hoc network, an intranet, an extranet, a VPN, a LAN, a WLAN, a WAN, a WWAN, a MAN, a portion of the Internet, a portion of the PSTN, a cellular technology-based network, a satellite communications technology-based network, another link 150, or a combination of two or more such links 150.
  • Links 150 need not necessarily be the same throughout network environment 100.
  • One or more first links 150 may differ in one or more respects from one or more second links 150.
  • client system 130 may be an electronic device including hardware, software, or embedded logic components or a combination of two or more such components and capable of carrying out the appropriate functionalities implemented or supported by client system 130.
  • a client system 130 may include a computer system such as a desktop computer, notebook or laptop computer, netbook, a tablet computer, e-book reader, GPS device, camera, personal digital assistant (PDA), handheld electronic device, cellular telephone, smartphone, other suitable electronic device, or any suitable combination thereof.
  • PDA personal digital assistant
  • client system 130 may enable a network user at client system 130 to access network 110.
  • a client system 130 may enable its user to communicate with other users at other client systems 130.
  • client system 130 may include a web browser 132, such as MICROSOFT INTERNET EXPLORER, GOOGLE CHROME or MOZILLA FIREFOX, and may have one or more add-ons, plug-ins, or other extensions, such as TOOLBAR or YAHOO TOOLBAR.
  • a user at client system 130 may enter a Uniform Resource Locator (URL) or other address directing the web browser 132 to a particular server (such as server 162, or a server associated with a third-party system 170), and the web browser 132 may generate a Hyper Text Transfer Protocol (HTTP) request and communicate the HTTP request to server.
  • URL Uniform Resource Locator
  • server such as server 162, or a server associated with a third-party system 170
  • HTTP Hyper Text Transfer Protocol
  • the server may accept the HTTP request and communicate to client system 130 one or more Hyper Text Markup Language (HTML) files responsive to the HTTP request.
  • Client system 130 may render a webpage based on the HTML files from the server for presentation to the user.
  • HTML Hyper Text Markup Language
  • This disclosure contemplates any suitable webpage files.
  • webpages may render from HTML files, Extensible Hyper Text Markup Language (XHTML) files, or Extensible Markup Language (XML) files, according to particular needs.
  • Such pages may also execute scripts such as, for example and without limitation, those written in JAVASCRIPT, JAVA, MICROSOFT SILVERLIGHT, combinations of markup language and scripts such as AJAX (Asynchronous JAVASCRIPT and XML), and the like.
  • reference to a webpage encompasses one or more corresponding webpage files (which a browser may use to render the webpage) and vice versa, where appropriate.
  • social-networking system 160 may be a network-addressable computing system that can host an online social network. Social-networking system 160 may generate, store, receive, and transmit social-networking data, such as, for example, user-profile data, concept-profile data, social-graph information, or other suitable data related to the online social network. Social-networking system 160 may be accessed by the other components of network environment 100 either directly or via network 110.
  • social-networking system 160 may include one or more servers 162. Each server 162 may be a unitary server or a distributed server spanning multiple computers or multiple datacenters.
  • Servers 162 may be of various types, such as, for example and without limitation, web server, news server, mail server, message server, advertising server, file server, application server, exchange server, database server, proxy server, another server suitable for performing functions or processes described herein, or any combination thereof.
  • each server 162 may include hardware, software, or embedded logic components or a combination of two or more such components for carrying out the appropriate functionalities implemented or supported by server 162.
  • social-networking system 164 may include one or more data stores 164. Data stores 164 may be used to store various types of information. In particular embodiments, the information stored in data stores 164 may be organized according to specific data structures. In particular embodiments, each data store 164 may be a relational database. Particular embodiments may provide interfaces that enable a client system 130, a social-networking system 160, or a third-party system 170 to manage, retrieve, modify, add, or delete, the information stored in data store 164.
  • social-networking system 160 may store one or more social graphs in one or more data stores 164.
  • a social graph may include multiple nodes - which may include multiple user nodes (each corresponding to a particular user) or multiple concept nodes (each corresponding to a particular concept) - and multiple edges connecting the nodes.
  • Social-networking system 160 may provide users of the online social network the ability to communicate and interact with other users.
  • users may join the online social network via social-networking system 160 and then add connections (i.e., relationships) to a number of other users of social-networking system 160 whom they want to be connected to.
  • the term "friend” may refer to any other user of social-networking system 160 with whom a user has formed a connection, association, or relationship via social-networking system 160.
  • social-networking system 160 may provide users with the ability to take actions on various types of items or objects, supported by social-networking system 160.
  • the items and objects may include groups or social networks to which users of social-networking system 160 may belong, events or calendar entries in which a user might be interested, computer-based applications that a user may use, transactions that allow users to buy or sell items via the service, interactions with advertisements that a user may perform, or other suitable items or objects.
  • a user may interact with anything that is capable of being represented in social-networking system 160 or by an external system of third-party system 170, which is separate from social-networking system 160 and coupled to social-networking system 160 via a network 110.
  • social-networking system 160 may be capable of linking a variety of entities.
  • social-networking system 160 may enable users to interact with each other as well as receive content from third-party systems 170 or other entities, or to allow users to interact with these entities through an application programming interfaces (API) or other communication channels.
  • API application programming interfaces
  • a third-party system 170 may include one or more types of servers, one or more data stores, one or more interfaces, including but not limited to APIs, one or more web services, one or more content sources, one or more networks, or any other suitable components, e.g., that servers may communicate with.
  • a third-party system 170 may be operated by a different entity from an entity operating social-networking system 160.
  • social-networking system 160 and third-party systems 170 may operate in conjunction with each other to provide social-networking services to users of social-networking system 160 or third-party systems 170.
  • social-networking system 160 may provide a platform, or backbone, which other systems, such as third-party systems 170, may use to provide social-networking services and functionality to users across the Internet.
  • a third-party system 170 may include a third-party content object provider.
  • a third-party content object provider may include one or more sources of content objects, which may be communicated to a client system 130.
  • content objects may include information regarding things or activities of interest to the user, such as, for example, movie show times, movie reviews, restaurant reviews, restaurant menus, product information and reviews, or other suitable information.
  • content objects may include incentive content objects, such as coupons, discount tickets, gift certificates, or other suitable incentive objects.
  • social-networking system 160 also includes user-generated content objects, which may enhance a user's interactions with social-networking system 160.
  • User-generated content may include anything a user can add, upload, send, or "post" to social-networking system 160.
  • Posts may include data such as status updates or other textual data, location information, photos, videos, links, music or other similar data or media.
  • Content may also be added to social-networking system 160 by a third-party through a "communication channel,” such as a newsfeed or stream.
  • social-networking system 160 may include a variety of servers, sub-systems, programs, modules, logs, and data stores.
  • social-networking system 160 may include one or more of the following: a web server, action logger, API-request server, relevance-and-ranking engine, content-object classifier, notification controller, action log, third-party-content-object-exposure log, inference module, authorization/privacy server, search module, ad-targeting module, user-interface module, user-profile store, connection store, third-party content store, or location store.
  • Social-networking system 160 may also include suitable components such as network interfaces, security mechanisms, load balancers, failover servers, management-and-network-operations consoles, other suitable components, or any suitable combination thereof.
  • social-networking system 160 may include one or more user-profile stores for storing user profiles.
  • a user profile may include, for example, biographic information, demographic information, behavioral information, social information, or other types of descriptive information, such as work experience, educational history, hobbies or preferences, interests, affinities, or location.
  • Interest information may include interests related to one or more categories. Categories may be general or specific.
  • a connection store may be used for storing connection information about users.
  • the connection information may indicate users who have similar or common work experience, group memberships, hobbies, educational history, or are in any way related or share common attributes.
  • the connection information may also include user-defined connections between different users and content (both internal and external).
  • a web server may be used for linking social-networking system 160 to one or more client systems 130 or one or more third-party system 170 via network 110.
  • the web server may include a mail server or other messaging functionality for receiving and routing messages between social-networking system 160 and one or more client systems 130.
  • An API-request server may allow a third-party system 170 to access information from social-networking system 160 by calling one or more APIs.
  • An action logger may be used to receive communications from a web server about a user's actions on or off social-networking system 160. In conjunction with the action log, a third-party-content-object log may be maintained of user exposures to third-party-content objects.
  • a notification controller may provide information regarding content objects to a client system 130. Information may be pushed to a client system 130 as notifications, or information may be pulled from client system 130 responsive to a request received from client system 130.
  • Authorization servers may be used to enforce one or more privacy settings of the users of social-networking system 160.
  • a privacy setting of a user determines how particular information associated with a user can be shared.
  • the authorization server may allow users to opt in or opt out of having their actions logged by social-networking system 160 or shared with other systems (e.g., third-party system 170), such as, for example, by setting appropriate privacy settings.
  • Third-party-content-object stores may be used to store content objects received from third parties, such as a third-party system 170.
  • Location stores may be used for storing location information received from client systems 130 associated with users.
  • Ad-pricing modules may combine social information, the current time, location information, or other suitable information to provide relevant advertisements, in the form of notifications, to a user.
  • FIG. 2 illustrates example social graph 200.
  • social-networking system 160 may store one or more social graphs 200 in one or more data stores.
  • social graph 200 may include multiple nodes - which may include multiple user nodes 202 or multiple concept nodes 204 - and multiple edges 206 connecting the nodes.
  • Example social graph 200 illustrated in FIG. 2 is shown, for didactic purposes, in a two-dimensional visual map representation.
  • a social-networking system 160, client system 130, or third-party system 170 may access social graph 200 and related social-graph information for suitable applications.
  • the nodes and edges of social graph 200 may be stored as data objects, for example, in a data store (such as a social-graph database).
  • a data store may include one or more searchable or queryable indexes of nodes or edges of social graph 200.
  • a user node 202 may correspond to a user of social-networking system 160.
  • a user may be an individual (human user), an entity (e.g., an enterprise, business, or third-party application), or a group (e.g., of individuals or entities) that interacts or communicates with or over social-networking system 160.
  • social-networking system 160 may create a user node 202 corresponding to the user, and store the user node 202 in one or more data stores.
  • Users and user nodes 202 described herein may, where appropriate, refer to registered users and user nodes 202 associated with registered users.
  • users and user nodes 202 described herein may, where appropriate, refer to users that have not registered with social-networking system 160.
  • a user node 202 may be associated with information provided by a user or information gathered by various systems, including social-networking system 160.
  • a user may provide his or her name, profile picture, contact information, birth date, sex, marital status, family status, employment, education background, preferences, interests, or other demographic information.
  • a user node 202 may be associated with one or more data objects corresponding to information associated with a user.
  • a user node 202 may correspond to one or more webpages.
  • a concept node 204 may correspond to a concept.
  • a concept may correspond to a place (such as, for example, a movie theater, restaurant, landmark, or city); a website (such as, for example, a website associated with social-network system 160 or a third-party website associated with a web-application server); an entity (such as, for example, a person, business, group, sports team, or celebrity); a resource (such as, for example, an audio file, video file, digital photo, text file, structured document, or application) which may be located within social-networking system 160 or on an external server, such as a web-application server; real or intellectual property (such as, for example, a sculpture, painting, movie, game, song, idea, photograph, or written work); a game; an activity; an idea or theory; another suitable concept; or two or more such concepts.
  • a place such as, for example, a movie theater, restaurant, landmark, or city
  • a website such as, for example, a website associated with social-net
  • a concept node 204 may be associated with information of a concept provided by a user or information gathered by various systems, including social-networking system 160.
  • information of a concept may include a name or a title; one or more images (e.g., an image of the cover page of a book); a location (e.g., an address or a geographical location); a website (which may be associated with a URL); contact information (e.g., a phone number or an email address); other suitable concept information; or any suitable combination of such information.
  • a concept node 204 may be associated with one or more data objects corresponding to information associated with concept node 204.
  • a concept node 204 may correspond to one or more webpages.
  • a node in social graph 200 may represent or be represented by a webpage (which may be referred to as a "profile page").
  • Profile pages may be hosted by or accessible to social-networking system 160.
  • Profile pages may also be hosted on third-party websites associated with a third-party server 170.
  • a profile page corresponding to a particular external webpage may be the particular external webpage and the profile page may correspond to a particular concept node 204.
  • Profile pages may be viewable by all or a selected subset of other users.
  • a user node 202 may have a corresponding user-profile page in which the corresponding user may add content, make declarations, or otherwise express himself or herself.
  • a concept node 204 may have a corresponding concept-profile page in which one or more users may add content, make declarations, or express themselves, particularly in relation to the concept corresponding to concept node 204.
  • a concept node 204 may represent a third-party webpage or resource hosted by a third-party system 170.
  • the third-party webpage or resource may include, among other elements, content, a selectable or other icon, or other inter-actable object (which may be implemented, for example, in JavaScript, AJAX, or PHP codes) representing an action or activity.
  • a third-party webpage may include a selectable icon such as "like,” “check in,” “eat,” “recommend,” or another suitable action or activity.
  • a user viewing the third-party webpage may perform an action by selecting one of the icons (e.g., "eat"), causing a client system 130 to transmit to social-networking system 160 a message indicating the user's action.
  • social-networking system 160 may create an edge (e.g., an "eat” edge) between a user node 202 corresponding to the user and a concept node 204 corresponding to the third-party webpage or resource and store edge 206 in one or more data stores.
  • a pair of nodes in social graph 200 may be connected to each other by one or more edges 206.
  • An edge 206 connecting a pair of nodes may represent a relationship between the pair of nodes.
  • an edge 206 may include or represent one or more data objects or attributes corresponding to the relationship between a pair of nodes.
  • a first user may indicate that a second user is a "friend" of the first user.
  • social-networking system 160 may transmit a "friend request" to the second user.
  • social-networking system 160 may create an edge 206 connecting the first user's user node 202 to the second user's user node 202 in social graph 200 and store edge 206 as social-graph information in one or more of data stores 24.
  • social graph 200 includes an edge 206 indicating a friend relation between user nodes 202 of user "A” and user "B” and an edge indicating a friend relation between user nodes 202 of user "C” and user "B.”
  • an edge 206 may represent a friendship, family relationship, business or employment relationship, fan relationship, follower relationship, visitor relationship, subscriber relationship, superior/subordinate relationship, reciprocal relationship, non-reciprocal relationship, another suitable type of relationship, or two or more such relationships.
  • this disclosure generally describes nodes as being connected, this disclosure also describes users or concepts as being connected.
  • references to users or concepts being connected may, where appropriate, refer to the nodes corresponding to those users or concepts being connected in social graph 200 by one or more edges 206.
  • an edge 206 between a user node 202 and a concept node 204 may represent a particular action or activity performed by a user associated with user node 202 toward a concept associated with a concept node 204.
  • a user may "like,” “attended,” “played,” “listened,” “cooked,” “worked at,” or “watched” a concept, each of which may correspond to a edge type or subtype.
  • a concept-profile page corresponding to a concept node 204 may include, for example, a selectable "check in” icon (such as, for example, a clickable "check in” icon) or a selectable "add to favorites” icon.
  • social-networking system 160 may create a "favorite” edge or a "check in” edge in response to a user's action corresponding to a respective action.
  • a user user “C” may listen to a particular song (“Imagine") using a particular application (SPOTIFY, which is an online music application).
  • social-networking system 160 may create a "listened” edge 206 and a "used” edge (as illustrated in FIG. 2 ) between user nodes 202 corresponding to the user and concept nodes 204 corresponding to the song and application to indicate that the user listened to the song and used the application.
  • social-networking system 160 may create a "played" edge 206 (as illustrated in FIG. 2 ) between concept nodes 204 corresponding to the song and the application to indicate that the particular song was played by the particular application.
  • "played" edge 206 corresponds to an action performed by an external application (SPOTIFY) on an external audio file (the song "Imagine”).
  • SPOTIFY an external application
  • this disclosure describes particular edges 206 with particular attributes connecting user nodes 202 and concept nodes 204, this disclosure contemplates any suitable edges 206 with any suitable attributes connecting user nodes 202 and concept nodes 204.
  • edges between a user node 202 and a concept node 204 representing a single relationship
  • this disclosure contemplates edges between a user node 202 and a concept node 204 representing one or more relationships.
  • an edge 206 may represent both that a user likes and has used at a particular concept.
  • another edge 206 may represent each type of relationship (or multiples of a single relationship) between a user node 202 and a concept node 204 (as illustrated in FIG. 2 between user node 202 for user "E” and concept node 204 for "SPOTIFY").
  • social-networking system 160 may create an edge 206 between a user node 202 and a concept node 204 in social graph 200.
  • a user viewing a concept-profile page (such as, for example, by using a web browser or a special-purpose application hosted by the user's client system 130) may indicate that he or she likes the concept represented by the concept node 204 by clicking or selecting a "Like" icon, which may cause the user's client system 130 to transmit to social-networking system 160 a message indicating the user's liking of the concept associated with the concept-profile page.
  • social-networking system 160 may create an edge 206 between user node 202 associated with the user and concept node 204, as illustrated by "like" edge 206 between the user and concept node 204.
  • social-networking system 160 may store an edge 206 in one or more data stores.
  • an edge 206 may be automatically formed by social-networking system 160 in response to a particular user action. As an example and not by way of limitation, if a first user uploads a picture, watches a movie, or listens to a song, an edge 206 may be formed between user node 202 corresponding to the first user and concept nodes 204 corresponding to those concepts.
  • this disclosure describes forming particular edges 206 in particular manners, this disclosure contemplates forming any suitable edges 206 in any suitable manner.
  • an advertisement may be text (which may be HTML-linked), one or more images (which may be HTML-linked), one or more videos, audio, one or more ADOBE FLASH files, a suitable combination of these, or any other suitable advertisement in any suitable digital format presented on one or more webpages, in one or more e-mails, or in connection with search results requested by a user).
  • an advertisement may be one or more sponsored stories (e.g. a news-feed or ticker item on social-networking system 160).
  • a sponsored story may be a social action by a user (such as “liking” a page, “liking” or commenting on a post on a page, RSVPing to an event associated with a page, voting on a question posted on a page, checking in to a place, using an application or playing a game, or "liking" or sharing a website) that an advertiser promotes by, for example, having the social action presented within a pre-determined area of a profile page of a user or other page, presented with additional information associated with the advertiser, bumped up or otherwise highlighted within news feeds or tickers of other users, or otherwise promoted. The advertiser may pay to have the social action promoted.
  • an advertisement may be requested for display within social-networking-system webpages, third-party webpages, or other pages.
  • An advertisement may be displayed in a dedicated portion of a page, such as in a banner area at the top of the page, in a column at the side of the page, in a GUI of the page, in a pop-up window, in a drop-down menu, in an input field of the page, over the top of content of the page, or elsewhere with respect to the page.
  • an advertisement may be displayed within an application.
  • An advertisement may be displayed within dedicated pages, requiring the user to interact with or watch the advertisement before the user may access a page or utilize an application. The user may, for example view the advertisement through a web browser.
  • a user may interact with an advertisement in any suitable manner.
  • the user may click or otherwise select the advertisement.
  • the user may be directed to (or a browser or other application being used by the user) a page associated with the advertisement.
  • the user may take additional actions, such as purchasing a product or service associated with the advertisement, receiving information associated with the advertisement, or subscribing to a newsletter associated with the advertisement.
  • An advertisement with audio or video may be played by selecting a component of the advertisement (like a "play button").
  • the social-networking system 160 may execute or modify a particular action of the user.
  • advertisements may be included among the search results of a search-results page, where sponsored content is promoted over non-sponsored content.
  • advertisements may be included among suggested search query, where suggested queries that reference the advertiser or its content/products may be promoted over non-sponsored queries.
  • An advertisement may include social-networking-system functionality that a user may interact with. For example, an advertisement may enable a user to "like" or otherwise endorse the advertisement by selecting an icon or link associated with endorsement. As another example, an advertisement may enable a user to search (e.g., by executing a query) for content related to the advertiser. Similarly, a user may share the advertisement with another user (e.g. through social-networking system 160) or RSVP (e.g. through social-networking system 160) to an event associated with the advertisement.
  • an advertisement may include social-networking-system context directed to the user. For example, an advertisement may display information about a friend of the user within social-networking system 160 who has taken an action associated with the subject matter of the advertisement.
  • one or more client-side and/or backend (server-side) processes may implement and utilize a "typeahead" feature that may automatically attempt to match social-graph elements (e.g., user nodes 202, concept nodes 204, or edges 206) to information currently being entered by a user in an input form rendered in conjunction with a requested webpage (such as, for example, a user-profile page, a concept-profile page, a search-results webpage, or another suitable page of the online social network), which may be hosted by or accessible in the social-networking system 160.
  • a "typeahead” feature may automatically attempt to match social-graph elements (e.g., user nodes 202, concept nodes 204, or edges 206) to information currently being entered by a user in an input form rendered in conjunction with a requested webpage (such as, for example, a user-profile page, a concept-profile page, a search-results webpage, or another suitable page of the online social network), which may be hosted by or accessible in the social
  • the typeahead feature may attempt to match the string of textual characters being entered in the declaration to strings of characters (e.g., names, descriptions) corresponding to user, concepts, or edges and their corresponding elements in the social graph 200.
  • strings of characters e.g., names, descriptions
  • the typeahead feature may automatically populate the form with a reference to the social-graph element (such as, for example, the node name/type, node ID, edge name/type, edge ID, or another suitable reference or identifier) of the existing social-graph element.
  • the typeahead process may work in conjunction with one or more frontend (client-side) and/or backend (server-side) typeahead processes (hereinafter referred to simply as "typeahead process") executing at (or within) the social-networking system 160 (e.g., within servers 162), to interactively and virtually instantaneously (as appearing to the user) attempt to auto-populate the form with a term or terms corresponding to names of existing social-graph elements, or terms associated with existing social-graph elements, determined to be the most relevant or best match to the characters of text entered by the user as the user enters the characters of text.
  • client-side frontend
  • server-side server-side typeahead processes
  • the typeahead processes in conjunction with the information from the social-graph database, as well as potentially in conjunction with various others processes, applications, or databases located within or executing within social-networking system 160, may be able to predict a user's intended declaration with a high degree of precision.
  • the social-networking system 160 can also provides user's with the freedom to enter essentially any declaration they wish, enabling users to express themselves freely.
  • the typeahead processes may attempt to identify existing social-graph elements (e.g., user nodes 202, concept nodes 204, or edges 206) that match the string of characters entered in the user's declaration as the user is entering the characters.
  • the typeahead process may read the string of entered textual characters. As each keystroke is made, the frontend-typeahead process may transmit the entered character string as a request (or call) to the backend-typeahead process executing within social-networking system 160.
  • the typeahead processes may communicate via AJAX (Asynchronous JavaScript and XML) or other suitable techniques, and particularly, asynchronous techniques.
  • the request may be, or comprise, an XMLHTTPRequest (XHR) enabling quick and dynamic sending and fetching of results.
  • the typeahead process may also transmit before, after, or with the request a section identifier (section ID) that identifies the particular section of the particular page in which the user is making the declaration.
  • a user ID parameter may also be sent, but this may be unnecessary in some embodiments, as the user may already be "known” based on the user having logged into (or otherwise been authenticated by) the social-networking system 160.
  • the typeahead process may use one or more matching algorithms to attempt to identify matching social-graph elements.
  • the typeahead process may transmit a response (which may utilize AJAX or other suitable techniques) to the user's client system 130 that may include, for example, the names (name strings) or descriptions of the matching social-graph elements as well as, potentially, other metadata associated with the matching social-graph elements.
  • the typeahead process may display a drop-down menu that displays names of matching existing profile pages and respective user nodes 202 or concept nodes 204, such as a profile page named or devoted to "poker” or "pokemon", which the user can then click on or otherwise select thereby confirming the desire to declare the matched user or concept name corresponding to the selected node.
  • the typeahead process may auto-populate, or causes the web browser 132 to auto-populate, the query field with the declaration "poker".
  • the typeahead process may simply auto-populate the field with the name or other identifier of the top-ranked match rather than display a drop-down menu.
  • the user may then confirm the auto-populated declaration simply by keying "enter” on his or her keyboard or by clicking on the auto-populated declaration.
  • FIG. 3 illustrates an example webpage of an online social network.
  • a user may submit a query to the social-network system 160 by inputting text into query field 350.
  • a user of an online social network may search for information relating to a specific subject matter (e.g., users, concepts, external content or resource) by providing a short phrase describing the subject matter, often referred to as a "search query," to a search engine.
  • the query may be an unstructured text query and may comprise one or more text strings (which may include one or more n-grams).
  • a user may input any character string into query field 350 to search for content on the social-networking system 160 that matches the text query.
  • the social-networking system 160 may then search a data store 164 (or, in particular, a social-graph database) to identify content matching the query.
  • the search engine may conduct a search based on the query phrase using various search algorithms and generate search results that identify resources or content (e.g., user-profile pages, content-profile pages, or external resources) that are most likely to be related to the search query.
  • resources or content e.g., user-profile pages, content-profile pages, or external resources
  • search engine may identify one or more resources that are likely to be related to the search query, each of which may individually be referred to as a "search result,” or collectively be referred to as the "search results" corresponding to the search query.
  • the identified content may include, for example, social-graph elements (i.e., user nodes 202, concept nodes 204, edges 206), profile pages, external webpages, or any combination thereof.
  • the social-networking system 160 may then generate a search-results webpage with search results corresponding to the identified content and transmit the search-results webpage to the user.
  • the search results may be presented to the user, often in the form of a list of links on the search-results webpage, each link being associated with a different webpage that contains some of the identified resources or content.
  • each link in the search results may be in the form of a Uniform Resource Locator (URL) that specifies where the corresponding webpage is located and the mechanism for retrieving it.
  • URL Uniform Resource Locator
  • the social-networking system 160 may then transmit the search-results webpage to the web browser 132 on the user's client system 130.
  • the user may then click on the URL links or otherwise select the content from the search-results webpage to access the content from the social-networking system 160 or from an external system (such as, for example, a third-party system 170), as appropriate.
  • the resources may be ranked and presented to the user according to their relative degrees of relevance to the search query.
  • the search results may also be ranked and presented to the user according to their relative degree of relevance to the user. In other words, the search results may be personalized for the querying user based on, for example, social-graph information, user information, search or browsing history of the user, or other suitable information related to the user.
  • ranking of the resources may be determined by a ranking algorithm implemented by the search engine.
  • resources that are more relevant to the search query or to the user may be ranked higher than the resources that are less relevant to the search query or the user.
  • the search engine may limit its search to resources and content on the online social network.
  • the search engine may also search for resources or contents on other sources, such as a third-party system 170, the internet or World Wide Web, or other suitable sources.
  • the typeahead processes described herein may be applied to search queries entered by a user.
  • a typeahead process may attempt to identify one or more user nodes 202, concept nodes 204, or edges 206 that match the string of characters entered search field as the user is entering the characters.
  • the typeahead process may perform or causes to be performed a search to identify existing social-graph elements (i.e., user nodes 202, concept nodes 204, edges 206) having respective names, types, categories, or other identifiers matching the entered text.
  • the typeahead process may use one or more matching algorithms to attempt to identify matching nodes or edges. When a match or matches are found, the typeahead process may transmit a response to the user's client system 130 that may include, for example, the names (name strings) of the matching nodes as well as, potentially, other metadata associated with the matching nodes.
  • the typeahead process may then display a drop-down menu 300 that displays names of matching existing profile pages and respective user nodes 202 or concept nodes 204, and displays names of matching edges 206 that may connect to the matching user nodes 202 or concept nodes 204, which the user can then click on or otherwise select thereby confirming the desire to search for the matched user or concept name corresponding to the selected node, or to search for users or concepts connected to the matched users or concepts by the matching edges.
  • the typeahead process may simply auto-populate the form with the name or other identifier of the top-ranked match rather than display a drop-down menu 300. The user may then confirm the auto-populated declaration simply by keying "enter" on a keyboard or by clicking on the auto-populated declaration.
  • the typeahead process may transmit a request that informs the social-networking system 160 of the user's confirmation of a query containing the matching social-graph elements.
  • the social-networking system 160 may automatically (or alternately based on an instruction in the request) call or otherwise search a social-graph database for the matching social-graph elements, or for social-graph elements connected to the matching social-graph elements as appropriate.
  • particular embodiments may utilize one or more systems, components, elements, functions, methods, operations, or steps disclosed in U.S. Patent Application No. 11/503093, filed 11 August 2006 , U.S. Patent Application No. 12/977027, filed 22 December 2010 , and U.S. Patent Application No. 12/978265, filed 23 December 2010 , which are incorporated by reference.
  • FIGs. 4A-4H illustrate example queries of the social network.
  • the social-networking system 160 may parse the text query and identify portions of the text query that correspond to particular social-graph elements.
  • a query may include one or more terms that are ambiguous, where an ambiguous term is a term that may possibly correspond to multiple social-graph elements.
  • the social-networking system 160 may access a social graph 200 and then parse the text query to identify the social-graph elements that corresponded to ambiguous n-grams from the text query.
  • the social-networking system 160 may then generate a set of structured queries, where each structured query corresponds to one of the possible matching social-graph elements. These structured queries may be based on strings generated by a grammar model, such that they are rendered in a natural-language syntax with references to the relevant social-graph elements. These structured queries may be presented to the querying user, who can then select among the structured queries to indicate which social-graph element the querying user intended to reference with the ambiguous term. In response to the querying user's selection, the social-networking system 160 may then lock the ambiguous term in the query to the social-graph element selected by the querying user, and then generate a new set of structured queries based on the selected social-graph element. FIGs.
  • 4A-4H illustrate various example text queries in query field 350 and various structured queries generated in response in drop-down menus 300 (although other suitable graphical user interfaces are possible).
  • the social-networking system 160 may provide a powerful way for users of the online social network to search for elements represented in the social graph 200 based on their social-graph attributes and their relation to various social-graph elements.
  • Structured queries may allow a querying user to search for content that is connected to particular users or concepts in the social graph 200 by particular edge-types.
  • the structured queries may be transmitted to the first user and displayed in a drop-down menu 300 (via, for example, a client-side typeahead process), where the first user can then select an appropriate query to search for the desired content.
  • Some of the advantages of using the structured queries described herein include finding users of the online social network based upon limited information, bringing together virtual indexes of content from the online social network based on the relation of that content to various social-graph elements, or finding content related to you and/or your friends.
  • FIGs. 4A-4H illustrate generating particular structured queries in a particular manner, this disclosure contemplates generating any suitable structured queries in any suitable manner.
  • the social-networking system 160 may receive from a querying/first user (corresponding to a first user node 202) an unstructured text query.
  • a first user may want to search for other users who: (1) are first-degree friends of the first user; and (2) are associated with Stanford University (i.e., the user nodes 202 are connected by an edge 206 to the concept node 204 corresponding to the school "Stanford”).
  • the first user may then enter a text query "friends stanford” into query field 350, as illustrated in FIGs. 4A-4B .
  • the social-networking system 160 may provide various suggested structured queries, as illustrated in drop-down menus 300.
  • an unstructured text query refers to a simple text string inputted by a user.
  • the text query may, of course, be structured with respect to standard language/grammar rules (e.g. English language grammar). However, the text query will ordinarily be unstructured with respect to social-graph elements. In other words, a simple text query will not ordinarily include embedded references to particular social-graph elements.
  • a structured query refers to a query that contains references to particular social-graph elements, allowing the search engine to search based on the identified elements.
  • the text query may be unstructured with respect to formal query syntax.
  • a simple text query will not necessarily be in the format of a query command that is directly executable by a search engine (e.g., the text query "friends stanford” could be parsed to form the query command "intersect(school(Stanford University), friends(me)", which could be executed as a query in a social-graph database).
  • a search engine e.g., the text query "friends stanford” could be parsed to form the query command "intersect(school(Stanford University), friends(me)”, which could be executed as a query in a social-graph database.
  • social-networking system 160 may parse the unstructured text query (also simply referred to as a search query) received from the first user (i.e., the querying user) to identify one or more n-grams.
  • an n-gram is a contiguous sequence of n items from a given sequence of text or speech.
  • the items may be characters, phonemes, syllables, letters, words, base pairs, prefixes, or other identifiable items from the sequence of text or speech.
  • the n-gram may comprise one or more characters of text (letters, numbers, punctuation, etc.) entered by the querying user.
  • n-gram of size one can be referred to as a "unigram,” of size two can be referred to as a “bigram” or “digram,” of size three can be referred to as a "trigram,” and so on.
  • Each n-gram may include one or more parts from the text query received from the querying user.
  • each n-gram may comprise a character string (e.g., one or more characters of text) entered by the first user.
  • the social-networking system 160 may parse the text query "friends stanford” to identify the following n-grams: friends; stanford; friends stanford.
  • the social-networking system 160 may parse the text query "friends in palo alto" to identify the following n-grams: friends; in; palo; alto; friends in; in palo; palo alto; friend in palo; in palo also; friends in palo alto.
  • each n-gram may comprise a contiguous sequence of n items from the text query.
  • social-networking system 160 may identify a plurality of nodes or a plurality of edges corresponding to one or more of the n-grams of a text query. Identifying social-graph elements that correspond to an n-gram may be done in a variety of manners, such as, for example, by determining or calculating, for each n-gram identified in the text query, a score that the n-gram corresponds to a social-graph element.
  • the score may be, for example, a confidence score, a probability, a quality, a ranking, another suitable type of score, or any combination thereof.
  • the social-networking system 160 may determine a probability score (also referred to simply as a "probability") that the n-gram corresponds to a social-graph element, such as a user node 202, a concept node 204, or an edge 206 of social graph 200.
  • the probability score may indicate the level of similarity or relevance between the n-gram and a particular social-graph element.
  • There may be many different ways to calculate the probability The present disclosure contemplates any suitable method to calculate a probability score for an n-gram identified in a search query.
  • the social-networking system 160 may determine a probability, p, that an n-gram corresponds to a particular social-graph element.
  • the n-gram "stanford” corresponds to multiple social-graph elements, it may be considered an ambiguous n-gram by the social-networking system 160.
  • the n-gram is not immediately resolvable to a single social-graph element based on the parsing algorithm used by the social-networking system 160.
  • the social-networking system 160 may highlight that n-gram in the text query to indicate that it may correspond to multiple social-graph elements.
  • the term "Stanford" in query field 350 has been highlighted with a dashed-underline to indicate that it may correspond to multiple social-graph elements, as discussed previously.
  • the term "facebook" has been highlighted with a dashed-underline to indicate that it may correspond to multiple social-graph elements.
  • this disclosure describes determining whether n-grams correspond to social-graph elements in a particular manner, this disclosure contemplates determining whether n-grams correspond to social-graph elements in any suitable manner.
  • this disclosure describes determining whether an n-gram corresponds to a social-graph element using a particular type of score, this disclosure contemplates determining whether an n-gram corresponds to a social-graph element using any suitable type of score.
  • the social-networking system 160 may determine the probability that a particular n-gram corresponds to a social-graph element based social-graph information.
  • the calculation of the probability may also factor in social-graph information.
  • the probability that an n-gram corresponds to a particular node may be based on the degree of separation between the first user node 202 and the particular node.
  • a particular n-gram may have a higher probability of corresponding to a social-graph element that is closer in the social graph 200 to the querying user (i.e., fewer degrees of separation between the element and the first user node 202) than a social-graph element that is further from the user (i.e., more degrees of separation).
  • the calculated probability that this corresponds to the concept node 204 for the recipe “Chicken Parmesan,” which is connected to user “B” by an edge 206, may be higher than the calculated probability that this n-gram corresponds to other nodes associated with the n-gram chicken (e.g., concept nodes 204 corresponding to "chicken nuggets,” or “funky chicken dance") that are not connected to user "B" in the social graph 200.
  • the probability that an n-gram corresponds to a particular node may be based on the search history associated with the querying user.
  • Social-graph elements that the querying user has previously accessed, or are relevant to the social-graph elements that the querying user has previously accessed, may be more likely to be the target of the querying user's search query.
  • the social-networking system 160 may determine that the concept node 204 for "Facebook Culinary Team" has a relatively higher probability of corresponding to the n-gram "facebook” because the querying user has previously accessed that concept node 204 (and may in fact already be connected to that node with a "viewed" edge 206).
  • social-networking system 160 may identify one or more edges 206 having a probability greater than an edge-threshold probability. Each of the identified edges 206 may correspond to at least one of the n-grams. As an example and not by way of limitation, the n-gram may only be identified as corresponding to an edge, k, if p i,j,k > p edge-threshold . In particular embodiments, the social-networking system 160 may identify a plurality of edges 206 (or edge types) as corresponding to a particular n-gram.
  • the n-gram may be considered an ambiguous n-gram by the social-networking system 160 because multiple edges have a probability, p t,j,k , that is greater than p edge-threshold .
  • edge-threshold probability is equal to 0.25, then the edge-types corresponding to "work at” and “worked at” may be identified because they have probabilities greater than the edge-threshold probability, while the edge-type corresponding to "lives in” would not be identified because its probability is not greater than the edge-threshold probability. Consequently, because the social-networking system 160 identified multiple edge-types as corresponding to the n-gram "work", that n-gram may be considered ambiguous.
  • each of the identified edges 206 may be connected to at least one of the identified nodes.
  • the social-networking system 160 may only identify edges 206 or edge-types that are connected to user nodes 202 or concept nodes 204 that have previously been identified as corresponding to a particular n-gram.
  • this disclosure describes identifying edges 206 that correspond to n-grams in a particular manner, this disclosure contemplates identifying edges 206 that correspond to n-grams in any suitable manner.
  • social-networking system 160 may identify one or more user nodes 202 or concept nodes 204 having a probability greater than a node-threshold probability. Each of the identified nodes may correspond to at least one of the n-grams. As an example and not by way of limitation, the n-gram may only be identified as corresponding to a node, k, if p t,j,k > p node-threshold . In particular embodiments, the social-networking system 160 may identify a plurality of edges 206 (or edge types) as corresponding to a particular n-gram.
  • the n-gram may be considered an ambiguous n-gram by the social-networking system 160 because multiple edges have a probability, p i,j,k that is greater than p edge-threshold .
  • each of the identified user nodes 202 or concept nodes 204 may be connected to at least one of the identified edges 206.
  • the social-networking system 160 may only identify nodes or nodes-types that are connected to edges 206 that have previously been identified as corresponding to a particular n-gram. In particular embodiments, the social-networking system 160 may only identify nodes that are within a threshold degree of separation of the user node 202 corresponding to the first user (i.e., the querying user). The threshold degree of separation may be, for example, one, two, three, or all. Although this disclosure describes identifying nodes that correspond to n-grams in a particular manner, this disclosure contemplates identifying nodes that correspond to n-grams in any suitable manner.
  • the social-networking system 160 may access a context-free grammar model comprising a plurality of grammars.
  • Each grammar of the grammar model may comprise one or more non-terminal tokens (or "non-terminal symbols") and one or more terminal tokens (or "terminal symbols"/"query tokens"), where particular non-terminal tokens may be replaced by terminal tokens.
  • a grammar model is a set of formation rules for strings in a formal language.
  • the social-networking system 160 may generate one or more strings using one or more grammars.
  • To generate a string in the language one begins with a string consisting of only a single start symbol. The production rules are then applied in any order, until a string that contains neither the start symbol nor designated non-terminal symbols is produced.
  • the production of each non-terminal symbol of the grammar is independent of what is produced by other non-terminal symbols of the grammar.
  • the non-terminal symbols may be replaced with terminal symbols (i.e., terminal tokens or query tokens). Some of the query tokens may correspond to identified nodes or identified edges, as described previously.
  • a string generated by the grammar may then be used as the basis for a structured query containing references to the identified nodes or identified edges.
  • the string generated by the grammar may be rendered in a natural-language syntax, such that a structured query based on the string is also rendered in natural language.
  • a context-free grammar is a grammar in which the left-hand side of each production rule consists of only a single non-terminal symbol.
  • a probabilistic context-free grammar is a tuple ⁇ ,N,S,P ⁇ , where the disjoint sets ⁇ and N specify the terminal and non-terminal symbols, respectively, with S ⁇ N being the start symbol.
  • the sum of probabilities p over all expansions of a given non-terminal E must be one.
  • the social-networking system 160 may generate one or more structured queries.
  • the structured queries may be based on the natural-language strings generated by one or more grammars, as described previously.
  • Each structured query may include references to one or more of the identified nodes or one or more of the identified edges 206.
  • This type of structured query may allow the social-networking system 160 to more efficiently search for resources and content related to the online social network (such as, for example, profile pages) by searching for content connected to or otherwise related to the identified user nodes 202 and the identified edges 206.
  • the social-networking system 160 may generate a structured query "Friends of Stephanie,” where "Friends” and “Stephanie” in the structured query are references corresponding to particular social-graph elements.
  • the reference to “Stephanie” would correspond to a particular user node 202 (where the social-networking system 160 has parsed the n-gram "my girlfriend" to correspond with a user node 202 for the user "Stephanie"), while the reference to "Friends” would correspond to friend-type edges 206 connecting that user node 202 to other user nodes 202 (i.e., edges 206 connecting to "Stephanie's" first-degree friends).
  • the social-networking system 160 may identify one or more user nodes 202 connected by friend-type edges 206 to the user node 202 corresponding to "Stephanie".
  • the social-networking system 160 may generate a structured query "Friends who like Facebook,” where "Friends," “like,” and "Facebook” in the structured query are references corresponding to particular social-graph elements as described previously (i.e., a friend-type edge 206, a like-type edge 206, and concept node 204 corresponding to the company "Facebook").
  • this disclosure describes generating particular structured queries in a particular manner, this disclosure contemplates generating any suitable structured queries in any suitable manner.
  • social-networking system 160 may rank the generated structured queries.
  • the structured queries may be ranked based on a variety of factors. Where the text query received from the querying user contains an ambiguous n-gram, the suggested structured queries generated in response to that text query may be ranked, for example, in order of the probability or likelihood that the identified nodes/edges referenced in those structured queries match the intent of the querying user, as determined by the social-networking system 160.
  • the social-networking system 160 may then transmit only those structured queries having a rank greater than a threshold rank (e.g., the top seven ranked queries may be transmitted to the querying user and displayed in a drop-down menu 300).
  • the rank for a structured query may be based on the degree of separation between the user node 202 of the querying user and the particular social-graph elements referenced in the structured query.
  • Structured queries that reference social-graph elements that are closer in the social graph 200 to the querying user i.e., fewer degrees of separation between the element and the querying user's user node 202
  • the social-networking system 160 may rank the structured queries based on a search history associated with the querying user.
  • Structured queries that reference social-graph elements that the querying user has previously accessed, or are relevant to the social-graph elements the querying user has previously accessed, may be more likely to be the target of the querying user's search query. Thus, these structured queries may be ranked more highly. As an example and not by way of limitation, if querying user has previously visited the "Stanford University" profile page but has never visited the "Stanford, California" profile page, when determining the rank for structured queries referencing these concepts, the social-networking system 160 may determine that the structured query referencing the concept node 204 for "Stanford University" has a relatively high rank because the querying user has previously accessed the concept node 204 for the school.
  • the social-networking system 160 may rank the structured queries based on advertising sponsorship.
  • An advertiser such as, for example, the user or administrator of a particular profile page corresponding to a particular node
  • the social-networking system 160 may generate a set of structured queries, where each structured query in this set corresponds to an identified node or identified edge corresponding to the ambiguous n-gram.
  • each of these structured queries may comprise a reference to the corresponding identified node or identified edge.
  • the social-networking system 160 may generate at least one structured query referencing the identified node or identified edge.
  • these structured queries may be presented to the querying user, who can then select among the structured queries to indicate which social-graph element the querying user intended to reference with the ambiguous term.
  • the social-networking system 160 may then lock the ambiguous term in the query to the social-graph element selected by the querying user, and then generate a new set of structured queries based on the selected social-graph element.
  • the social-networking system 160 may generate a set of structured queries, where each structured query references a social-graph entity corresponding to one of the identified concept nodes 204 that correspond to the ambiguous n-gram "facebook".
  • the set of structured queries includes references to "Facebook”, “Facebook Culinary Team”, and “Facebook Camera”, among others, each of which may have been identified by the social-networking system 160 as possibly corresponding to the ambiguous n-gram "facebook" from the received text query.
  • the querying user may then select one of the structured queries to select the particular concept referenced in the structured query and thereby lock the structured query to the concept node 204 corresponding to the selected concept. For example, if the querying user selected the first suggested structured query from the drop-down menu 300 illustrated in FIG. 4C , "People who like Facebook", then the social-networking system 160 may generate a new set of structured queries based on this selection, as illustrated in FIG.
  • a structured query may include a snippet of contextual information about one or more of the social-graph elements referenced in the structured query.
  • the snippet may provide contextual information about the identified node or identified edge corresponding to the ambiguous n-gram that is referenced in a particular structured query.
  • the snippet included with the structured query may be presented to the querying user (e.g., inline with the structured query in drop-down menu 300) to help aid the user determine whether the referenced social-graph element matches with the user's intent.
  • snippets may be included automatically with a structured query.
  • a snippet of contextual information may be automatically included with each structured query.
  • a snippet may be included with a structured query when the querying user interacts with the structured query.
  • the structured queries are initially presented to the querying user, a snippet may not be necessarily included with each structured query. Instead, the snippet for a particular structured query may be presented to the querying user after the user interacts with the structured query, such as, for example, by mousing over, focusing on, or otherwise interacting with the structured query.
  • the social-networking system 160 in response to the text query "people who like facebook” in query field 350 (which contains the ambiguous term “facebook”), the social-networking system 160 has generated structured queries referencing the concept nodes 204 corresponding to the company "Facebook", the group “Facebook Culinary Team”, among others, which are presented to the user in drop-down menu 300.
  • the querying user has focused on the structured query "People who like Facebook”, and in response a snippet reading "Product/Service-81,431,771 like this" has been generated next to the structured query, where this snippet provides contextual information about the referenced concept node 204 for the company "Facebook", indicating that it corresponds to a "Product/Service”.
  • this snippet provides contextual information about the referenced like-type edge 206, indicating that "81,431,771 like this" (i.e., that number of user nodes 202 are connected to the concept node 204 for "Facebook" by a like-type edge 206).
  • this disclosure illustrates and describes generating particular snippets for structured queries in a particular manner, this disclosure contemplates generating any suitable snippets for structured queries in any suitable manner.
  • social-networking system 160 may transmit one or more of the structured queries to the querying user.
  • the social-networking system 160 may transmit one or more of the structured queries as a response (which may utilize AJAX or other suitable techniques) to the user's client system 130 that may include, for example, the names (name strings) of the referenced social-graph elements, other query limitations (e.g., Boolean operators, etc.), as well as, potentially, other metadata associated with the referenced social-graph elements.
  • the web browser 132 on the querying user's client system 130 may display the transmitted structured queries in a drop-down menu 300, as illustrated in FIGs. 4A-4H .
  • the transmitted structured queries may be selectable by the querying user to indicate that the identified node or identified edges reference in the structured query match an intent of the user for the ambiguous n-gram.
  • the social-networking system 160 may generate the set of structured queries illustrated in drop-down menu 300.
  • These structured queries include references to the concept nodes 204 corresponding to "Facebook”, “Facebook Culinary Team”, and “Facebook Camera”, among others, each of which may have been identified by the social-networking system 160 as possibly corresponding to the ambiguous n-gram "facebook" from the received text query.
  • the querying user may then select one of these structured queries to select the particular concept referenced in the structured query and thereby lock the ambiguous n-gram "facebook" to the concept node 204 corresponding to the selected structured query.
  • the transmitted queries may be presented to the querying user in a ranked order, such as, for example, based on a rank previously determined as described above. Structured queries with better rankings may be presented in a more prominent position.
  • only structured queries above a threshold rank may be transmitted or displayed to the querying user.
  • the structured queries may be presented to the querying user in a drop-down menu 300 where higher ranked structured queries may be presented at the top of the menu, with lower ranked structured queries presented in descending order down the menu.
  • FIGs. 4A-4H only the seven highest ranked queries are transmitted and displayed to the user.
  • one or more references in a structured query may be highlighted (e.g., outlined, underlined, circled, bolded, italicized, colored, lighted, offset, in caps) in order to indicate its correspondence to a particular social-graph element.
  • the references to “Stanford University” and “Stanford, California” are highlighted (outlined) in the structured queries to indicate that it corresponds to a particular concept node 204.
  • the references to "Friends", “like”, “work at”, and “go to” in the structured queries presented in drop-down menu 300 could also be highlighted to indicate that they correspond to particular edges 206.
  • social-networking system 160 may receive from the querying user a selection of one of the structured queries.
  • the nodes and edges referenced in the received structured query may be referred to as the selected nodes and selected edges, respectively.
  • the querying user may be indicating that the node or edges referenced in the selected structured query match the intent of the user for the ambiguous n-gram.
  • the web browser 132 on the querying user's client system 130 may display the transmitted structured queries in a drop-down menu 300, as illustrated in FIGs.
  • the querying user may then click on or otherwise select (e.g., by simply keying "enter” on his keyboard) to indicate the particular structured query the user wants the social-networking system 160 to execute.
  • the querying user may thereby lock the ambiguous n-gram to the social-graph element corresponding to the selected structured query.
  • the querying user may be inputted the unstructured text query "friends who like facebook” into query field 350, where the term "facebook" in the text query has been identified as an ambiguous n-gram. If the querying user selects the second suggested structured query from the drop-down menu 300 illustrated in FIG.
  • the social-networking system 160 may lock the ambiguous n-gram "facebook” from the text query to the concept node 204 for "Facebook Culinary Team” and generate a new set of structured queries based on this selection (i.e., a new set of structured queries that reference the concept node 204 for "Facebook Culinary Team"). Furthermore, upon selecting the particular structured query, the user's client system 130 may call or otherwise instruct to the social-networking system 160 to execute the selected structured query.
  • this disclosure describes receiving selections of particular structured queries in a particular manner, this disclosure contemplates receiving selections of any suitable structured queries in any suitable manner.
  • the social-networking system 160 may generate a new set of structured queries based on the selection.
  • the selected structured query may comprise a reference to one of the identified nodes or identified edges corresponding to the ambiguous n-gram. These identified nodes or identified edges may be referred to at the selected nodes or selected edges, indicating that the particular social-graph element referenced in the structured query selected by the querying user represents a social-graph element that the querying user specifically intended to select.
  • the structured queries of this new set may comprise reference to the selected node or selected edge, and may further comprise reference to zero or more additional nodes and zero or more additional edges.
  • the suggested structured queries generated by the social-networking system 160 may expanded off of the user's selection, where the querying user effectively selects the base of the query to use for generating more complex queries.
  • the drop-down menu 300 illustrated in FIG. 4D shows a set of structured queries generated in response to the querying user's selection of the suggested structured query "People who like Facebook” from FIG. 4C .
  • the suggested structured query "People who like Facebook” corresponded to the concept node 204 for the company "Facebook”, which had been identified as a concept node 204 that corresponded to the ambiguous n-gram "facebook" from the unstructured text query in query field 350 of FIG. 4C .
  • the social-networking system 160 After selecting this structured query, the ambiguous n-gram "facebook" was locked to the concept node 204 for the company "Facebook” and the social-networking system 160 then generated a new set of structured queries that referenced this concept node 204, along with additional social-graph elements.
  • the selected structured query may also be used to replace the unstructured text query previously received in the query field 350. For example, once the querying user selected the structured query "People who like Facebook" from the drop-down menu 300 in FIG. 4C , that selected structured query may replace the original text query, and the social-networking system 160 may auto-populate the query field 350 with the selected structured query, as illustrated in FIG. 4D , where the query field 350 is now populated with the previously selected structured query.
  • the querying user may then continue to input text into query field 350 to further modify the query, for example, by adding a text string before, into, or after the structured query that has been populated into the query field 350.
  • the structured query may be further refined by the querying user.
  • the processes described above may be repeated in response to the input of additional ambiguous n-grams.
  • the social-networking system 160 may parse the unstructured text query portion of a query that has been inputted into query field 350.
  • FIG. 5 illustrates an example method 500 for disambiguating terms in text queries to generate structured search queries.
  • the method may begin at step 510, where the social-networking system 160 may access a social graph 200 comprising a plurality of nodes and a plurality of edges 206 connecting the nodes.
  • the nodes may comprise a first user node 202 and a plurality of second nodes (one or more user nodes 202, concepts nodes 204, or any combination thereof).
  • the social-networking system 160 may receive from the first user an unstructured text query that comprises an ambiguous n-gram.
  • the social-networking system 160 may a plurality of second nodes or a plurality of edges corresponding to the ambiguous n-gram.
  • the social-networking system 160 may identify two different nodes that match the ambiguous n-gram from the text query.
  • the social-networking system 160 may generate a first set of structured queries. Each of these structured queries may correspond to an identified second node or identified edge, and each structure query may include a reference to that identified second node or identified edge.
  • the social-networking system 160 may generate one structured query with a reference to a particular node and another structured query with a reference to another node, where both nodes possibly match the ambiguous n-gram.
  • the social-networking system 160 may receive from the first user a selection of a first structured query from the first set of structured queries.
  • the first structured query may correspond to a selected second node or selected edge from the identified second nodes or identified edges, respectively.
  • the social-networking system 160 may generate a second set of structured queries.
  • Each structured query of the second set of structured queries may comprise a reference to the selected second node or selected edge.
  • the social-networking system 160 may generate a new set of structured queries that takes into account the disambiguated n-gram.
  • Particular embodiments may repeat one or more steps of the method of FIG. 5 , where appropriate.
  • this disclosure describes and illustrates particular steps of the method of FIG. 5 as occurring in a particular order, this disclosure contemplates any suitable steps of the method of FIG. 5 occurring in any suitable order. Moreover, although this disclosure describes and illustrates particular components, devices, or systems carrying out particular steps of the method of FIG. 5 , this disclosure contemplates any suitable combination of any suitable components, devices, or systems carrying out any suitable steps of the method of FIG. 5 .
  • FIGs. 6A-6F illustrate example webpages of an online social network.
  • the social-networking system 160 may generate a set of default structured queries for a page of the online social network.
  • the social-networking system 160 may identify a page that a user is currently viewing or otherwise accessing and then identifying any social-graph elements corresponding to that page.
  • the social-graph elements corresponding to a page may be, for example, the node corresponding to a user- or concept-profile page, or the nodes/edges referenced in a structured query used to generate a particular search-results page.
  • the social-networking system 160 may then generate a set of default structured queries for the page based on the identified social-graph elements for that page.
  • some of the default structured queries for that page may include "Friends of Mark” or "Photos of Mark", as illustrated in drop-down menu 300, where each of these structured queries includes a reference to the user node 202 of the user "Mark”.
  • the generated default structured queries may then be transmitted to the user and displayed, for example, in a drop-down menu 300.
  • the query field 350 may also serve as the title bar for the page. In other words, the title bar and query field 350 may effectively be a unified field on a particular page.
  • the title bar for a page of the online social network may include a reference to the social-graph elements that correspond to that page.
  • the title bar across the top of the page includes the name of the concept corresponding to that page, "Barack Obama”.
  • the title bar across the top of the page includes the structured query used to generate the page, "Current Facebook employees”. This title bar may also server as a query field 350 for the page.
  • a user accessing that page may then interact with the title of the page (e.g., by mousing over the title, clicking on it, or otherwise interacting with it), to input a query.
  • the social-networking system 160 may then generate a set of default structured queries for the page and automatically transmit and display these queries in a drop-down menu 300 on the page, as illustrated in FIG. 6B , where the drop-down menu 300 is displayed in association with the query field 350.
  • this disclosure describes generating default queries for a page in a particular manner, this disclosure contemplates generating default queries for a page in any suitable manner.
  • the social-networking system 160 may identify a node of the social-graph 200 corresponding to a page currently accessed by a user.
  • a user may access any suitable page, such as, for example, a user-profile page, a concept-profile page, a search-results page, a homepage, a newsfeed page, an email or messages page, or another suitable page of the online social network.
  • Particular pages of the online social network may correspond to particular social-graph elements.
  • the user may currently be accessing a profile page of the online social network corresponding to a particular user node 202 or concept node 204.
  • Each user of the online social network may have a user-profile page that corresponds to a user node 202 of the user.
  • FIGs. 6A-6B which illustrate a user-profile page for the user "Mark”
  • this page may correspond to a user node 202 of the user "Mark”.
  • each concept represented in the online social network may have a concept-profile page that corresponds to a concept node 204 representing that concept.
  • FIGs. 6C-6D which illustrate a concept-profile page for the politician "Barack Obama”
  • this page may correspond to a concept node 204 representing the politician "Barack Obama” (note, of course, that Barack Obama may also have a personal user-profile page).
  • the user may currently be accessing a search-results page corresponding to a structured query.
  • the structured query may comprise references to one or more nodes and one or more edges, and the search-results page may have been generated in response to this structured query.
  • one or more of the nodes referenced in the structured query may be identified by the social-networking system 160 as being the nodes corresponding to the page. As an example and not by way of limitation, referencing FIGs.
  • the social-networking system 160 may identify the concept node 204 corresponding to the company "Facebook" as being the node corresponding to this search-results page.
  • this disclosure describes identifying particular nodes corresponding to particular pages in a particular manner, this disclosure contemplates identifying any suitable nodes corresponding to any suitable pages in any suitable manner.
  • the social-networking system 160 may generate one or more structured queries that each comprise a reference to the identified node(s) of the page currently accessed by a user. These generated structured queries may be considered the default structured queries for the page. Each of these structured queries may also comprise references to one or more edges that are connected to the identified node. These default structured queries are effectively based on and reference the page currently being accessed by the user. Where the title bar and the query field 350 field are unified fields, as described previously, the social-networking system 160 may essentially use the title of the page (which itself may be considered a reference to one or more social-graph elements) as a template query upon which query modifications are added to generate the default structured queries. As an example and not by way of limitation, referencing FIG.
  • the title of the page is "Barack Obama", where this title is unified with the query field 350, such that a user may interact with the title to immediately bring up a drop-down menu 300 with a set of default queries for the page that reference the page the user is interacting with (i.e., the suggested default queries contain references to the concept-node 204 associated with the concept "Barack Obama").
  • the default structured queries generated by the social-networking system 160 may comprises references to the social-graph elements referenced in the structured query used to generate that search-results page.
  • the default structured queries generated for that page will also include at least references to the one or more nodes and one or more edges of the original structured query.
  • the structured query used to generate a particular search-results page may be used as the base upon which expansions of that initial query may be suggested as default queries.
  • the title of the page is "Current Facebook employees", where this title is also a structured query that was used to generate the search-results page and has now been populated into query field 350.
  • the social-networking system 160 may generate a set of default structured queries based on the original structure query, where each of the default structured queries is effectively a modification of the original query "Current Facebook employees". For example, in the example illustrated in FIG.
  • the social-networking system 160 has generated the suggested default structured queries "Current Facebook employees who live in Austin, Texas” (which references the additional social-graph elements of a live-in-type edge 206 and a concept node 204 for "Austin, Texas") and "Current Facebook employees who like Old Pro” (which references the additional social-graph elements of a like-type edge 206 and a concept node 204 for "Old Pro), where each of these references the social-graph elements from the original structured query as well as additional social-graph elements that are modifications of the original query.
  • this disclosure describes generating particular default structured queries in a particular manner, this disclosure contemplates any suitable default structured queries in any suitable manner.
  • this disclosure describes generating default structured queries for particular types of pages, this disclosure contemplates generating default structured queries for any suitable types of pages.
  • the social-networking system 160 may transmit one or more of the default structured queries to the querying user for display on the page currently accessed by the user. These structured queries may be transmitted and displayed as previously described.
  • the web browser 132 on the querying user's client system 130 may display the transmitted structured queries in a drop-down menu 300 in association with a query field 350 of a webpage, as illustrated in FIGs. 6B , 6D , and 6F .
  • the default structured queries generated for a particular page may not be displayed until the user interacts with the query field 350, such as, for example, by mousing over or clicking on the query field 350, which may cause the structured queries to be transmitted and displayed in drop-down menu 300.
  • the structured queries displayed in drop-down menu 300 may enable the user accessing the page to selected one of the structured queries, indicating that the selected structured query should be executed by the social-networking system 160.
  • this disclosure describes transmitting particular default structured queries in a particular manner, this disclosure contemplates transmitting any suitable default structured queries in any suitable manner.
  • the social-networking system 160 may generate one or more default structured queries in response to a user accessing a page that does not correspond to a particular social-graph element.
  • a user may access a page of the online social network that does not necessarily correspond to any particular social-graph element (such as, for example, a newsfeed page, which may not necessarily correspond to any particular nodes or edges of the social graph 200).
  • the page may be considered to be in a "null state" with respect to identifying social-graph elements that correspond to the page.
  • the user accessing that page may place the query field 350 of the page into a null state by, for example, clearing or deleting any title or query that that had previously occupied the field.
  • the social-networking system 160 may generate a set of default structured queries for the page based on a variety of factors, such as, for example, the type of page the user is accessing, the query history of the user, the general or current popularity of particular queries, the usefulness of particular queries, other suitable factors, or any combination thereof. These default structured queries may be pre-generated and accessed from a cache or generated dynamically in response to input from the user.
  • the social-networking system 160 may access a set of default structured queries corresponding to the page.
  • Each of these default structured queries may comprise references to one or more edges 206 (or edge-types) or one or more nodes (or node-types).
  • FIG. 3 illustrates a newsfeed page being accessed by a user of the online social network.
  • Some of the default structured queries for this page may include "Friends of" or "People who like", as illustrated in drop-down menu 300, where these structured queries included references to friend-type edges 206 and like-type edges 206, respectively.
  • FIG. 1 illustrates a newsfeed page being accessed by a user of the online social network.
  • the default structured queries contain ellipses to indicate that the user may input text into the query field 350 to complete the query.
  • the social-networking system 160 may generate default structured queries that include "My friends", "Photos of my friends", “Photos I like", or "Apps my friends use”, where these structured queries include reference to both edges and nodes (e.g., for the structured query "My friends", the term “My” is a reference to the user node 202 of the querying user and the term “friends" is a reference to friend-type edges 206 connected to that node).
  • this disclosure describes generating default structured queries for a page that does not correspond to particular social-graph elements in a particular manner, this disclosure contemplates generating default structured queries for a page that does not correspond to particular social-graph elements in any suitable manner.
  • FIG. 7 illustrates an example method 700 for generating default structured search queries for a page.
  • the method may begin at step 710, where the social-networking system 160 may access a social graph 200 comprising a plurality of nodes and a plurality of edges 206 connecting the nodes.
  • the nodes may comprise a first user node 202 and a plurality of second nodes (one or more user nodes 202, concepts nodes 204, or any combination thereof).
  • the social-networking system 160 may identify a node of the plurality of nodes corresponding to a page currently accessed by the first user.
  • the page may be, for example, a user-profile page, a concept-profile page, a search-results page, or another suitable page of the online social network.
  • the social-networking system 160 may generate one or more structured queries. Each of these structured queries may reference the identified node corresponding to the page currently accessed by the first user. The structured queries may also reference one or more edges of the plurality of edges that are connected to the identified node.
  • the social-networking system 160 may transmit one or more of the structured queries to the first user for display on the page. These may be considered the default structured queries for the page, which have been determined based on the social-graph elements associated with the page. Particular embodiments may repeat one or more steps of the method of FIG.
  • the social-networking system 160 may generate one or more search results, where each search result matches (or substantially matches) the terms of the structured query.
  • the social-networking system 160 may receive a structured query from a querying user (also referred to as the "first user", corresponding to a first user node 202).
  • the social-networking system 160 may generate one or more search results corresponding to the structured query.
  • Each search result may include link to a profile page and a description or summary of the profile page (or the node corresponding to that page).
  • the search results may be presented and transmitted to the querying user as a search-results page.
  • FIG. 6E illustrates an example search-results page generated in response to a particular structured query.
  • the structured query used to generate a particular search-results page is shown in query field 350, and the various search results generated in response to the structured query are illustrated in a field for presented search results.
  • the query field 350 may also serve as the title bar for the page.
  • the title bar and query field 350 may effectively be a unified field on the search-results page.
  • FIG. 6E illustrates a search-results page with the structured query "Current Facebook employees" in query field 350.
  • This structured query also effectively serves as the title for the generated page, where the page shows a plurality search results of users of the online social network who are employees at the company "Facebook".
  • the search-results page may also include a field for modifying search results and a field for providing suggested searches.
  • the social-networking system 160 may generate one or more snippets for each search result, where the snippets are contextual information about the target of the search result (i.e., contextual information about the social-graph entity, profile page, or other content corresponding to the particular search result).
  • this disclosure describes and illustrates particular search-results pages, this disclosure contemplates any suitable search-results pages.
  • FIG. 8 illustrates an example computer system 800.
  • one or more computer systems 800 perform one or more steps of one or more methods described or illustrated herein.
  • one or more computer systems 800 provide functionality described or illustrated herein.
  • software running on one or more computer systems 800 performs one or more steps of one or more methods described or illustrated herein or provides functionality described or illustrated herein.
  • Particular embodiments include one or more portions of one or more computer systems 800.
  • reference to a computer system may encompass a computing device, and vice versa, where appropriate.
  • reference to a computer system may encompass one or more computer systems, where appropriate.
  • computer system 800 may be an embedded computer system, a system-on-chip (SOC), a single-board computer system (SBC) (such as, for example, a computer-on-module (COM) or system-on-module (SOM)), a desktop computer system, a laptop or notebook computer system, an interactive kiosk, a mainframe, a mesh of computer systems, a mobile telephone, a personal digital assistant (PDA), a server, a tablet computer system, or a combination of two or more of these.
  • SOC system-on-chip
  • SBC single-board computer system
  • COM computer-on-module
  • SOM system-on-module
  • computer system 800 may include one or more computer systems 800; be unitary or distributed; span multiple locations; span multiple machines; span multiple data centers; or reside in a cloud, which may include one or more cloud components in one or more networks.
  • one or more computer systems 800 may perform without substantial spatial or temporal limitation one or more steps of one or more methods described or illustrated herein.
  • one or more computer systems 800 may perform in real time or in batch mode one or more steps of one or more methods described or illustrated herein.
  • One or more computer systems 800 may perform at different times or at different locations one or more steps of one or more methods described or illustrated herein, where appropriate.
  • computer system 800 includes a processor 802, memory 804, storage 806, an input/output (I/O) interface 808, a communication interface 810, and a bus 812.
  • I/O input/output
  • this disclosure describes and illustrates a particular computer system having a particular number of particular components in a particular arrangement, this disclosure contemplates any suitable computer system having any suitable number of any suitable components in any suitable arrangement.
  • processor 802 includes hardware for executing instructions, such as those making up a computer program.
  • processor 802 may retrieve (or fetch) the instructions from an internal register, an internal cache, memory 804, or storage 806; decode and execute them; and then write one or more results to an internal register, an internal cache, memory 804, or storage 806.
  • processor 802 may include one or more internal caches for data, instructions, or addresses. This disclosure contemplates processor 802 including any suitable number of any suitable internal caches, where appropriate.
  • processor 802 may include one or more instruction caches, one or more data caches, and one or more translation lookaside buffers (TLBs).
  • TLBs translation lookaside buffers
  • Instructions in the instruction caches may be copies of instructions in memory 804 or storage 806, and the instruction caches may speed up retrieval of those instructions by processor 802.
  • Data in the data caches may be copies of data in memory 804 or storage 806 for instructions executing at processor 802 to operate on; the results of previous instructions executed at processor 802 for access by subsequent instructions executing at processor 802 or for writing to memory 804 or storage 806; or other suitable data.
  • the data caches may speed up read or write operations by processor 802.
  • the TLBs may speed up virtual-address translation for processor 802.
  • processor 802 may include one or more internal registers for data, instructions, or addresses. This disclosure contemplates processor 802 including any suitable number of any suitable internal registers, where appropriate. Where appropriate, processor 802 may include one or more arithmetic logic units (ALUs); be a multi-core processor; or include one or more processors 802. Although this disclosure describes and illustrates a particular processor, this disclosure contemplates any suitable processor.
  • ALUs
  • memory 804 includes main memory for storing instructions for processor 802 to execute or data for processor 802 to operate on.
  • computer system 800 may load instructions from storage 806 or another source (such as, for example, another computer system 800) to memory 804.
  • Processor 802 may then load the instructions from memory 804 to an internal register or internal cache.
  • processor 802 may retrieve the instructions from the internal register or internal cache and decode them.
  • processor 802 may write one or more results (which may be intermediate or final results) to the internal register or internal cache.
  • Processor 802 may then write one or more of those results to memory 804.
  • processor 802 executes only instructions in one or more internal registers or internal caches or in memory 804 (as opposed to storage 806 or elsewhere) and operates only on data in one or more internal registers or internal caches or in memory 804 (as opposed to storage 806 or elsewhere).
  • One or more memory buses (which may each include an address bus and a data bus) may couple processor 802 to memory 804.
  • Bus 812 may include one or more memory buses, as described below.
  • one or more memory management units reside between processor 802 and memory 804 and facilitate accesses to memory 804 requested by processor 802.
  • memory 804 includes random access memory (RAM).
  • This RAM may be volatile memory, where appropriate Where appropriate, this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, where appropriate, this RAM may be single-ported or multi-ported RAM. This disclosure contemplates any suitable RAM.
  • Memory 804 may include one or more memories 804, where appropriate. Although this disclosure describes and illustrates particular memory, this disclosure contemplates any suitable memory.
  • storage 806 includes mass storage for data or instructions.
  • storage 806 may include a hard disk drive (HDD), a floppy disk drive, flash memory, an optical disc, a magneto-optical disc, magnetic tape, or a Universal Serial Bus (USB) drive or a combination of two or more of these.
  • Storage 806 may include removable or non-removable (or fixed) media, where appropriate.
  • Storage 806 may be internal or external to computer system 800, where appropriate.
  • storage 806 is non-volatile, solid-state memory.
  • storage 806 includes read-only memory (ROM).
  • this ROM may be mask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM), or flash memory or a combination of two or more of these.
  • This disclosure contemplates mass storage 806 taking any suitable physical form.
  • Storage 806 may include one or more storage control units facilitating communication between processor 802 and storage 806, where appropriate. Where appropriate, storage 806 may include one or more storages 806. Although this disclosure describes and illustrates particular storage, this disclosure contemplates any suitable storage.
  • I/O interface 808 includes hardware, software, or both, providing one or more interfaces for communication between computer system 800 and one or more I/O devices.
  • Computer system 800 may include one or more of these I/O devices, where appropriate.
  • One or more of these I/O devices may enable communication between a person and computer system 800.
  • an I/O device may include a keyboard, keypad, microphone, monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet, touch screen, trackball, video camera, another suitable I/O device or a combination of two or more of these.
  • An I/O device may include one or more sensors. This disclosure contemplates any suitable I/O devices and any suitable I/O interfaces 808 for them.
  • I/O interface 808 may include one or more device or software drivers enabling processor 802 to drive one or more of these I/O devices.
  • I/O interface 808 may include one or more I/O interfaces 808, where appropriate.
  • communication interface 810 includes hardware, software, or both providing one or more interfaces for communication (such as, for example, packet-based communication) between computer system 800 and one or more other computer systems 800 or one or more networks.
  • communication interface 810 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wire-based network or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network, such as a WI-FI network.
  • NIC network interface controller
  • WNIC wireless NIC
  • WI-FI network wireless network
  • computer system 800 may communicate with an ad hoc network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), or one or more portions of the Internet or a combination of two or more of these.
  • PAN personal area network
  • LAN local area network
  • WAN wide area network
  • MAN metropolitan area network
  • computer system 800 may communicate with a wireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, a cellular telephone network (such as, for example, a Global System for Mobile Communications (GSM) network), or other suitable wireless network or a combination of two or more of these.
  • Computer system 800 may include any suitable communication interface 810 for any of these networks, where appropriate.
  • Communication interface 810 may include one or more communication interfaces 810, where appropriate.
  • bus 812 includes hardware, software, or both coupling components of computer system 800 to each other.
  • bus 812 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT) interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBAND interconnect, a low-pin-count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCIe) bus, a serial advanced technology attachment (SATA) bus, a Video Electronics Standards Association local (VLB) bus, or another suitable bus or a combination of two or more of these.
  • Bus 812 may include one or more buses 812, where appropriate.
  • a computer-readable non-transitory storage medium or media may include one or more semiconductor-based or other integrated circuits (ICs) (such, as for example, field-programmable gate arrays (FPGAs) or application-specific ICs (ASICs)), hard disk drives (HDDs), hybrid hard drives (HHDs), optical discs, optical disc drives (ODDs), magneto-optical discs, magneto-optical drives, floppy diskettes, floppy disk drives (FDDs), magnetic tapes, solid-state drives (SSDs), RAM-drives, SECURE DIGITAL cards or drives, any other suitable computer-readable non-transitory storage media, or any suitable combination of two or more of these, where appropriate.
  • ICs such, as for example, field-programmable gate arrays (FPGAs) or application-specific ICs (ASICs)
  • HDDs hard disk drives
  • HHDs hybrid hard drives
  • ODDs optical disc drives
  • magneto-optical discs magneto-optical drives
  • an apparatus or system or a component of an apparatus or system being adapted to, arranged to, capable of, configured to, enabled to, operable to, or operative to perform a particular function encompasses that apparatus, system, component, whether or not it or that particular function is activated, turned on, or unlocked, as long as that apparatus, system, or component is so adapted, arranged, capable, configured, enabled, operable, or operative.
EP13197982.5A 2012-12-31 2013-12-18 Structuration des interrogations de recherche structurée ambiguës sur des réseaux sociaux en ligne Ceased EP2750056A1 (fr)

Priority Applications (17)

Application Number Priority Date Filing Date Title
BR112015015869A BR112015015869A2 (pt) 2012-12-31 2013-12-19 consultas de pesquisa estruturadas ambíguas em redes sociais online
KR1020157020903A KR101593191B1 (ko) 2012-12-31 2013-12-19 온라인 소셜 네트워크에서 불명확한 구조화된 검색 질의
MX2016016064A MX363282B (es) 2012-12-31 2013-12-19 Consultas de busqueda estructuradas ambiguas en redes sociales en linea.
KR1020167001848A KR101780310B1 (ko) 2012-12-31 2013-12-19 온라인 소셜 네트워크에서 불명확한 구조화된 검색 질의
CA2895892A CA2895892C (fr) 2012-12-31 2013-12-19 Interrogations de recherche structurees ambigues sur des reseaux sociaux en ligne
CA2914587A CA2914587C (fr) 2012-12-31 2013-12-19 Interrogations de recherche structurees ambigues sur des reseaux sociaux en ligne
MX2015008571A MX344124B (es) 2012-12-31 2013-12-19 Consultas de busqueda estructuradas ambiguas en redes sociales en linea.
CN201380074095.5A CN105009117B (zh) 2012-12-31 2013-12-19 在线社交网络中的模糊结构化搜索查询
KR1020177025118A KR101942440B1 (ko) 2012-12-31 2013-12-19 온라인 소셜 네트워크에서 불명확한 구조화된 검색 질의
PCT/US2013/076590 WO2014105640A1 (fr) 2012-12-31 2013-12-19 Interrogations de recherche structurées ambiguës sur des réseaux sociaux en ligne
JP2015550673A JP5937280B2 (ja) 2012-12-31 2013-12-19 オンライン・ソーシャル・ネットワーク上のあいまいな構造化検索クエリ
AU2013370951A AU2013370951B2 (en) 2012-12-31 2013-12-19 Ambiguous structured search queries on online social networks
CN201710213689.XA CN107368509B (zh) 2012-12-31 2013-12-19 通信方法、通信系统及计算机可读非暂时性存储介质
IL239664A IL239664A (en) 2012-12-31 2015-06-25 Multivariate structured search queries on online social networks
JP2016095284A JP6130020B2 (ja) 2012-12-31 2016-05-11 オンライン・ソーシャル・ネットワーク上のあいまいな構造化検索クエリ
IL247790A IL247790B (en) 2012-12-31 2016-09-13 Ambiguous structured search queries in online social networks
JP2017078726A JP6562962B2 (ja) 2012-12-31 2017-04-12 オンライン・ソーシャル・ネットワーク上のあいまいな構造化検索クエリ

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US13/732,101 US8868603B2 (en) 2010-04-19 2012-12-31 Ambiguous structured search queries on online social networks

Publications (1)

Publication Number Publication Date
EP2750056A1 true EP2750056A1 (fr) 2014-07-02

Family

ID=49911216

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13197982.5A Ceased EP2750056A1 (fr) 2012-12-31 2013-12-18 Structuration des interrogations de recherche structurée ambiguës sur des réseaux sociaux en ligne

Country Status (10)

Country Link
EP (1) EP2750056A1 (fr)
JP (3) JP5937280B2 (fr)
KR (3) KR101593191B1 (fr)
CN (2) CN107368509B (fr)
AU (3) AU2013370951B2 (fr)
BR (1) BR112015015869A2 (fr)
CA (2) CA2895892C (fr)
IL (2) IL239664A (fr)
MX (2) MX363282B (fr)
WO (1) WO2014105640A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110516146A (zh) * 2019-07-15 2019-11-29 中国科学院计算机网络信息中心 一种基于异质图卷积神经网络嵌入的作者名字消歧方法

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10230677B2 (en) 2015-11-23 2019-03-12 International Business Machines Corporation Identifying an entity associated with an online communication
EP3188038B1 (fr) * 2015-12-31 2020-11-04 Dassault Systèmes Évaluation d'un ensemble d'entraînement
US10437810B2 (en) 2016-09-30 2019-10-08 Microsoft Technology Licensing, Llc Systems and methods for maintaining cardinality schema to prevent corruption in databases indifferent to cardinality
CN108829858B (zh) * 2018-06-22 2021-09-17 京东数字科技控股有限公司 数据查询方法、装置及计算机可读存储介质
KR20200054360A (ko) * 2018-11-05 2020-05-20 삼성전자주식회사 전자 장치 및 그 제어 방법
CN111105276A (zh) * 2019-12-26 2020-05-05 北京金山安全软件有限公司 一种数据上报方法、装置、电子设备及存储介质

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120059708A1 (en) * 2010-08-27 2012-03-08 Adchemy, Inc. Mapping Advertiser Intents to Keywords

Family Cites Families (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100459832B1 (ko) 1995-04-10 2005-06-02 리버스 테크놀로지, 인크. N-그램워드(n-gramword)분해원리를이용하여이식가능한문서를인덱싱하는시스템및방법
US20050131872A1 (en) * 2003-12-16 2005-06-16 Microsoft Corporation Query recognizer
US7529657B2 (en) 2004-09-24 2009-05-05 Microsoft Corporation Configurable parameters for grammar authoring for speech recognition and natural language understanding
US8027943B2 (en) 2007-08-16 2011-09-27 Facebook, Inc. Systems and methods for observing responses to invitations by users in a web-based social network
US7702685B2 (en) * 2006-01-20 2010-04-20 Microsoft Corporation Querying social networks
US7840538B2 (en) * 2006-12-20 2010-11-23 Yahoo! Inc. Discovering query intent from search queries and concept networks
US8214883B2 (en) 2007-10-22 2012-07-03 Microsoft Corporation Using social networks while respecting access control lists
WO2009117104A1 (fr) * 2008-03-17 2009-09-24 Fuhu, Inc. Moteur de recherche social, système et procédé
JP5054593B2 (ja) * 2008-03-27 2012-10-24 日本電信電話株式会社 情報検索装置及びプログラム
US8027990B1 (en) * 2008-07-09 2011-09-27 Google Inc. Dynamic query suggestion
US20100235354A1 (en) * 2009-03-12 2010-09-16 International Business Machines Corporation Collaborative search engine system
US20100250526A1 (en) * 2009-03-27 2010-09-30 Prochazka Filip Search System that Uses Semantic Constructs Defined by Your Social Network
JP5314504B2 (ja) * 2009-06-01 2013-10-16 日本電信電話株式会社 検索装置、検索プログラムおよび検索方法
US20110004692A1 (en) * 2009-07-01 2011-01-06 Tom Occhino Gathering Information about Connections in a Social Networking Service
US8239364B2 (en) * 2009-12-08 2012-08-07 Facebook, Inc. Search and retrieval of objects in a social networking system
US8631004B2 (en) * 2009-12-28 2014-01-14 Yahoo! Inc. Search suggestion clustering and presentation
US8180804B1 (en) 2010-04-19 2012-05-15 Facebook, Inc. Dynamically generating recommendations based on social graph information
US9990429B2 (en) * 2010-05-14 2018-06-05 Microsoft Technology Licensing, Llc Automated social networking graph mining and visualization
US8380723B2 (en) * 2010-05-21 2013-02-19 Microsoft Corporation Query intent in information retrieval
US20120078713A1 (en) * 2010-09-23 2012-03-29 Sony Corporation System and method for effectively providing targeted information to a user community
EP2633444A4 (fr) * 2010-10-30 2017-06-21 International Business Machines Corporation Transformation de requêtes de moteurs de recherche
US9411890B2 (en) * 2012-04-04 2016-08-09 Google Inc. Graph-based search queries using web content metadata

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120059708A1 (en) * 2010-08-27 2012-03-08 Adchemy, Inc. Mapping Advertiser Intents to Keywords

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
RENAUD DELBRU ET AL: "Searching web data: An entity retrieval and high-performance indexing model", WEB SEMANTICS: SCIENCE, SERVICES AND AGENTS ON THE WORLD WIDE WEB, vol. 10, 13 May 2011 (2011-05-13), pages 33 - 58, XP055093888, ISSN: 1570-8268, DOI: 10.1016/j.websem.2011.04.004 *
SEBASTIAN MARIUS KIRSCH ET AL: "Beyond the Web: Retrieval in Social Information Spaces", 1 January 2006, ADVANCES IN INFORMATION RETRIEVAL LECTURE NOTES IN COMPUTER SCIENCE;;LNCS, SPRINGER, BERLIN, DE, PAGE(S) 84 - 95, ISBN: 978-3-540-33347-0, XP019030207 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110516146A (zh) * 2019-07-15 2019-11-29 中国科学院计算机网络信息中心 一种基于异质图卷积神经网络嵌入的作者名字消歧方法
CN110516146B (zh) * 2019-07-15 2022-08-19 中国科学院计算机网络信息中心 一种基于异质图卷积神经网络嵌入的作者名字消歧方法

Also Published As

Publication number Publication date
KR101780310B1 (ko) 2017-09-21
CA2914587C (fr) 2018-06-12
JP2016503920A (ja) 2016-02-08
IL239664A0 (en) 2015-08-31
KR20160017103A (ko) 2016-02-15
JP2016173841A (ja) 2016-09-29
AU2013370951A1 (en) 2015-08-06
CA2895892A1 (fr) 2014-07-03
IL247790B (en) 2018-07-31
AU2016238826A1 (en) 2016-10-27
MX363282B (es) 2019-03-19
KR20150094785A (ko) 2015-08-19
JP6562962B2 (ja) 2019-08-21
KR101942440B1 (ko) 2019-01-25
JP2017123199A (ja) 2017-07-13
MX2015008571A (es) 2016-01-20
AU2017200341A1 (en) 2017-02-09
BR112015015869A2 (pt) 2017-07-11
AU2013370951B2 (en) 2016-09-08
JP5937280B2 (ja) 2016-06-22
CA2895892C (fr) 2016-02-23
CN105009117B (zh) 2017-03-29
KR101593191B1 (ko) 2016-02-11
WO2014105640A1 (fr) 2014-07-03
MX344124B (es) 2016-12-05
AU2016238826B2 (en) 2016-12-01
KR20170105128A (ko) 2017-09-18
CN105009117A (zh) 2015-10-28
CN107368509A (zh) 2017-11-21
JP6130020B2 (ja) 2017-05-17
CN107368509B (zh) 2018-10-26
IL239664A (en) 2016-09-29
CA2914587A1 (fr) 2014-07-03
AU2017200341B2 (en) 2018-03-22

Similar Documents

Publication Publication Date Title
US10614084B2 (en) Default suggested queries on online social networks
US10282377B2 (en) Suggested terms for ambiguous search queries
US9946772B2 (en) Search queries with previews of search results on online social networks
US9753995B2 (en) Generating default search queries on online social networks
US9852444B2 (en) Sponsored search queries on online social networks
US9589011B2 (en) Dynamic suggested search queries on online social networks
US9679080B2 (en) Grammar model for structured search queries
US9275119B2 (en) Sharing search queries on online social network
AU2017200341B2 (en) Suggested terms for ambiguous search queries
US10402419B1 (en) Search queries with previews of search results on online social networks

Legal Events

Date Code Title Description
17P Request for examination filed

Effective date: 20131218

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

R17P Request for examination filed (corrected)

Effective date: 20141230

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

17Q First examination report despatched

Effective date: 20151218

APBK Appeal reference recorded

Free format text: ORIGINAL CODE: EPIDOSNREFNE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

APBT Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9E

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20200207