{"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":"/task/information-retrieval/papers/9","list_of":"/task/information-retrieval","task":"Information Retrieval","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":9,"pages_in_order":48,"rows_per_page":100,"rows":[801,900],"of":4740,"counts":{"archive_papers_tagged":4740,"with_a_code_link":1188,"where_syntology_ran_a_sample":191,"not_listed_spam_title":0,"listed":4740,"listed_where_code_ran":191,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":151,"every_run_a_failure_of_syntologys_instrument":40,"listed_with_a_run_with_no_instrument_failure":151,"listed_every_run_a_failure_of_syntologys_instrument":40,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/information-retrieval","prev":"/task/information-retrieval/papers/8","next":"/task/information-retrieval/papers/10","papers":[{"url":"/paper/transfer-learning-approaches-for-building","slug":"transfer-learning-approaches-for-building","title":"Transfer Learning Approaches for Building Cross-Language Dense Retrieval Models","date":"2022-01-20","arxiv_id":"2201.08471","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transfer-learning-approaches-for-building#ran","syntology_url":"https://syntology.ai/paper/2201.08471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08471"}},"official":{"repos":["hltcoe/colbert-x"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grep-biasir-a-dataset-for-investigating","slug":"grep-biasir-a-dataset-for-investigating","title":"Grep-BiasIR: A Dataset for Investigating Gender Representation-Bias in Information Retrieval Results","date":"2022-01-19","arxiv_id":"2201.07754","repositories_listed":1,"syntology":null},{"url":"/paper/repro-eval-a-python-interface-to","slug":"repro-eval-a-python-interface-to","title":"repro_eval: A Python Interface to Reproducibility Measures of System-oriented IR Experiments","date":"2022-01-19","arxiv_id":"2201.07599","repositories_listed":1,"syntology":null},{"url":"/paper/proactive-query-expansion-for-streaming-data","slug":"proactive-query-expansion-for-streaming-data","title":"Proactive Query Expansion for Streaming Data Using External Source","date":"2022-01-17","arxiv_id":"2201.06592","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-aggregation-method-for-the","slug":"an-efficient-aggregation-method-for-the","title":"An efficient aggregation method for the symbolic representation of temporal data","date":"2022-01-14","arxiv_id":"2201.05697","repositories_listed":1,"syntology":null},{"url":"/paper/diagnosing-bert-with-retrieval-heuristics","slug":"diagnosing-bert-with-retrieval-heuristics","title":"Diagnosing BERT with Retrieval Heuristics","date":"2022-01-12","arxiv_id":"2201.04458","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-of-long-topic-sequences-in","slug":"continual-learning-of-long-topic-sequences-in","title":"Continual Learning of Long Topic Sequences in Neural Information Retrieval","date":"2022-01-10","arxiv_id":"2201.03356","repositories_listed":1,"syntology":null},{"url":"/paper/an-ensemble-approach-to-acronym-extraction","slug":"an-ensemble-approach-to-acronym-extraction","title":"An Ensemble Approach to Acronym Extraction using Transformers","date":"2022-01-09","arxiv_id":"2201.03026","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-empirical-study-of-vision","slug":"a-comprehensive-empirical-study-of-vision","title":"A Comprehensive Empirical Study of Vision-Language Pre-trained Model for Supervised Cross-Modal Retrieval","date":"2022-01-08","arxiv_id":"2201.02772","repositories_listed":1,"syntology":null},{"url":"/paper/coherence-based-distributed-document","slug":"coherence-based-distributed-document","title":"Coherence-Based Distributed Document Representation Learning for Scientific Documents","date":"2022-01-08","arxiv_id":"2201.02846","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-combinatorial-optimization-model","slug":"an-efficient-combinatorial-optimization-model","title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation","date":"2021-12-24","arxiv_id":"2201.00695","repositories_listed":1,"syntology":null},{"url":"/paper/disentanglement-by-cyclic-reconstruction","slug":"disentanglement-by-cyclic-reconstruction","title":"Disentanglement by Cyclic Reconstruction","date":"2021-12-24","arxiv_id":"2112.12980","repositories_listed":1,"syntology":null},{"url":"/paper/tfw2v-an-enhanced-document-similarity-method","slug":"tfw2v-an-enhanced-document-similarity-method","title":"TFW2V: An Enhanced Document Similarity Method for the Morphologically Rich Finnish Language","date":"2021-12-23","arxiv_id":"2112.12489","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-entity-tagging-with-multimodal-1","slug":"multimodal-entity-tagging-with-multimodal-1","title":"Multimodal Entity Tagging with Multimodal Knowledge Base","date":"2021-12-21","arxiv_id":"2201.00693","repositories_listed":1,"syntology":null},{"url":"/paper/challenge-dataset-of-cognates-and-false-1","slug":"challenge-dataset-of-cognates-and-false-1","title":"Challenge Dataset of Cognates and False Friend Pairs from Indian Languages","date":"2021-12-17","arxiv_id":"2112.09526","repositories_listed":1,"syntology":null},{"url":"/paper/harnessing-cross-lingual-features-to-improve-1","slug":"harnessing-cross-lingual-features-to-improve-1","title":"Harnessing Cross-lingual Features to Improve Cognate Detection for Low-resource Languages","date":"2021-12-16","arxiv_id":"2112.08789","repositories_listed":1,"syntology":null},{"url":"/paper/cognition-aware-cognate-detection-1","slug":"cognition-aware-cognate-detection-1","title":"Cognition-aware Cognate Detection","date":"2021-12-15","arxiv_id":"2112.08087","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cross-lingual-ir-from-an-english","slug":"learning-cross-lingual-ir-from-an-english","title":"Learning Cross-Lingual IR from an English Retriever","date":"2021-12-15","arxiv_id":"2112.08185","repositories_listed":1,"syntology":null},{"url":"/paper/iseeq-information-seeking-question-generation","slug":"iseeq-information-seeking-question-generation","title":"ISEEQ: Information Seeking Question Generation using Dynamic Meta-Information Retrieval and Knowledge Graphs","date":"2021-12-13","arxiv_id":"2112.07622","repositories_listed":1,"syntology":null},{"url":"/paper/learning-music-audio-representations-via-weak","slug":"learning-music-audio-representations-via-weak","title":"Learning music audio representations via weak language supervision","date":"2021-12-08","arxiv_id":"2112.04214","repositories_listed":1,"syntology":null},{"url":"/paper/an-optimal-algorithm-for-finding-champions-in","slug":"an-optimal-algorithm-for-finding-champions-in","title":"An Optimal Algorithm for Finding Champions in Tournament Graphs","date":"2021-11-26","arxiv_id":"2111.13621","repositories_listed":1,"syntology":null},{"url":"/paper/streamlining-evaluation-with-ir-measures","slug":"streamlining-evaluation-with-ir-measures","title":"Streamlining Evaluation with ir-measures","date":"2021-11-26","arxiv_id":"2111.13466","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-the-robustness-of-retrieval","slug":"evaluating-the-robustness-of-retrieval","title":"Evaluating the Robustness of Retrieval Pipelines with Query Variation Generators","date":"2021-11-25","arxiv_id":"2111.13057","repositories_listed":1,"syntology":null},{"url":"/paper/music-classification-beyond-supervised","slug":"music-classification-beyond-supervised","title":"Music Classification: Beyond Supervised Learning, Towards Real-world Applications","date":"2021-11-23","arxiv_id":"2111.11636","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-open-book-question-answering","slug":"zero-shot-open-book-question-answering","title":"Zero-Shot Open-Book Question Answering","date":"2021-11-22","arxiv_id":"2111.11520","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-of-selecting-key-blocks-with-local","slug":"the-power-of-selecting-key-blocks-with-local","title":"The Power of Selecting Key Blocks with Local Pre-ranking for Long Document Information Retrieval","date":"2021-11-18","arxiv_id":"2111.09852","repositories_listed":1,"syntology":null},{"url":"/paper/deeper-convolutional-neural-networks-and","slug":"deeper-convolutional-neural-networks-and","title":"Deeper Convolutional Neural Networks and Broad Augmentation Policies Improve Performance in Musical Key Estimation","date":"2021-11-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/detection-of-puffery-on-the-english-wikipedia","slug":"detection-of-puffery-on-the-english-wikipedia","title":"Detection of Puffery on the English Wikipedia","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hotter-hierarchical-optimal-topic-transport","slug":"hotter-hierarchical-optimal-topic-transport","title":"HOTTER: Hierarchical Optimal Topic Transport with Explanatory Context Representations","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ir-like-a-sir-sense-enhanced-information","slug":"ir-like-a-sir-sense-enhanced-information","title":"IR like a SIR: Sense-enhanced Information Retrieval for Multiple Languages","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-piano-music-with-sustain","slug":"learning-to-generate-piano-music-with-sustain","title":"Learning To Generate Piano Music With Sustain Pedals","date":"2021-11-01","arxiv_id":"2111.01216","repositories_listed":1,"syntology":null},{"url":"/paper/fast-k-nn-graph-construction-by-gpu-based-nn","slug":"fast-k-nn-graph-construction-by-gpu-based-nn","title":"Fast k-NN Graph Construction by GPU based NN-Descent","date":"2021-10-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rocketqav2-a-joint-training-method-for-dense","slug":"rocketqav2-a-joint-training-method-for-dense","title":"RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking","date":"2021-10-14","arxiv_id":"2110.07367","repositories_listed":1,"syntology":null},{"url":"/paper/mderank-a-masked-document-embedding-rank","slug":"mderank-a-masked-document-embedding-rank","title":"MDERank: A Masked Document Embedding Rank Approach for Unsupervised Keyphrase Extraction","date":"2021-10-13","arxiv_id":"2110.06651","repositories_listed":1,"syntology":null},{"url":"/paper/an-objective-metric-for-explainable-ai-how","slug":"an-objective-metric-for-explainable-ai-how","title":"An Objective Metric for Explainable AI: How and Why to Estimate the Degree of Explainability","date":"2021-09-11","arxiv_id":"2109.05327","repositories_listed":1,"syntology":null},{"url":"/paper/word-discriminations-for-vocabulary-inventory","slug":"word-discriminations-for-vocabulary-inventory","title":"Word Discriminations for Vocabulary Inventory Prediction","date":"2021-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/you-only-hear-once-a-yolo-like-algorithm-for","slug":"you-only-hear-once-a-yolo-like-algorithm-for","title":"You Only Hear Once: A YOLO-like Algorithm for Audio Segmentation and Sound Event Detection","date":"2021-09-01","arxiv_id":"2109.00962","repositories_listed":1,"syntology":null},{"url":"/paper/mmarco-a-multilingual-version-of-ms-marco","slug":"mmarco-a-multilingual-version-of-ms-marco","title":"mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Dataset","date":"2021-08-31","arxiv_id":"2108.13897","repositories_listed":1,"syntology":null},{"url":"/paper/a-statutory-article-retrieval-dataset-in","slug":"a-statutory-article-retrieval-dataset-in","title":"A Statutory Article Retrieval Dataset in French","date":"2021-08-26","arxiv_id":"2108.11792","repositories_listed":1,"syntology":null},{"url":"/paper/chmusic-a-traditional-chinese-music-dataset","slug":"chmusic-a-traditional-chinese-music-dataset","title":"ChMusic: A Traditional Chinese Music Dataset for Evaluation of Instrument Recognition","date":"2021-08-19","arxiv_id":"2108.08470","repositories_listed":1,"syntology":null},{"url":"/paper/fast-passage-re-ranking-with-contextualized","slug":"fast-passage-re-ranking-with-contextualized","title":"Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansion","date":"2021-08-19","arxiv_id":"2108.08513","repositories_listed":1,"syntology":null},{"url":"/paper/complex-knowledge-base-question-answering-a","slug":"complex-knowledge-base-question-answering-a","title":"Complex Knowledge Base Question Answering: A Survey","date":"2021-08-15","arxiv_id":"2108.06688","repositories_listed":1,"syntology":null},{"url":"/paper/dossier-coliee-2021-leveraging-dense","slug":"dossier-coliee-2021-leveraging-dense","title":"DoSSIER@COLIEE 2021: Leveraging dense retrieval and summarization-based re-ranking for case law retrieval","date":"2021-08-09","arxiv_id":"2108.03937","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-human-reading-comprehension","slug":"understanding-human-reading-comprehension","title":"Towards a Better Understanding Human Reading Comprehension with Brain Signals","date":"2021-08-03","arxiv_id":"2108.01360","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-facet-selection-by-maximizing-graded","slug":"dynamic-facet-selection-by-maximizing-graded","title":"Dynamic Facet Selection by Maximizing Graded Relevance","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/domain-matched-pre-training-tasks-for-dense","slug":"domain-matched-pre-training-tasks-for-dense","title":"Domain-matched Pre-training Tasks for Dense Retrieval","date":"2021-07-28","arxiv_id":"2107.13602","repositories_listed":1,"syntology":null},{"url":"/paper/linked-data-triples-enhance-document","slug":"linked-data-triples-enhance-document","title":"Linked Data Triples Enhance Document Relevance Classification","date":"2021-07-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/more-robust-dense-retrieval-with-contrastive","slug":"more-robust-dense-retrieval-with-contrastive","title":"More Robust Dense Retrieval with Contrastive Dual Learning","date":"2021-07-16","arxiv_id":"2107.07773","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/more-robust-dense-retrieval-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2107.07773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07773"}},"official":{"repos":["thunlp/DANCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codified-audio-language-modeling-learns","slug":"codified-audio-language-modeling-learns","title":"Codified audio language modeling learns useful representations for music information retrieval","date":"2021-07-12","arxiv_id":"2107.05677","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codified-audio-language-modeling-learns#ran","syntology_url":"https://syntology.ai/paper/2107.05677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05677"}},"official":{"repos":["p-lambda/jukemir"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/splade-sparse-lexical-and-expansion-model-for","slug":"splade-sparse-lexical-and-expansion-model-for","title":"SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking","date":"2021-07-12","arxiv_id":"2107.05720","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-modality-interaction-modeling-for","slug":"dynamic-modality-interaction-modeling-for","title":"Dynamic Modality Interaction Modeling for Image-Text Retrieval","date":"2021-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/metap-meta-pattern-learning-for-one-shot","slug":"metap-meta-pattern-learning-for-one-shot","title":"MetaP: Meta Pattern Learning for One-Shot Knowledge Graph Completion","date":"2021-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/information-retrieval-for-zerospeech-2021-the","slug":"information-retrieval-for-zerospeech-2021-the","title":"Information Retrieval for ZeroSpeech 2021: The Submission by University of Wroclaw","date":"2021-06-22","arxiv_id":"2106.11603","repositories_listed":1,"syntology":null},{"url":"/paper/an-information-retrieval-approach-to-building","slug":"an-information-retrieval-approach-to-building","title":"An Information Retrieval Approach to Building Datasets for Hate Speech Detection","date":"2021-06-17","arxiv_id":"2106.09775","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-information-retrieval-approach-to-building#ran","syntology_url":"https://syntology.ai/paper/2106.09775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09775"}},"official":{"repos":["mdmustafizurrahman/An-Information-Retrieval-Approach-to-Building-Datasets-for-Hate-Speech-Detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-deep-learning-a-survey-on-making","slug":"efficient-deep-learning-a-survey-on-making","title":"Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better","date":"2021-06-16","arxiv_id":"2106.08962","repositories_listed":1,"syntology":null},{"url":"/paper/linguistically-informed-masking-for","slug":"linguistically-informed-masking-for","title":"Linguistically Informed Masking for Representation Learning in the Patent Domain","date":"2021-06-10","arxiv_id":"2106.05768","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-modality-agnostic-representations","slug":"exploring-modality-agnostic-representations","title":"Exploring modality-agnostic representations for music classification","date":"2021-06-02","arxiv_id":"2106.01149","repositories_listed":1,"syntology":null},{"url":"/paper/keyphrase-extraction-from-scientific-articles","slug":"keyphrase-extraction-from-scientific-articles","title":"Keyphrase Extraction from Scientific Articles via Extractive Summarization","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/omnizart-a-general-toolbox-for-automatic","slug":"omnizart-a-general-toolbox-for-automatic","title":"Omnizart: A General Toolbox for Automatic Music Transcription","date":"2021-06-01","arxiv_id":"2106.00497","repositories_listed":1,"syntology":null},{"url":"/paper/loopnet-musical-loop-synthesis-conditioned-on","slug":"loopnet-musical-loop-synthesis-conditioned-on","title":"LoopNet: Musical Loop Synthesis Conditioned On Intuitive Musical Parameters","date":"2021-05-21","arxiv_id":"2105.10371","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-cross-sectional-currency-strategies","slug":"enhancing-cross-sectional-currency-strategies","title":"Enhancing Cross-Sectional Currency Strategies by Context-Aware Learning to Rank with Self-Attention","date":"2021-05-20","arxiv_id":"2105.10019","repositories_listed":1,"syntology":null},{"url":"/paper/freshdiskann-a-fast-and-accurate-graph-based","slug":"freshdiskann-a-fast-and-accurate-graph-based","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","date":"2021-05-20","arxiv_id":"2105.09613","repositories_listed":1,"syntology":null},{"url":"/paper/priberam-at-mesinesp-multi-label","slug":"priberam-at-mesinesp-multi-label","title":"Priberam at MESINESP Multi-label Classification of Medical Texts Task","date":"2021-05-12","arxiv_id":"2105.05614","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-entity-linking-problem","slug":"conversational-entity-linking-problem","title":"Conversational Entity Linking: Problem Definition and Datasets","date":"2021-05-11","arxiv_id":"2105.04903","repositories_listed":1,"syntology":null},{"url":"/paper/wiki-reliability-a-large-scale-dataset-for","slug":"wiki-reliability-a-large-scale-dataset-for","title":"Wiki-Reliability: A Large Scale Dataset for Content Reliability on Wikipedia","date":"2021-05-10","arxiv_id":"2105.04117","repositories_listed":1,"syntology":null},{"url":"/paper/introducing-information-retrieval-for","slug":"introducing-information-retrieval-for","title":"Introducing Information Retrieval for Biomedical Informatics Students","date":"2021-05-06","arxiv_id":"2105.02746","repositories_listed":1,"syntology":null},{"url":"/paper/smoothi-smooth-rank-indicators-for","slug":"smoothi-smooth-rank-indicators-for","title":"SmoothI: Smooth Rank Indicators for Differentiable IR Metrics","date":"2021-05-03","arxiv_id":"2105.00942","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-document-expansion-for","slug":"unsupervised-document-expansion-for","title":"Unsupervised Document Expansion for Information Retrieval with Stochastic Text Generation","date":"2021-05-03","arxiv_id":"2105.00666","repositories_listed":1,"syntology":null},{"url":"/paper/societal-biases-in-retrieved-contents","slug":"societal-biases-in-retrieved-contents","title":"Societal Biases in Retrieved Contents: Measurement Framework and Adversarial Mitigation for BERT Rankers","date":"2021-04-28","arxiv_id":"2104.13640","repositories_listed":1,"syntology":null},{"url":"/paper/learning-passage-impacts-for-inverted-indexes","slug":"learning-passage-impacts-for-inverted-indexes","title":"Learning Passage Impacts for Inverted Indexes","date":"2021-04-24","arxiv_id":"2104.12016","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-passage-impacts-for-inverted-indexes#ran","syntology_url":"https://syntology.ai/paper/2104.12016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12016"}},"official":{"repos":["DI4IR/SIGIR2021"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretation-of-multi-label-classification","slug":"interpretation-of-multi-label-classification","title":"Interpretation of multi-label classification models using shapley values","date":"2021-04-21","arxiv_id":"2104.10505","repositories_listed":1,"syntology":null},{"url":"/paper/b-prop-bootstrapped-pre-training-with","slug":"b-prop-bootstrapped-pre-training-with","title":"B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval","date":"2021-04-20","arxiv_id":"2104.09791","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/b-prop-bootstrapped-pre-training-with#ran","syntology_url":"https://syntology.ai/paper/2104.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09791"}},"official":{"repos":["Albert-Ma/PROP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/iitp-in-coliee-icail-2019-legal-information","slug":"iitp-in-coliee-icail-2019-legal-information","title":"IITP@COLIEE 2019: Legal Information Retrieval using BM25 and BERT","date":"2021-04-17","arxiv_id":"2104.08653","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-neural-topic-modeling-in-multi","slug":"multi-source-neural-topic-modeling-in-multi","title":"Multi-source Neural Topic Modeling in Multi-view Embedding Spaces","date":"2021-04-17","arxiv_id":"2104.08551","repositories_listed":1,"syntology":null},{"url":"/paper/tie-a-framework-for-embedding-based","slug":"tie-a-framework-for-embedding-based","title":"TIE: A Framework for Embedding-based Incremental Temporal Knowledge Graph Completion","date":"2021-04-17","arxiv_id":"2104.08419","repositories_listed":1,"syntology":null},{"url":"/paper/back-to-the-basics-a-quantitative-analysis-of","slug":"back-to-the-basics-a-quantitative-analysis-of","title":"Back to the Basics: A Quantitative Analysis of Statistical and Graph-Based Term Weighting Schemes for Keyword Extraction","date":"2021-04-16","arxiv_id":"2104.08028","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/back-to-the-basics-a-quantitative-analysis-of#ran","syntology_url":"https://syntology.ai/paper/2104.08028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08028"}},"official":{"repos":["asahi417/kex"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/coil-revisit-exact-lexical-match-in","slug":"coil-revisit-exact-lexical-match-in","title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","date":"2021-04-15","arxiv_id":"2104.07186","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/coil-revisit-exact-lexical-match-in#ran","syntology_url":"https://syntology.ai/paper/2104.07186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07186"}},"official":{"repos":["luyug/COIL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/an-adversarial-imitation-click-model-for","slug":"an-adversarial-imitation-click-model-for","title":"An Adversarial Imitation Click Model for Information Retrieval","date":"2021-04-13","arxiv_id":"2104.06077","repositories_listed":1,"syntology":null},{"url":"/paper/macro-average-rare-types-are-important-too","slug":"macro-average-rare-types-are-important-too","title":"Macro-Average: Rare Types Are Important Too","date":"2021-04-12","arxiv_id":"2104.05700","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/macro-average-rare-types-are-important-too#ran","syntology_url":"https://syntology.ai/paper/2104.05700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05700"}},"official":{"repos":["thammegowda/007-mt-eval-macro"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/concentration-inequalities-for-two-sample","slug":"concentration-inequalities-for-two-sample","title":"Concentration Inequalities for Two-Sample Rank Processes with Application to Bipartite Ranking","date":"2021-04-07","arxiv_id":"2104.02943","repositories_listed":1,"syntology":null},{"url":"/paper/multireqa-a-cross-domain-evaluation","slug":"multireqa-a-cross-domain-evaluation","title":"MultiReQA: A Cross-Domain Evaluation forRetrieval Question Answering Models","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-approximate-k-nn-graph","slug":"large-scale-approximate-k-nn-graph","title":"Large-Scale Approximate k-NN Graph Construction on GPU","date":"2021-03-29","arxiv_id":"2103.15386","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-multi-index-semantic-hashing","slug":"unsupervised-multi-index-semantic-hashing","title":"Unsupervised Multi-Index Semantic Hashing","date":"2021-03-26","arxiv_id":"2103.14460","repositories_listed":1,"syntology":null},{"url":"/paper/csfcube-a-test-collection-of-computer-science","slug":"csfcube-a-test-collection-of-computer-science","title":"CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Example","date":"2021-03-24","arxiv_id":"2103.12906","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/csfcube-a-test-collection-of-computer-science#ran","syntology_url":"https://syntology.ai/paper/2103.12906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12906"}},"official":{"repos":["iesl/CSFCube"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/naturalproofs-mathematical-theorem-proving-in","slug":"naturalproofs-mathematical-theorem-proving-in","title":"NaturalProofs: Mathematical Theorem Proving in Natural Language","date":"2021-03-24","arxiv_id":"2104.01112","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/naturalproofs-mathematical-theorem-proving-in#ran","syntology_url":"https://syntology.ai/paper/2104.01112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01112"}},"official":{"repos":["wellecks/naturalproofs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tripclick-the-log-files-of-a-large-health-web","slug":"tripclick-the-log-files-of-a-large-health-web","title":"TripClick: The Log Files of a Large Health Web Search Engine","date":"2021-03-14","arxiv_id":"2103.07901","repositories_listed":1,"syntology":null},{"url":"/paper/simplified-data-wrangling-with-ir-datasets","slug":"simplified-data-wrangling-with-ir-datasets","title":"Simplified Data Wrangling with ir_datasets","date":"2021-03-03","arxiv_id":"2103.02280","repositories_listed":1,"syntology":null},{"url":"/paper/pyserini-an-easy-to-use-python-toolkit-to","slug":"pyserini-an-easy-to-use-python-toolkit-to","title":"Pyserini: An Easy-to-Use Python Toolkit to Support Replicable IR Research with Sparse and Dense Representations","date":"2021-02-19","arxiv_id":"2102.10073","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pyserini-an-easy-to-use-python-toolkit-to#ran","syntology_url":"https://syntology.ai/paper/2102.10073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10073"}},"official":{"repos":["castorini/pyserini"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neuralndcg-direct-optimisation-of-a-ranking","slug":"neuralndcg-direct-optimisation-of-a-ranking","title":"NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting","date":"2021-02-15","arxiv_id":"2102.07831","repositories_listed":1,"syntology":null},{"url":"/paper/elske-efficient-large-scale-keyphrase","slug":"elske-efficient-large-scale-keyphrase","title":"ELSKE: Efficient Large-Scale Keyphrase Extraction","date":"2021-02-10","arxiv_id":"2102.05700","repositories_listed":1,"syntology":null},{"url":"/paper/user-engagement-prediction-for-clarification","slug":"user-engagement-prediction-for-clarification","title":"User Engagement Prediction for Clarification in Search","date":"2021-02-08","arxiv_id":"2102.04163","repositories_listed":1,"syntology":null},{"url":"/paper/role-of-attentive-history-selection-in","slug":"role-of-attentive-history-selection-in","title":"Role of Attentive History Selection in Conversational Information Seeking","date":"2021-02-07","arxiv_id":"2102.03749","repositories_listed":1,"syntology":null},{"url":"/paper/melon-playlist-dataset-a-public-dataset-for","slug":"melon-playlist-dataset-a-public-dataset-for","title":"Melon Playlist Dataset: a public dataset for audio-based playlist generation and music tagging","date":"2021-01-30","arxiv_id":"2102.00201","repositories_listed":1,"syntology":null},{"url":"/paper/openmatch-an-open-source-package-for","slug":"openmatch-an-open-source-package-for","title":"OpenMatch: An Open Source Library for Neu-IR Research","date":"2021-01-30","arxiv_id":"2102.00166","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-and-experimental","slug":"a-comprehensive-survey-and-experimental","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","date":"2021-01-29","arxiv_id":"2101.12631","repositories_listed":1,"syntology":null},{"url":"/paper/perceptions-of-diversity-in-electronic-music","slug":"perceptions-of-diversity-in-electronic-music","title":"Perceptions of Diversity in Electronic Music: the Impact of Listener, Artist, and Track Characteristics","date":"2021-01-28","arxiv_id":"2101.11916","repositories_listed":1,"syntology":null},{"url":"/paper/dive-into-decision-trees-and-forests-a","slug":"dive-into-decision-trees-and-forests-a","title":"Dive into Decision Trees and Forests: A Theoretical Demonstration","date":"2021-01-20","arxiv_id":"2101.08656","repositories_listed":1,"syntology":null},{"url":"/paper/expfinder-an-ensemble-expert-finding-model","slug":"expfinder-an-ensemble-expert-finding-model","title":"ExpFinder: An Ensemble Expert Finding Model Integrating $N$-gram Vector Space Model and $μ$CO-HITS","date":"2021-01-18","arxiv_id":"2101.06821","repositories_listed":1,"syntology":null},{"url":"/paper/match-ignition-plugging-pagerank-into","slug":"match-ignition-plugging-pagerank-into","title":"Match-Ignition: Plugging PageRank into Transformer for Long-form Text Matching","date":"2021-01-16","arxiv_id":"2101.06423","repositories_listed":1,"syntology":null},{"url":"/paper/an-unsupervised-normalization-algorithm-for","slug":"an-unsupervised-normalization-algorithm-for","title":"An Unsupervised Normalization Algorithm for Noisy Text: A Case Study for Information Retrieval and Stance Detection","date":"2021-01-09","arxiv_id":"2101.03303","repositories_listed":1,"syntology":null}],"record_sha256":"e1c4dea7fd1b2d96125507fb29e80ab501e834d700cd7916b5df7b3b840dbc65","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}