Detecting social graph elements for structured search queries

Detecting social graph elements for structured search queries

In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold sc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cohen Michael Benjamin, Li Xiao, Azzolini Alisson Gusatti, Boucher Maxime, Rasmussen Lars Eilstrup, Lee Yofay Kari
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Cohen Michael Benjamin
Li Xiao
Azzolini Alisson Gusatti
Boucher Maxime
Rasmussen Lars Eilstrup
Lee Yofay Kari
description In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9465848B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9465848B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9465848B23</originalsourceid><addsrcrecordid>eNqNyj0OwjAMBtAsDAi4gy_AAgWVoQt_Ygfmygpf20ghCbZzfxYOwPSWN3fdGQZvIY2k2QeONAqXiRDxRjKlIQupSfVWBS9SsPiJPhUSoEs3GzgqVj8Xjq6Xx-m2Rsk9tLBHgvXP-6HZ79qmPW62f5Qv9ngwfw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Detecting social graph elements for structured search queries</title><source>esp@cenet</source><creator>Cohen Michael Benjamin ; Li Xiao ; Azzolini Alisson Gusatti ; Boucher Maxime ; Rasmussen Lars Eilstrup ; Lee Yofay Kari</creator><creatorcontrib>Cohen Michael Benjamin ; Li Xiao ; Azzolini Alisson Gusatti ; Boucher Maxime ; Rasmussen Lars Eilstrup ; Lee Yofay Kari</creatorcontrib><description>In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20161011&amp;DB=EPODOC&amp;CC=US&amp;NR=9465848B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25551,76302</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20161011&amp;DB=EPODOC&amp;CC=US&amp;NR=9465848B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Cohen Michael Benjamin</creatorcontrib><creatorcontrib>Li Xiao</creatorcontrib><creatorcontrib>Azzolini Alisson Gusatti</creatorcontrib><creatorcontrib>Boucher Maxime</creatorcontrib><creatorcontrib>Rasmussen Lars Eilstrup</creatorcontrib><creatorcontrib>Lee Yofay Kari</creatorcontrib><title>Detecting social graph elements for structured search queries</title><description>In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyj0OwjAMBtAsDAi4gy_AAgWVoQt_Ygfmygpf20ghCbZzfxYOwPSWN3fdGQZvIY2k2QeONAqXiRDxRjKlIQupSfVWBS9SsPiJPhUSoEs3GzgqVj8Xjq6Xx-m2Rsk9tLBHgvXP-6HZ79qmPW62f5Qv9ngwfw</recordid><startdate>20161011</startdate><enddate>20161011</enddate><creator>Cohen Michael Benjamin</creator><creator>Li Xiao</creator><creator>Azzolini Alisson Gusatti</creator><creator>Boucher Maxime</creator><creator>Rasmussen Lars Eilstrup</creator><creator>Lee Yofay Kari</creator><scope>EVB</scope></search><sort><creationdate>20161011</creationdate><title>Detecting social graph elements for structured search queries</title><author>Cohen Michael Benjamin ; Li Xiao ; Azzolini Alisson Gusatti ; Boucher Maxime ; Rasmussen Lars Eilstrup ; Lee Yofay Kari</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9465848B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Cohen Michael Benjamin</creatorcontrib><creatorcontrib>Li Xiao</creatorcontrib><creatorcontrib>Azzolini Alisson Gusatti</creatorcontrib><creatorcontrib>Boucher Maxime</creatorcontrib><creatorcontrib>Rasmussen Lars Eilstrup</creatorcontrib><creatorcontrib>Lee Yofay Kari</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cohen Michael Benjamin</au><au>Li Xiao</au><au>Azzolini Alisson Gusatti</au><au>Boucher Maxime</au><au>Rasmussen Lars Eilstrup</au><au>Lee Yofay Kari</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Detecting social graph elements for structured search queries</title><date>2016-10-11</date><risdate>2016</risdate><abstract>In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US9465848B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Detecting social graph elements for structured search queries
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T21%3A39%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Cohen%20Michael%20Benjamin&rft.date=2016-10-11&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9465848B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true