Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval
Lexical and semantic matches are commonly used as relevance measurements for information retrieval. Together they estimate the semantic equivalence between the query and the candidates. However, semantic equivalence is not the only relevance signal that needs to be considered when retrieving evidenc...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
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 | Luo, Fan Surdeanu, Mihai |
description | Lexical and semantic matches are commonly used as relevance measurements for
information retrieval. Together they estimate the semantic equivalence between
the query and the candidates. However, semantic equivalence is not the only
relevance signal that needs to be considered when retrieving evidences for
multi-hop questions. In this work, we demonstrate that textual entailment
relation is another important relevance dimension that should be considered. To
retrieve evidences that are either semantically equivalent to or entailed by
the question simultaneously, we divide the task of evidence retrieval for
multi-hop question answering (QA) into two sub-tasks, i.e., semantic textual
similarity and inference similarity retrieval. We propose two ensemble models,
EAR and EARnest, which tackle each of the sub-tasks separately and then jointly
re-rank sentences with the consideration of the diverse relevance signals.
Experimental results on HotpotQA verify that our models not only significantly
outperform all the single retrieval models it is based on, but is also more
effective than two intuitive ensemble baseline models. |
doi_str_mv | 10.48550/arxiv.2311.02616 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2311_02616</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2311_02616</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-e781a45c686cc52d3e93b01fd44b4c8390d60c99fed30416817dd0ce2b3dbbdb3</originalsourceid><addsrcrecordid>eNotzz1PwzAUhWEvHVDhBzDhic3Bjh3HGUsaPqQiJNQ9uva9EZbSpLhpgH-PWjqd5dWRHsZulcyMKwr5AOknzlmulcpkbpW9Yo_rOEckfs_rcfg6UuLdmHgzTBD7HQ2TgG9IxN-O_RTF57jnzSkfAvEPmlKkGfprtuigP9DNZZds-9Rs6xexeX9-rVcbAba0gkqnwBTBOhtCkaOmSnupOjTGm-B0JdHKUFUdoZZGWadKRBko9xq9R6-X7O7_9oxo9ynuIP22J0x7xug_TlBEYA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval</title><source>arXiv.org</source><creator>Luo, Fan ; Surdeanu, Mihai</creator><creatorcontrib>Luo, Fan ; Surdeanu, Mihai</creatorcontrib><description>Lexical and semantic matches are commonly used as relevance measurements for
information retrieval. Together they estimate the semantic equivalence between
the query and the candidates. However, semantic equivalence is not the only
relevance signal that needs to be considered when retrieving evidences for
multi-hop questions. In this work, we demonstrate that textual entailment
relation is another important relevance dimension that should be considered. To
retrieve evidences that are either semantically equivalent to or entailed by
the question simultaneously, we divide the task of evidence retrieval for
multi-hop question answering (QA) into two sub-tasks, i.e., semantic textual
similarity and inference similarity retrieval. We propose two ensemble models,
EAR and EARnest, which tackle each of the sub-tasks separately and then jointly
re-rank sentences with the consideration of the diverse relevance signals.
Experimental results on HotpotQA verify that our models not only significantly
outperform all the single retrieval models it is based on, but is also more
effective than two intuitive ensemble baseline models.</description><identifier>DOI: 10.48550/arxiv.2311.02616</identifier><language>eng</language><subject>Computer Science - Computation and Language ; Computer Science - Information Retrieval</subject><creationdate>2023-11</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2311.02616$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2311.02616$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Luo, Fan</creatorcontrib><creatorcontrib>Surdeanu, Mihai</creatorcontrib><title>Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval</title><description>Lexical and semantic matches are commonly used as relevance measurements for
information retrieval. Together they estimate the semantic equivalence between
the query and the candidates. However, semantic equivalence is not the only
relevance signal that needs to be considered when retrieving evidences for
multi-hop questions. In this work, we demonstrate that textual entailment
relation is another important relevance dimension that should be considered. To
retrieve evidences that are either semantically equivalent to or entailed by
the question simultaneously, we divide the task of evidence retrieval for
multi-hop question answering (QA) into two sub-tasks, i.e., semantic textual
similarity and inference similarity retrieval. We propose two ensemble models,
EAR and EARnest, which tackle each of the sub-tasks separately and then jointly
re-rank sentences with the consideration of the diverse relevance signals.
Experimental results on HotpotQA verify that our models not only significantly
outperform all the single retrieval models it is based on, but is also more
effective than two intuitive ensemble baseline models.</description><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Information Retrieval</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzz1PwzAUhWEvHVDhBzDhic3Bjh3HGUsaPqQiJNQ9uva9EZbSpLhpgH-PWjqd5dWRHsZulcyMKwr5AOknzlmulcpkbpW9Yo_rOEckfs_rcfg6UuLdmHgzTBD7HQ2TgG9IxN-O_RTF57jnzSkfAvEPmlKkGfprtuigP9DNZZds-9Rs6xexeX9-rVcbAba0gkqnwBTBOhtCkaOmSnupOjTGm-B0JdHKUFUdoZZGWadKRBko9xq9R6-X7O7_9oxo9ynuIP22J0x7xug_TlBEYA</recordid><startdate>20231105</startdate><enddate>20231105</enddate><creator>Luo, Fan</creator><creator>Surdeanu, Mihai</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20231105</creationdate><title>Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval</title><author>Luo, Fan ; Surdeanu, Mihai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-e781a45c686cc52d3e93b01fd44b4c8390d60c99fed30416817dd0ce2b3dbbdb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Information Retrieval</topic><toplevel>online_resources</toplevel><creatorcontrib>Luo, Fan</creatorcontrib><creatorcontrib>Surdeanu, Mihai</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Luo, Fan</au><au>Surdeanu, Mihai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval</atitle><date>2023-11-05</date><risdate>2023</risdate><abstract>Lexical and semantic matches are commonly used as relevance measurements for
information retrieval. Together they estimate the semantic equivalence between
the query and the candidates. However, semantic equivalence is not the only
relevance signal that needs to be considered when retrieving evidences for
multi-hop questions. In this work, we demonstrate that textual entailment
relation is another important relevance dimension that should be considered. To
retrieve evidences that are either semantically equivalent to or entailed by
the question simultaneously, we divide the task of evidence retrieval for
multi-hop question answering (QA) into two sub-tasks, i.e., semantic textual
similarity and inference similarity retrieval. We propose two ensemble models,
EAR and EARnest, which tackle each of the sub-tasks separately and then jointly
re-rank sentences with the consideration of the diverse relevance signals.
Experimental results on HotpotQA verify that our models not only significantly
outperform all the single retrieval models it is based on, but is also more
effective than two intuitive ensemble baseline models.</abstract><doi>10.48550/arxiv.2311.02616</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2311.02616 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2311_02616 |
source | arXiv.org |
subjects | Computer Science - Computation and Language Computer Science - Information Retrieval |
title | Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T08%3A00%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Divide%20&%20Conquer%20for%20Entailment-aware%20Multi-hop%20Evidence%20Retrieval&rft.au=Luo,%20Fan&rft.date=2023-11-05&rft_id=info:doi/10.48550/arxiv.2311.02616&rft_dat=%3Carxiv_GOX%3E2311_02616%3C/arxiv_GOX%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 |