{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/match-tensor-a-deep-relevance-model-for","title":"Match-Tensor: a Deep Relevance Model for Search","arxiv_id":"1701.07795","date":"2017-01-26","proceeding":null,"authors":["Aaron Jaech","Hetunandan Kamisetty","Eric Ringger","Charlie Clarke"],"abstract":"The application of Deep Neural Networks for ranking in search engines may\nobviate the need for the extensive feature engineering common to current\nlearning-to-rank methods. However, we show that combining simple relevance\nmatching features like BM25 with existing Deep Neural Net models often\nsubstantially improves the accuracy of these models, indicating that they do\nnot capture essential local relevance matching signals. We describe a novel\ndeep Recurrent Neural Net-based model that we call Match-Tensor. The\narchitecture of the Match-Tensor model simultaneously accounts for both local\nrelevance matching and global topicality signals allowing for a rich interplay\nbetween them when computing the relevance of a document to a query. On a large\nheld-out test set consisting of social media documents, we demonstrate not only\nthat Match-Tensor outperforms BM25 and other classes of DNNs but also that it\nlargely subsumes signals present in these models.","url_abs":"http://arxiv.org/abs/1701.07795v1","url_pdf":"http://arxiv.org/pdf/1701.07795v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"match-tensor-a-deep-relevance-model-for","repo_url":"https://github.com/cspoh/IRDM2017","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"cspoh/IRDM2017","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5f9999b75afc4cc3b96c5b298731e33c5a0dd3f105f2605411601fe5c11e0394","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}