M
Maxime Boucher
Researcher at Facebook
Publications - 19
Citations - 953
Maxime Boucher is an academic researcher from Facebook. The author has contributed to research in topics: Social graph & Web search query. The author has an hindex of 12, co-authored 19 publications receiving 953 citations.
Papers
More filters
Patent
Structured search queries based on social-graph information
Yofay Kari Lee,Michael Benjamin Cohen,Maxime Boucher,Alisson Gusatti Azzolini,Xiao Li,Lars Eilstrup Rasmussen +5 more
TL;DR: In this paper, an unstructured text query is generated by identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes.
Patent
Detecting Social Graph Elements for Structured Search Queries
Yofay Kari Lee,Michael Benjamin Cohen,Maxime Boucher,Alisson Gusatti Azzolini,Xiao Li,Lars Eilstrup Rasmussen +5 more
TL;DR: In this paper, a method is described to parse an unstructured text query, parse the text query to identify n-grams, and determine a score that the ngrams correspond to particular nodes and edges from a social graph.
Patent
Personalized structured search queries for online social networks
Yofay Kari Lee,Michael Benjamin Cohen,Maxime Boucher,Alisson Gusatti Azzolini,Xiao Li,Lars Eilstrup Rasmussen +5 more
TL;DR: In this paper, a method is proposed to identify nodes and edges from a social graph that correspond to character strings from the text query, and then generate recommended queries that include references to the identified nodes and edge.
Patent
Client-Side Search Templates for Online Social Networks
TL;DR: In this paper, the authors present a method for receiving an unstructured text query from a first user of an online social network; and accessing, from a data store of the mobile client system, a set of nodes of a social graph.
Patent
Keyword Search Queries on Online Social Networks
Maxime Boucher,Xiao Li,Alexander Perelygin,Veselin Stoyanov,Russell Lee-Goldman,Necip Fazil Ayan +5 more
TL;DR: In this article, a method was proposed to parse the text query to identify one or more n-grams. But at least one of the ngrams is an ambiguous n-word.