FAST PASSAGE RETRIEVAL IN WEIGHTED HAMMING SPACE FOR OPEN-DOMAIN QUESTION ANSWERING
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

2

초록

The latest research has shown that hashing can decrease memory usage and computing time in many applications without significantly reducing efficiency. Recently, hashing approaches have been used in open-domain question answering tasks, where only the most basic hashing layer is employed. We propose a weighted Hamming distancebased semantic hashing method that learns optimal dimension weights to obtain effective passage retrieval results. We compared the performance of our method to those of stateof-the-art semantic hashing baselines in a passage retrieval task on open-domain question answering. The results show that our method can outperform the baselines and achieve accuracy similar to that attainable with dense vector-based retrieval. © 2024.

키워드

Hamming distanceNatural language processingOpen-domain question answeringPassage retrievalSemantic hashingWeighted Hamming
제목
FAST PASSAGE RETRIEVAL IN WEIGHTED HAMMING SPACE FOR OPEN-DOMAIN QUESTION ANSWERING
저자
Xuan, RichengShim, JunhoLee, Sang-Goo
DOI
10.24507/icicelb.15.04.373
발행일
2024-04
유형
Article
저널명
ICIC Express Letters, Part B: Applications
15
4
페이지
373 ~ 380