Extractive open-domain question answering (QA) is usually referred to the task of answering an arbitrary factoid question (such as “Where was Barack Obama born?”) from a general web text (such as Wikipedia). This is an extension of the reading comprehension task Rajpurkar et al. (2016) of selecting an answer phrase to a question given an evidence document. To make a scalable open-domain QA system, One can leverage a search engine to filter the web-scale evidence to a few documents, in which the answer span can be extracted using a reading comprehension model Chen et al. (2017). However, the accuracy of the final QA system is bounded by the performance of the search engine due to the pipeline nature of the search process. What is more, running a neural reading comprehension model Seo et al. (2017) on a few documents is still computationally costly, since it needs to process the evidence document for every new question at inference time. This often requires multi-GPU-seconds or tens to hundreds of CPU-seconds—BERT Devlin et al. (2019) can process only a few thousand words per second on an Nvidia P40 GPU.
In this paper, we introduce Dense-Sparse Phrase Index (DenSPI), an indexable query-agnostic phrase representation model for real-time open-domain QA. The phrase representations are indexed offline using time- and memory-efficient training and storage. During inference time, the input question is mapped to the same representation space, and the phrase with maximum inner product search is retrieved.
Our phrase representation combines both dense and sparse vectors. Dense vectors are effective for encoding local syntactic and semantic cues leveraging recent advances in contextualized text encoding Devlin et al. (2019), while sparse vectors are superior at encoding precise lexical information. The independent encoding of the document phrases and the question enables real-time inference; there is no need to re-encode documents for every question. Encoding phrases as a function of their start and end tokens facilitates indexable representations with under 2TB for up to 60 billion phrases in Wikipedia. Moreover, approximate nearest neighbor search on indexable representations allows fast and direct retrieval in a web-scale environment.
Experiments on SQuAD-Open Chen et al. (2017) show that DenSPI is comparable or better than most state-of-the-art open-domain QA systems on Wikipedia with up to 6000x reduced computational cost on RAM. In our end-to-end benchmark, this translates into at least 58x faster query inference including disk access time.
At the web scale, every detail of the training, indexing, and inference needs to be carefully designed. For reproducibility under an academic setting, we discuss optimization strategies for reducing time and memory usage during each stage in Section 5. This enables us to start from scratch and fully deploy the model with a 4-GPU, 64GB memory, 2 TB SATA222Further speed up is expected when taking a full advantage of a faster interface such as PCIe. SSD server in a week.
2 Related Work
Open-domain question answering
Creating a system that can answer an open-domain factoid question has been a significant interest to both academic and industrial communities. The problem is largely approached from two subfields: knowledge base (KB) and text (document) retrieval. Earlier work in large-scale question answering Berant et al. (2013) has focused on answering questions from a structured KB such as Freebase Bollacker et al. (2008)
. These approaches usually achieve a high precision, but their scope is limited to the ontology of the knowledge graph. While KB QA is undoubtedly an important part of open-domain QA, we mainly discuss literature in text-based QA, which is most relevant to our work.
for a comprehensive overview of early work. With the advancement of deep neural networks and the availability of massive QA datasets such as SQuADRajpurkar et al. (2016), open-domain phrase-level question answering has gained a great popularity Shen et al. (2017); Raiman and Miller (2017); Min et al. (2018); Raison et al. (2018); Das et al. (2019), where a few (5-10) documents relevant to the question are retrieved and then a deep neural model finds the answer in the document. Most previous work on open-domain QA has focused on mitigating error propagation of retriever models in a pipelined setting Chu-Carroll et al. (2012)
. For instance, retrieved documents could be re-ranked using reinforcement learningWang et al. (2018a), distant supervision Lin et al. (2018), or multi-task learning Nishida et al. (2018). Several studies have also shown that answer aggregation modules could improve performance of the pipelined models Wang et al. (2018b); Lee et al. (2018).
Our work is motivated by Seo et al. (2018) and adopts the concept and the advantage of using phrase index for large-scale question answering, though they only experiment in a close-domain (vanilla SQuAD) setup.
Approximate similarity search
Sublinear-time search for the nearest neighbor from a large collection of vectors is a significant interest to the information retrieval community Deerwester et al. (1990); Blei et al. (2003). In metric space (L1 or L2), one of the most classic search algorithms is Locality-Sensitive Hashing (LSH) Gionis et al. (1999), which uses a data-independent hashing function to map nearby vectors to the same cell. Stronger empirical performance has been observed with a data-dependent hashing function Andoni and Razenshteyn (2015)
or k-means clustering for defining the cells. More recently, graph-based search algorithmsMalkov and Yashunin (2018) have gained popularity as well. In non-metric space such as inner product, asymmetric Locality Sensitive Hashing (aLSH) Shrivastava and Li (2014) is considered, where maximizing inner product search can be transformed into minimizing L2 distance by appending a single dimension to the vectors. While these methods are widely used for dense vectors, for extremely sparse data (such as document tf-idf with stop words), it is often more efficient to construct an inverted index and only look up items that have common hot dimensions with the query.
Generative question answering
Mapping the phrases in a document to a common vector space to that of the questions can be viewed as an exhaustive enumeration of all possible questions that can be asked on the document in the vector space, but without a surface-form decoder. It is worth noting that generative question answering Lewis and Fan (2019) has the opposite property; while it has a surface-form decoder by definition, it cannot easily enumerate a compact list of all possible semantically-unique questions.
In this section, we formally define “open-domain question answering” and provide an overview of our proposed model.
3.1 Problem Definition
In this paper, we are interested in the task of answering factoid questions from a large collection of web documents in real-time. This is often referred to as open-domain question answering (QA). We formally formulate the task as follows. We are given a fixed set of (Wikipedia) documents (where is the number of documents, often on the order of millions), and each document has words, . The task is to find the answer to the question . Then an open-domain QA model is a scoring function for each candidate phrase span such that .
While the formulation is straightforward, argmax-ing over the entire corpus is computationally prohibitive, especially if is a complex neural model. To avoid the computational bottleneck, previous open-domain QA models adopt pipeline-based methods; that is, as illustrated in Figure 1 left, a fast retrieval-based model is used (e.g. tf-idf) to obtain a few relevant documents to the question, and then a neural QA model is used to extract the exact answer from the documents Chen et al. (2017). However, the method is not efficient enough for real-time usage because the neural QA needs to re-encode all the documents for every new question, which is computationally expensive even with modern GPUs, and not suitable for low-latency applications.
3.2 Encoding and Indexing Phrases
Motivated by Seo et al. (2018), our model encodes query-agnostic representations of text spans in Wikipedia offline and obtains the answer in real-time by performing nearest neighbor search at inference time. We represent each phrase span in the corpus (Wikipedia) with a dense vector and a sparse vector. The dense vector is effective for encoding syntactic and semantic cues, while the sparse vector is good at encoding precise lexical information. That is, the embedding of each span in the document is represented with
where is the dense vector and is the sparse vector for span in the -th document. Note that . This is also illustrated in Figure 1 right. Text span embeddings () for all possible pairs with , where is maximum span length (i.e. all possible spans from all documents in Wikipedia), are pre-computed and stored as a phrase index. Then at inference time, we embed each question into the same vector space, . Finally, the answer to the question is obtained by finding the maximum inner product between and ,
Needlessly to say, designing a good phrase representation model is crucial, which will be discussed in Section 4. Also, while inner product search is much more efficient than re-encoding documents, the search space is still quite large, such that exact search on the entire corpus is still undesirable. We discuss how we perform inner product search efficiently in Section 5.
4 Phrase and Question Embedding
In this section, we first explain the embedding model for the dense vector in Section 4.1. Then we describe the embedding model for the sparse vector in Section 4.2. Lastly, we describe the corresponding question embedding model to be queried on the phrase index in Section 4.3. For the brevity of the notations, we omit the superscript in this section since we do not learn cross-document relationships.
4.1 Dense Model
The dense vector is responsible for encoding syntactic or semantic information of the phrase with respect to its context. We decompose the dense vector (Equation 1) into three components: a vector that corresponds to the start position of the phrase, a vector that corresponds to the end position, and a scalar value that measures the coherency between the start and the end vectors. Representing phrases as a function of start and end vectors allows us to efficiently compute and store the vectors instead of enumerating all possible phrases (discussed in Section 5.2).333Our phrase encoding is analogous to how existing QA systems obtain the answer by predicting its start and the end positions.
The coherency scalar allows us to avoid non-constituent phrases during inference. For instance, consider a sentence such as “Barack Obama was the 44th President of the US. He was also a lawyer.” and when a question “What was Barack Obama’s job?” is asked. Since both answers “44th President of the US” and “lawyer” are technically correct, we might end up with the answer that spans from “44th” to “lawyer” if we model start and end vectors independently. The coherency scalar helps us avoid this by modeling it as a function of the start position and the end position. Formally, after phrase vector decomposition into dense and sparse, we can expand the dense vector into
where are the start and end vectors for the -th and -th words of the document, respectively; and is the phrasal coherency scalar between -th and -th positions (hence ).
To obtain these components of the dense vector, we leverage available contextualized word representations, in particular BERT-large Devlin et al. (2019), which is pretrained on a large corpus (Wikipedia and BookCorpus) and has proved to be very powerful in numerous natural language tasks. BERT maps a sequence of the document tokens to a sequence of corresponding vectors (i.e. a matrix) , where is the length of the input sequence, is the hidden state size, and is vertical concatenation. We obtain the three components of the dense vector from these contextualized word representations.
We fine-tune BERT to learn a -dimensional vector for encoding each token . Every token encoding is split into four vectors , where is a column-wise concatenation. Then we obtain the dense start vector from and dense end vector from . Lastly, we obtain the coherency scalar from the inner product of and . The inner product allows more coherent phrases to have more similar start and end encodings. That is,
where indicates inner product operation and and (hence ).
4.2 Sparse Model
We use term-frequency-based encoding to obtain the sparse embedding for each phrase. Specifically, we largely follow DrQA Chen et al. (2017) to construct 2-gram-based tf-idf, resulting in a highly sparse representation (
16M) for each document. The sparse vectors are normalized so that the inner product effectively becomes cosine similarity. We also compute a paragraph-level sparse vector in a similar way and add it to each document sparse vector for a higher sensitivity to local information. Note that, however, unlike DrQA where the sparse vector is merely used to retrieve a few (5-10) documents, we concatenate the sparse vector to the dense vector to form a standalone single phrase vector as in Equation1.
4.3 Question Embedding Model
At inference, the question is encoded as with the same number of components as the phrase index. To obtain the dense query vector , we use a special token ([CLS] for BERT) which is appended to the front of the question words (i.e. input question words are ). This allows us to model the dense query embedding differently from the dense embedding in the phrase index while sharing all parameters of the BERT encoder. That is, given the contextualized word representations of the question, we obtain the the dense query vector by
where is the encoding corresponding to the (first) special token and we obtain the others in a similar way. To obtain the sparse query vector , we use the same tf-idf embedding model (Section 4.2) on the entire query.
5 Training, Indexing & Search
Open-domain QA is a web-scale experiment, dealing with billions of words in Wikipedia while aiming for real-time inference. Hence (1) training the models, (2) indexing the embeddings, and (3) performing inner product search at inference time are non-trivial for both (a) computational time and (b) memory efficiency. In particular, we carry out this section assuming that we have a constrained hardware environment of 4 P40 GPUs, 128 GB RAM, 16 cores and 2 TB of SATA SSD storage, to promote reproducibility of our experiments under academic setting.444Training takes 16 hours (64-GPU hours) and indexing takes 5 days (500 GPU-hours).
As discussed in Section 4.2, the sparse embedding model is trained in an unsupervised manner. For training the dense embedding model, instead of directly optimizing for Equation 2 on entire Wikipedia, which is computationally prohibitive, we provide the golden paragraph to each question during training (i.e. SQuAD v1.1 setting).
From now on we let
(phrase start logits),(phrase end logits), and i.e. the value that is being maximized in the above equation.
One straightforward way to define the loss is to define it as the negative log probability of the correct answer where. In other words,
where is the loss to minimize. Note that explicitly enumerating all possible phrases (enumerating all pairs) during training time would be memory-intensive. Instead, we can efficiently obtain the loss by:
where for , is with broadcasting and -th element of is . Note that can be entirely computed from .
While the loss function is clearly unbiased with respect to, the summation in Equation 6 is computed over terms which is quite large and causes small gradient. To aid training, we define an auxilary loss corresponding to the start logits,
and for the end logits in a similar way. By early summation (taking the mean), we reduce the number of exponential terms and allow larger gradients. We average between the true and aux loss for the final loss: .
During training SQuAD (v1.1), we never observe negative examples (i.e. an unanswerable question in the paragraph). Following Levy et al. (2017), we introduce a trainable no-answer bias when computing softmax. For each paragraph, we create two negative examples by bringing one question from another article and one question from the same article but different paragraphs. Instead of randomly sampling, we bring the question with the highest inner product (i.e. most similar) with a randomly-picked positive question in the current paragraph, using a question embedding model trained on SQuAD v1.1. We jointly train the positive examples with the negative examples.
Wikipedia consists of approximately 3 billion tokens, so enumerating all phrases with length will result in about 60 billion phrases. With 961D of float32 per phrase, one needs 240 TB of storage (60 billion times 961 dimensions times 4 bytes per dimension). While not impossible in industry scale, the size is clearly out of reach for independent or academic researchers and critically unfriendly for open research. We discuss three techniques we employee to reduce the size of the index to 1.2 TB without sacrificing much accuracy, which becomes much more manageable for everyone. In practice, additional 300-500GB will be needed to store auxiliary information for efficient indexing, which still sums up to less than 2TB.
Since each phrase vector is the concatenation of and (and a scalar but it takes very little space), many phrases share the same start or end vectors. Hence we store a single list of the start and the end vectors independently and just store pointers to those vectors for the phrase representation. This effectively reduces the memory footprint from 240 TB to 12 TB.
We train a simple single-layer binary classifier on top of each of the start and end vectors, supervised with the actual answer (without observing the question). This allows us to not store vectors that are unlikely to be a potential start or end position of the answer phrase, further reducing the memory footprint from 12 TB to 5 TB.
We reduce the size of each vector by scalar quantization (SQ). That is, we convert each float32 value to int8 with appropriate offset and scaling. This allows us to reduce the size by one-fourth. Hence the final memory consumption is 1.2 TB. In future, more advanced methods such as Product Quantization (PQ) Jegou et al. (2011) can be considered, though we note that in our experiment setup we could not find a good configuration that does not drop the accuracy significantly.
While it would be ideal to (and possible to) directly approximate argmax in Equation 2 by using sparse maximum inner product search algorithm (some discussed in Section 2), we could not find a good open-source implementation that can scale up to billions of vectors and handle the dense and the sparse part of the phrase vector at the same time. We instead consider three approximation strategies.
First, sparse-first search (SFS) approximates the argmax by retrieving top- documents with the sparse similarity search and then performing exact search (including sparse inner product scores) over all the phrases in retrieved documents. This is analogous to most pipeline-based QA systems, although our model can still yield much higher speed because it only needs to perform inner product once the documents are retrieved. Since the number of sparse document vectors is relatively small (5 million), we directly perform exact search using scipy, which has under 0.2s latency per query.
Second, dense-first search (DFS) approximates the argmax by doing search on the dense part first to retrieve top- vectors and then reranking them by accessing the corresponding sparse vectors. Note that this implies a widely different behavior from SFS, as described in Section 6.2. We use faiss Johnson et al. (2017), open-sourced and large-scale-friendly similarity search package for dense vectors.
Lastly, we consider a hybrid approach by independently performing both search strategies and reranking the appended list of the results.
Also, instead of directly searching on the dense vector (concatenation of start, end, and coherency), we first search on the start vector and obtain the best end position for each retrieved start position by computing the rest. We found that this allows us to save memory and time without sacrificing much accuracy, since the start vectors alone seem to contain sufficiently rich syntactic and semantic information already that makes the search possible even in a large scale.
|DenSPI (dense only)||73.6||81.7||28.7M|
Experiment section is divided into two parts. First, we report results on SQuAD Rajpurkar et al. (2016). This can be considered as a small-scale prerequisite to the open-domain experiment. It also allows a convenient comparison to state-of-the-art models in SQuAD, especially on the speed of the model. Under a fully controlled environment and batch-query scenario, our model processes words nearly 6,000 times faster than DrQA Chen et al. (2017). Second, we report results on open-domain SQuAD (called SQuAD-Open), following the same setup as in DrQA. We show that our model achieves up to 6.4% better accuracy and up to 58 times faster end-to-end inference time than DrQA while exploring nearly 200 times more unique documents. All experiments are CPU-only benchmark.
6.1 SQuAD v1.1 Experiments
In the SQuAD v1.1 setup, our model effectively uses only the dense vector since every sparse (document tf-idf) vector will be identical in the same paragraph. While this is a much easier problem than open-domain, it can serve as a reliable and fast indicator of how well the model would do in the open-domain setup.
We use BERT-large () for the text encoders, which is pretrained on a large text corpus (Wikipedia dump and Book Corpus). We refer readers to the original paper by Devlin et al. (2019) for details; we mostly use the default settings described there. We use , resulting in phrase size of , and
. We train with a batch size of 12 (on four P40 GPUs) for 3 epochs.
We compare the performance of our system DenSPI with a few baselines in terms of accuracy and efficiency. The first group are among the models that are submitted to SQuAD v1.1 Leaderboard, specifically DrQA Chen et al. (2017) and BERT Devlin et al. (2019) (current state of the art). These models encode the evidence document given the question, but they suffer from the disadvantage that the evidence document needs to be re-encoded for every new question at the inference time, and they are strictly linear time in that they cannot utilize approximate search algorithms. The second group of baselines are introduced by Seo et al. (2018), specifically LSTM+SA and LSTM+SA+ELMo that also encode phrases independent of the question using LSTM, Self-Attention, and ELMo Peters et al. (2018) encodings.
Table 1 compares the performance of our system with different baselines in terms of efficiency and accuracy. We note the following observations from the result table. (1) DenSPI outperforms the query-agnostic baseline Seo et al. (2018) by a large margin, 20.1% EM and 18.5% F1. This is largely credited towards the usage of BERT encoder with an effective phrase embedding mechanism on the top. (2) DenSPI outperforms DrQA by 3.3% EM. This signifies that phrase-indexed models can now outperform early (unconstrained) state-of-the-art models in SQuAD. (3) DenSPI is 9.2% below the current state of the art. The difference, which we call decomposability gap555The gap is due to constraining the scoring function to be decomposable into question encoder and context encoder., is now within 10% and future work will involve further closing the gap. (4) Query-agnostic models can process (read) words much faster than query-dependent representation models. In a controlled environment where all information is in memory and the documents are pre-indexed, DenSPI can process 28.7 million words per second, which is 6,000 times faster than DrQA and 563,000 times faster than BERT without any approximation.
Ablations are also shown at the bottom of Table 1. The first ablation adds a linear layer on top of the BERT encoder for the phrase embeddings, which is more analogous to how BERT handles other language tasks. We see a huge drop in performance. We also try independent BERT encoders (i.e. unshared parameters) between phrase and question embedding models, and we also see a large drop as well. These seem to indicate that a careful design consideration for even small details are crucial when finetuning BERT. Our ablation that excludes coherency scalar decreases DenSPI’s EM score by 2% and F1 by 0.2%. This agrees with our intuition that the coherency scalar is useful for precisely defining valid phrase constituents.
6.2 Open-domain Experiments
In this subsection, we evaluate our model’s performance (accuracy and speed) on Open-domain SQuAD (SQuAD-Open), which is an extension of SQuAD Rajpurkar et al. (2016) by Chen et al. (2017). In this setup, the evidence is the entire English Wikipedia, and the golden paragraphs are not provided for questions.
For the dense vector, we adopt the same setup from Section 6.1 except that we train with no-answer questions (Section 5.1) and an increased batch size of 18. For the sparse vector of each phrase, we use the identical 2-gram tf-idf vector used by Chen et al. (2017), whose vocabulary size is approximately 17 million, of the document that contains the phrase. Since the sparse vector and the dense vector are independently obtained, we tune the linear scale between the sparse and the dense vectors and found that 0.05 (multiplied on the sparse vector) gives the best performance. As discussed in Section 5.3, we consider three search strategies. For sparse-first search (SFS), we retrieve top-5 documents. For dense-first search (DFS), we use an HNSW-based Malkov and Yashunin (2018) coarse quantizer with (1M) clusters (obtained with k-means) and nprobe=64 (number of clusters to visit). We retrieve top 1000 dense (start) vectors. The ‘Hybrid’ setup adopts the same configurations from both.
We compare our system with previous state-of-the-art models for open-domain question answering. The baselines include DrQA Chen et al. (2017), MINIMAL Min et al. (2018), multi-step-reasoner Das et al. (2019), Paragraph Ranker Lee et al. (2018), Wang et al. (2018a), BERTserini Yang et al. (2019), and Weaver Raison et al. (2018). We do not experiment with Seo et al. (2018) due to its poor performance with respect to DenSPI as demonstrated in Table 1.
|Q: What can hurt a teacher’s mental and physical health?|
|A: occupational stress|
|DrQA||[Mental health] … and poor mental health can lead|
|to problems such as substance abuse.|
|DenSPI||[Teacher] Teachers face several occupational hazards|
|in their line of work, including occupational stress, …|
|Q: Who was Kennedy’s science adviser that opposed manned|
|A: Jerome Wiesner|
|DrQA||[Apollo program] Kennedy’s science advisor Jerome|
|Wiesner, (…) his opposition to manned spaceflight …|
|[Apollo program] … and the sun by NASA manager|
|Abe Silverstein, who later said that …|
|[Apollo program] Although Grumman wanted a second|
|unmanned test, George Low decided (…) be manned.|
|DenSPI||[Apollo program] Kennedy’s science advisor Jerome|
|Wiesner, … his opposition to manned spaceflight …|
|[Space Race] Jerome Wiesner of MIT, who served as a|
|(…) advisor to (…) Kennedy, (…) opponent of manned …|
|[John F. Kennedy] … science advisor Jerome Wiesner|
|(…) strongly opposed to manned space exploration, …|
|Q: What to do when you’re bored?|
|DrQA||[Bored to Death (song)] I’m nearly bored to death|
|[Waterview Connection] The twin tunnels were bored|
|by (…) tunnel boring machine (TBM) …|
|[Bored to Death (song)] It’s easier to say you’re bored,|
|or to be angry, than it is to be sad.|
|DenSPI||[Big Brother 2] When bored, she enjoys drawing.|
|[Angry Kid] Angry Kid is (…) bored of long car journeys,|
|so Dad suggests he just close his eyes and sleep.|
|[Pearls Before Swine] In law school, he became so|
|bored during classes, he started to doodle a rat, …|
Table 2 shows the results of our system and previous models on SQuAD-Open. We note following observations: (1) DenSPI-Hybrid outperforms DrQA by 6.4% while achieving 43 times faster inference speed. (2) DenSPI-Hybrid is 6.1% EM behind Weaver, which co-encodes top 25 documents (retrieved by tf-idf) for every new question. As mentioned in Section 6.1, the difference between ours and Weaver can be considered as the decomposability gap arising from the constraint of query-agnostic phrase representations. We note, however, that the gap is smaller now in open-domain, and the speed-up is expected to be much larger666Weaver is not open-sourced so we could not benchmark it. since Weaver has higher computational complexity than DrQA and reads top 25 documents. (3) We also report the number of documents that our model computes exact search on and compare it to that of DrQA, as indicated by ‘#D/Q’ in the table. Top-1000 dense search in DenSPI-Hybrid results in 817 unique documents on average, which is much more diverse than the 5 documents that DrQA considers. The benefit of this diversity is better illustrated in the upcoming qualitative analysis (Table 3).
Table 2 (bottom) shows the effect of different search strategies (SFS vs DFS vs Hybrid) and the importance of the sparse vector.
SFS vs DFS vs Hybrid: We first see that DenSPI-SFS and DenSPI-DFS have comparable inference speed while DenSPI-SFS has 6.6% higher F1. While this demonstrates the effectiveness of sparse search, it is important to note that this might be due to the high word overlap between the question and the context in SQuAD. Furthermore, we see that Hybrid achieves the highest accuracy in both F1 and EM, implying that the two strategies are complimentary.
Sparse vector: DenSPI-DFS with ‘sparse scale=0’ implies that we entirely remove the sparse vector, i.e. in Equation 1. While this wouldn’t have any effect in SQuAD v.1.1, we see a significant drop (-19.6% F1), indicating the importance of the sparse vector in open-domain for distinguishing semantically close but lexically distinct entities.
|Q: What was the main radio network in the 1940s in America?|
|A: NBC Red Network|
|DenSPI||[American Broadcasting Company] In the 1930s, radio in|
|the United States was dominated by (…): the Columbia|
|Broadcasting System, the Mutual Broadcasting (…).|
|Q: Which city is the fifth-largest city in California?|
|DenSPI||[Oakland, California] Oakland is the largest city|
|and the county seat of (…), California, United States.|
Table 3 (and Table 5 in Appendix A) contrasts between the results from DrQA and DenSPI-Hybrid. In the top example, we note that DrQA fails to retrieve the right document, whereas DenSPI finds the correct answer. This happens exactly because the document retrieval model would not precisely know what kind of content is in the document, while dense search allows it to consider the content directly through phrase-level retrieval. In the second example, while both obtain the correct top-1, DenSPI also obtains the same answer from three different documents. The last example (not from SQuAD) does not have a noun entity, in which a term-frequency-based search engine often performs poorly. We indeed see that DrQA fails because wrong documents are retrieved. On the other hand, DenSPI is able to obtain good answers from several different documents. These results also reinforce the importance of exploring diverse documents (‘#D/Q’ in Table 2).
Table 4 shows wrong predictions from DenSPI. In the first example, the model seems to fail to distinguish ‘1940s’ from ‘1930s’. In the second example, the model seems to focus more on the word ‘largest’ than the word ‘fifth-’ in the question.
We introduce a model for real-time open-domain question answering by learning indexable phrase representations independent of the query, which leverage both dense and sparse vectors to capture lexical, semantic, and syntactic information. On SQuAD-Open, our experiments show that our model can read words 6,000 times faster under a controlled environment and 43 times faster in a real setup than DrQA while achieving 6.4% higher EM. We believe that even further speedup and larger coverage of documents can be done with a dedicated similarity search package for dense+sparse vectors. We note that, however, the gap due to query-agnostic constraint still exists and is at least 6.1% EM. Hence, more effort on designing a better phrase representation model is needed to close the gap.
This research was supported by ONR (N00014-18-1-2826, N00014-17-S-B001), NSF (IIS 1616112), Allen Distinguished Investigator Award, Samsung GRO, National Research Foundation of Korea (NRF-2017R1A2A1A17069645), and gifts from Allen Institute for AI, Google, and Amazon. We thank the members of UW NLP, Google AI, and the anonymous reviewers for their insightful comments.
Andoni and Razenshteyn (2015)
Alexandr Andoni and Ilya Razenshteyn. 2015.
Optimal data-dependent hashing for approximate near neighbors.
Proceedings of the forty-seventh annual ACM symposium on Theory of computing.
- Berant et al. (2013) Jonathan Berant, Andrew Chou, Roy Frostig, and Percy Liang. 2013. Semantic parsing on freebase from question-answer pairs. In EMNLP.
- Blei et al. (2003) David M Blei, Andrew Y Ng, and Michael I Jordan. 2003. Latent dirichlet allocation. JMLR.
- Bollacker et al. (2008) Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, and Jamie Taylor. 2008. Freebase: a collaboratively created graph database for structuring human knowledge. In SIGMOD.
- Chen et al. (2017) Danqi Chen, Adam Fisch, Jason Weston, and Antoine Bordes. 2017. Reading wikipedia to answer open-domain questions. In ACL.
- Chu-Carroll et al. (2012) Jennifer Chu-Carroll, James Fan, BK Boguraev, David Carmel, Dafna Sheinwald, and Chris Welty. 2012. Finding needles in the haystack: Search and candidate generation. IBM Journal of Research and Development.
- Das et al. (2019) Rajarshi Das, Shehzaad Dhuliawala, Manzil Zaheer, and Andrew McCallum. 2019. Multi-step retriever-reader interaction for scalable open-domain question answering. In ICLR.
- Deerwester et al. (1990) Scott Deerwester, Susan T Dumais, George W Furnas, Thomas K Landauer, and Richard Harshman. 1990. Indexing by latent semantic analysis. Journal of the American society for information science.
- Devlin et al. (2019) Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. Bert: Pre-training of deep bidirectional transformers for language understanding. In NAACL-HLT.
- Gionis et al. (1999) Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al. 1999. Similarity search in high dimensions via hashing. In VLDB.
- Jegou et al. (2011) Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2011. Product quantization for nearest neighbor search. TPAMI.
- Johnson et al. (2017) Jeff Johnson, Matthijs Douze, and Hervé Jégou. 2017. Billion-scale similarity search with gpus. arXiv preprint arXiv:1702.08734.
- Lee et al. (2018) Jinhyuk Lee, Seongjun Yun, Hyunjae Kim, Miyoung Ko, and Jaewoo Kang. 2018. Ranking paragraphs for improving answer recall in open-domain question answering. In EMNLP.
- Levy et al. (2017) Omer Levy, Minjoon Seo, Eunsol Choi, and Luke Zettlemoyer. 2017. Zero-shot relation extraction via reading comprehension. In CoNLL.
- Lewis and Fan (2019) Mike Lewis and Angela Fan. 2019. Generative question answering: Learning to answer the whole question. In ICLR.
- Lin et al. (2018) Yankai Lin, Haozhe Ji, Zhiyuan Liu, and Maosong Sun. 2018. Denoising distantly supervised open-domain question answering. In ACL.
- Malkov and Yashunin (2018) Yury A Malkov and Dmitry A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI.
- Miller et al. (2016) Alexander Miller, Adam Fisch, Jesse Dodge, Amir-Hossein Karimi, Antoine Bordes, and Jason Weston. 2016. Key-value memory networks for directly reading documents. arXiv preprint arXiv:1606.03126.
- Min et al. (2018) Sewon Min, Victor Zhong, Richard Socher, and Caiming Xiong. 2018. Efficient and robust question answering from minimal context over documents. In ACL.
- Nishida et al. (2018) Kyosuke Nishida, Itsumi Saito, Atsushi Otsuka, Hisako Asano, and Junji Tomita. 2018. Retrieve-and-read: Multi-task learning of information retrieval and reading comprehension. In CIKM.
- Peters et al. (2018) Matthew Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep contextualized word representations. In NAACL-HLT.
- Prager et al. (2007) John Prager et al. 2007. Open-domain question–answering. Foundations and Trends® in Information Retrieval.
- Raiman and Miller (2017) Jonathan Raiman and John Miller. 2017. Globally normalized reader. In EMNLP.
- Raison et al. (2018) Martin Raison, Pierre-Emmanuel Mazaré, Rajarshi Das, and Antoine Bordes. 2018. Weaver: Deep co-encoding of questions and documents for machine reading. arXiv preprint arXiv:1804.10490.
- Rajpurkar et al. (2016) Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. Squad: 100,000+ questions for machine comprehension of text. In EMNLP.
- Seo et al. (2017) Minjoon Seo, Aniruddha Kembhavi, Ali Farhadi, and Hannaneh Hajishirzi. 2017. Bidirectional attention flow for machine comprehension. In ICLR.
- Seo et al. (2018) Minjoon Seo, Tom Kwiatkowski, Ankur Parikh, Ali Farhadi, and Hannaneh Hajishirzi. 2018. Phrase-indexed question answering: A new challenge for scalable document comprehension. In EMNLP.
- Shen et al. (2017) Yelong Shen, Po-Sen Huang, Jianfeng Gao, and Weizhu Chen. 2017. Reasonet: Learning to stop reading in machine comprehension. In KDD.
- Shrivastava and Li (2014) Anshumali Shrivastava and Ping Li. 2014. Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips). In NIPS.
- Voorhees and Tice (2000) Ellen M Voorhees and Dawn M Tice. 2000. Building a question answering test collection. In SIGIR.
- Wang et al. (2018a) Shuohang Wang, Mo Yu, Xiaoxiao Guo, Zhiguo Wang, Tim Klinger, Wei Zhang, Shiyu Chang, Gerry Tesauro, Bowen Zhou, and Jing Jiang. 2018a. R 3: Reinforced ranker-reader for open-domain question answering. In AAAI.
- Wang et al. (2018b) Shuohang Wang, Mo Yu, Jing Jiang, Wei Zhang, Xiaoxiao Guo, Shiyu Chang, Zhiguo Wang, Tim Klinger, Gerald Tesauro, and Murray Campbell. 2018b. Evidence aggregation for answer re-ranking in open-domain question answering. In ICLR.
- Weston et al. (2015) Jason Weston, Sumit Chopra, and Antoine Bordes. 2015. Memory networks. In ICLR.
- Yang et al. (2019) Wei Yang, Yuqing Xie, Aileen Lin, Xingyu Li, Luchen Tan, Kun Xiong, Ming Li, and Jimmy Lin. 2019. End-to-end open-domain question answering with bertserini. arXiv preprint arXiv:1902.01718.
- Yang et al. (2015) Yi Yang, Wen-tau Yih, and Christopher Meek. 2015. Wikiqa: A challenge dataset for open-domain question answering. In EMNLP.
Appendix A More Prediction Samples
|Q: Who became the King of the Canary Islands?|
|DrQA||[Canary Islands] … Winston Churchill prepared plans (…) of the Canary Islands …|
|[Isleño … In 1501, Nicolás de Ovando left the Canary Islands …|
|[Canary Islands] … over by Fernando Clavijo, the current President of the Canary Islands …|
|DenSPI||[Tenerife] In 1464, Diego Garcia de Herrera, Lord of the Canary Islands, …|
|[Bettencourt] … explorer Jean de Béthencourt, who conquered the Canary Islands …|
|[Bettencourt] … Jean de Béthencourt, organized an expedition to conquer the Canary Islands, …|
|Q: When was the outbreak of World War I?|
|A: August 1914|
|DrQA||[Australian Army during World War II] … following the outbreak of war in 1939 and …|
|[Australian Army during World War II] … The result was that when war came in 1939, …|
|[Australian Army during World War II] … the outbreak of the Korean War on 25 June 1950 …|
|DenSPI||[SMS Kaiser Friedrich III] … the outbreak of World War I in July 1914.|
|[Germany at the Summer Olympics] At the outbreak of World War I in 1914, organization …|
|[Carl Hans Lody] … outbreak of the First World War on 28 July 1914 resulted in …|
|Q: What comedian is also a university graduate?|
|A: Mike Nichols|
|DrQA||[Anaheim University] … winning actress and comedian Carol Burnett in memory …|
|[Kettering University] Bob Kagle (…) is one of the most successful venture capitalists …|
|[Kettering University] Edward Davies (…) is the father-in-law of Mitt Romney.|
|DenSPI||[University of Washington] … and actor and comedian Joel McHale (1995, MFA 2000).|
|[Michigan State University] … Fawcett; comedian Dick Martin, comedian Jackie Martling …|
|[West Virginia State University] … a comedy show by famed comedian, Dick Gregory.|
|Q: Who is parodied on programs such as Saturday Night Live and The Simpsons?|
|A: Doctor Who fandom|
|DrQA||[The Last Voyage of the Starship Enterprise] … the “Saturday Night Live” parody of|
|“Star Trek” with William Shatner, …|
|[Saturday Night Live] … “Saturday Night Live with Howard Cosell” on the rival network …|
|[Fox Broadcasting Company] … “The Late Show”, which was hosted by comedian Joan Rivers.|
|DenSPI||[Gilda Radner] … and “Baba Wawa”, a parody of Barbara Walters.|
|[This American Life] … Armisen parodied Ira Glass for a skit on “Saturday Night Live”s …|
|[Anton Chigurh]… Chigurh has been parodied in other media, mainly as a spoof …|