Multi-part search result ranking

Multi-part search result ranking

Search results responsive to a query are generated by a search engine. If the query is "location relevant", the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LAKHANI SAMIR, RAULT SEVERAN SYLVAIN JEAN-MICHEL, OLLIS JOSEPH, RIPSHER LAWRENCE BRIAN
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 LAKHANI SAMIR
RAULT SEVERAN SYLVAIN JEAN-MICHEL
OLLIS JOSEPH
RIPSHER LAWRENCE BRIAN
description Search results responsive to a query are generated by a search engine. If the query is "location relevant", the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if it is not semantically charged, the entities are ranked either according to distance from the user or by search relevance. If the query is semantically charged, a semantic score is calculated for each entity. One or more threshold semantic scores are determined that divide the search results into multiple parts. The results within each part can then be ranked independently. The results within a first part are ranked according to their distance from the user, while the results in a subsequent part are ranked according to their semantical relationship to the query. The re-ranked parts are concatenated together.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US8688696B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US8688696B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US8688696B23</originalsourceid><addsrcrecordid>eNrjZFDwLc0pydQtSCwqUShOTSxKzlAoSi0GiikUJeZlZ-al8zCwpiXmFKfyQmluBgU31xBnD93Ugvz41OKCxOTUvNSS-NBgCzMLCzNLMycjYyKUAAAdpSVN</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Multi-part search result ranking</title><source>esp@cenet</source><creator>LAKHANI SAMIR ; RAULT SEVERAN SYLVAIN JEAN-MICHEL ; OLLIS JOSEPH ; RIPSHER LAWRENCE BRIAN</creator><creatorcontrib>LAKHANI SAMIR ; RAULT SEVERAN SYLVAIN JEAN-MICHEL ; OLLIS JOSEPH ; RIPSHER LAWRENCE BRIAN</creatorcontrib><description>Search results responsive to a query are generated by a search engine. If the query is "location relevant", the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if it is not semantically charged, the entities are ranked either according to distance from the user or by search relevance. If the query is semantically charged, a semantic score is calculated for each entity. One or more threshold semantic scores are determined that divide the search results into multiple parts. The results within each part can then be ranked independently. The results within a first part are ranked according to their distance from the user, while the results in a subsequent part are ranked according to their semantical relationship to the query. The re-ranked parts are concatenated together.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2014</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=20140401&amp;DB=EPODOC&amp;CC=US&amp;NR=8688696B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140401&amp;DB=EPODOC&amp;CC=US&amp;NR=8688696B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LAKHANI SAMIR</creatorcontrib><creatorcontrib>RAULT SEVERAN SYLVAIN JEAN-MICHEL</creatorcontrib><creatorcontrib>OLLIS JOSEPH</creatorcontrib><creatorcontrib>RIPSHER LAWRENCE BRIAN</creatorcontrib><title>Multi-part search result ranking</title><description>Search results responsive to a query are generated by a search engine. If the query is "location relevant", the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if it is not semantically charged, the entities are ranked either according to distance from the user or by search relevance. If the query is semantically charged, a semantic score is calculated for each entity. One or more threshold semantic scores are determined that divide the search results into multiple parts. The results within each part can then be ranked independently. The results within a first part are ranked according to their distance from the user, while the results in a subsequent part are ranked according to their semantical relationship to the query. The re-ranked parts are concatenated together.</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>2014</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFDwLc0pydQtSCwqUShOTSxKzlAoSi0GiikUJeZlZ-al8zCwpiXmFKfyQmluBgU31xBnD93Ugvz41OKCxOTUvNSS-NBgCzMLCzNLMycjYyKUAAAdpSVN</recordid><startdate>20140401</startdate><enddate>20140401</enddate><creator>LAKHANI SAMIR</creator><creator>RAULT SEVERAN SYLVAIN JEAN-MICHEL</creator><creator>OLLIS JOSEPH</creator><creator>RIPSHER LAWRENCE BRIAN</creator><scope>EVB</scope></search><sort><creationdate>20140401</creationdate><title>Multi-part search result ranking</title><author>LAKHANI SAMIR ; RAULT SEVERAN SYLVAIN JEAN-MICHEL ; OLLIS JOSEPH ; RIPSHER LAWRENCE BRIAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US8688696B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2014</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>LAKHANI SAMIR</creatorcontrib><creatorcontrib>RAULT SEVERAN SYLVAIN JEAN-MICHEL</creatorcontrib><creatorcontrib>OLLIS JOSEPH</creatorcontrib><creatorcontrib>RIPSHER LAWRENCE BRIAN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LAKHANI SAMIR</au><au>RAULT SEVERAN SYLVAIN JEAN-MICHEL</au><au>OLLIS JOSEPH</au><au>RIPSHER LAWRENCE BRIAN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Multi-part search result ranking</title><date>2014-04-01</date><risdate>2014</risdate><abstract>Search results responsive to a query are generated by a search engine. If the query is "location relevant", the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if it is not semantically charged, the entities are ranked either according to distance from the user or by search relevance. If the query is semantically charged, a semantic score is calculated for each entity. One or more threshold semantic scores are determined that divide the search results into multiple parts. The results within each part can then be ranked independently. The results within a first part are ranked according to their distance from the user, while the results in a subsequent part are ranked according to their semantical relationship to the query. The re-ranked parts are concatenated together.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US8688696B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Multi-part search result ranking
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T11%3A33%3A10IST&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=LAKHANI%20SAMIR&rft.date=2014-04-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS8688696B2%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