Knowledge graph based simple question answering (KBSQA) is a major area of research within question answering. Although only dealing with simple questions, i.e., questions that can be answered through a single knowledge base (KB) fact, this task is neither simple nor close to being solved. Targeting on the two main steps, subgraph selection and fact selection, the research community has developed sophisticated approaches. However, the importance of subgraph ranking and leveraging the subjectrelation dependency of a KB fact have not been sufficiently explored. Motivated by this, we present a unified framework to describe and analyze existing approaches. Using this framework as a starting point, we focus on two aspects: improving subgraph selection through a novel ranking method and leveraging the subjectrelation dependency by proposing a joint scoring CNN model with a novel loss function that enforces the well-order of scores. Our methods achieve a new state of the art (85.44% in accuracy) on the SimpleQuestions dataset. Knowledge graph based simple question answering (KBSQA) is an important area of research within question answering, which is one of the core areas of interest in natural language processing (Yao and Van Durme, 2014; Yih et al., 2015; Dong et al., 2015; Khashabi et al., 2016; Zhang et al., 2018; Hu et al., 2018). It can be used for many applications such as virtual home assistants, customer service, and chat-bots. A knowledge graph is a multi-entity and multi-relation directed graph containing the information needed to answer the questions. The graph can be represented as collection of triples { (subject, relation,  Work conducted during an internship at Alexa AI, CA. object) } . Each triple is called a fact , where a directed relational arrow points from subject node to object node. A simple question means that the question can be answered by extracting a single fact from the knowledge graph, i.e., the question has a single subject and a single relation, hence a single answer. For example, the question Which Harry Potter series did Rufus Scrimgeour appear in? can be answered by a single fact (Ru-fus Scrimgeour, book.book-characters.appears-in-book, Harry Potter and the Deathly Hallows). Given the simplicity of the questions, one would think this task is trivial. Yet it is far from being easy or close to being solved. The complexity lies in two aspects. One is the massive size of the knowledge graph, usually in the order of billions of facts. The other is the variability of the questions in natural language. Based on this anatomy of the problem, the solutions also consist of two steps: (1) selecting a relatively small subgraph from the knowledge graph given a question and (2) selecting the correct fact from the subgraph. Different approaches have been studied to tackle the KBSQA problems. The common solution for the first step, subgraph selection (which is also known as entity linking), is to label the question with subject part ( mention ) and nonsubject part ( pattern ) and then use the mention to retrieve related facts from the knowledge graph, constituting the subgraph. Sequence labeling models, such as a BiLSTM-CRF tagger (Huang et al., 2015), are commonly employed to label the mention and the pattern. To retrieve the subgraph, it is common to search all possible n -grams of the mention against the knowledge graph and collect the facts with matched subjects as the subgraph. The candidate facts in the subgraph may contain incorrect subjects and relations. In our running example, we first identify the mention in the question, i.e.,Rufus Scrimgeour, and then retrieve the subgraph which could contain the following facts: { (Rufus Scrimgeour, book.book-characters.appears-in-book, Harry Potter and the Deathly Hallows), (Rufus Wainwright, music.singer.singer-of, I Don't Know What That Is) } . For the second step, fact selection, a common approach is to construct models to match the mention with candidate subjects and match the pattern with candidate relations in the subgraph from the first step. For example, the correct fact is identi-fied by matching the mention Rufus Scrimgeour with candidate subjects { Rufus Scrimgeour, Rufus Wainwright } and matching the pattern Which Harry Potter series did m appear in with candidate relations { book.book-characters.appears-in-book, music.singer.singer-of } . Different neural network models can be employed (Bordes et al., 2015; Dai et al., 2016; Yin et al., 2016; Yu et al., 2017; Petrochuk and Zettlemoyer, 2018). Effective as these existing approaches are, there are three major drawbacks. (1) First, in subgraph selection, there is no effective way to deal with inexact matches and the facts in subgraph are not ranked by relevance to the mention; however, we will later show that effective ranking can substantially improve the subgraph recall. (2) Second, the existing approaches do not leverage the dependency between mentionsubjects and patternrelations; however, mismatches of mentionsubject can lead to incorrect relations and hence incorrect answers. We will later show that leveraging such dependency contributes to the overall accuracy. (3) Third, the existing approaches minimize the ranking loss (Yin et al., 2016; Lukovnikov et al., 2017; Qu et al., 2018); however, we will later show that the ranking loss is suboptimal. Addressing these points, the contributions of this paper are three-fold: (1) We propose a subgraph ranking method with combined literal and semantic score to improve the recall of the subgraph selection. It can deal with inexact match, and achieves better performance compared to the previous state of the art. (2) We propose a low-complexity joint-scoring CNN model and a well-order loss to improve fact selection. It couples the subject matching and the relation matching by learning order-preserving scores and dynamically adjusting the weights of scores. (3) We achieve better performance (85.44% in accuracy) than the previous state of the art on the SimpleQuestions dataset, surpassing the best baseline by a large margin 1 . The methods for subgraph selection fall in two schools: parsing methods (Berant et al., 2013; Yih et al., 2015; Zheng et al., 2018) and sequence tagging methods (Yin et al., 2016). The latter proves to be simpler yet effective, with the most effective model being BiLSTM-CRF (Yin et al., 2016; Dai et al., 2016; Petrochuk and Zettlemoyer, 2018). The two categories of methods for fact selection are match-scoring models and classification models. The match-scoring models employ neural networks to score the similarity between the question and the candidate facts in the subgraph and then find the best match. For instance, Bor-des et al. (2015) use a memory network to encode the questions and the facts to the same representation space and score their similarities. Yin et al. (2016) use two independent models, a character-level CNN and a word-level CNN with attentive max-pooling. Dai et al. (2016) formulate a two-step conditional probability estimation problem and use BiGRU networks. Yu et al. (2017) use two separate hierarchical residual BiLSTMs to represent questions and relations at different abstractions and granularities. Qu et al. (2018) propose an attentive recurrent neural network with similarity matrix based convolutional neural network (AR-SMCNN) to capture the semantic-level and literal-level similarities. In the classification models, Ture and Jojic (2017) employ a two-layer BiGRU model. Petrochuk and Zettlemoyer (2018) employ a BiLSTM to classify the relations and achieve the state-of-the-art performance. In addition, Mohammed et al. (2018) evaluate various strong baselines with simple neural networks (LSTMs and GRUs) or non-neural network models (CRF). Lukovnikov et al. (2017) propose an end-to-end word/character-level encoding network to rank subjectrelation pairs and retrieve relevant facts. However, the multitude of methods yield progressively smaller gains with increasing model complexity (Mohammed et al., 2018; Gupta et al., 1 Ture and Jojic (2017) reported better performance than us but neither Petrochuk and Zettlemoyer (2018) nor Mohammed et al. (2018) could replicate their result. 2018). Most approaches focus on fact matching and relation classification while assigning less emphasis to subgraph selection. They also do not sufficiently leverage the important signature of the knowledge graphthe subjectrelation dependency, namely, incorrect subject matching can lead to incorrect relations. Our approach is similar to (Yin et al., 2016), but we take a different path by focusing on accurate subgraph selection and utilizing the subjectrelation dependency. We provide a unified description of the KBSQA framework. First, we define Definition 1. Answerable Question A question is answerable if and only if one of its facts is in the knowledge graph. Let Q := { q | q is anwerable } be the set of answerable questions, and G := { ( s, r, o ) | s  S , r  R , o  O} be the knowledge graph, where S , R and O are the set of subjects, relations and objects, respectively. The triple ( s, r, o ) is a fact . By the definition of answerable questions, the key to solving the KBSQA problem is to find the fact in knowledge graph corresponding to the question , i.e., we want a map  : Q  G . Ideally, we would like this map to be injective such that for each question, the corresponding fact can be uniquely determined (more precisely, the injection maps from the equivalent class of Q to G since similar questions may have the same answer, but we neglect such difference here for simplic-ity). However, in general, it is hard to find such map directly because of (1) the massive knowledge graph and (2) natural language variations in questions. Therefore, end-to-end approaches such as parsing to structured query and encoding-decoding models are difficult to achieve (Yih et al., 2015; Sukhbaatar et al., 2015; Kumar et al., 2016; He and Golub, 2016; Hao et al., 2017). Instead, related works and this work mitigate the difficulties by breaking down the problem into the aforementioned two steps, as illustrated below: (1) Subgraph Selection: question  { mention, pattern } , mention  subgraph (2) Fact Selection: match (cid:40) mention  subject pattern  relation  ( subject, relation )  subgraph  (subject*, relation*)  object* (answer*) In the first step, the size of the knowledge graph is significantly reduced. In the second step, the variations of questions are confined to mention subject variation and patternrelation variation. Formally, we denote the questions as the union of mentions and patterns Q = M (cid:83) P and the knowledge graph as the subset of the Cartesian product of subjects, relations and objects G  S  R  O . In the first step, given a question q  Q , we find the mention via a sequence tagger  : Q  M , q (cid:55) m q . The tagged mention consists of a sequence of words m q = { w 1 , . . . , w n } and the pattern is the question excluding the mention p q = q \ m q . We denote the set of n -grams of m q as W n ( m q ) and use W n ( m q ) to retrieve the subgraph as S q  R q  O q  G q := { ( s, r, o )  G | W n ( s ) (cid:84) W n ( m q ) (cid:54) =  , n = 1 , . . . , | m q |} . Next, to select the correct fact (the answer) in the subgraph, we match the mention m q with candidate subjects in S q , and match the pattern p q with candidate relations in R q . Specifically, we want to maximize the log-likelihood (cid:40) max s S q log P ( s | m q ) max r R q log P ( r | p q ) . (1) The probabilities in (1) are modeled by P ( s | m q ) = e h ( f ( m q ) ,f ( s )) (cid:80) s (cid:48) S q e h ( f ( m q ) ,f ( s (cid:48) )) (2) P ( r | p q ) = e h ( g ( p q ) ,g ( r )) (cid:80) r (cid:48) R q e h ( g ( p q ) ,g ( r (cid:48) )) , (3) where f : M (cid:83) S  R d maps the mention and the subject onto a d -dimensional differentiable manifold embedded in the Hilbert space and similarly, g : P (cid:83) R  R d . Both f and g are in the form of neural networks. The map h : R d  R d  R is a metric that measures the similarity of the vector representations (e.g., the cosine similarity). Practically, directly optimizing (1) is difficult because the subgraph G q is large and computing the partition functions in (2) and (3) can be intractable. Alternatively, a surrogate objective, the ranking loss (or hinge loss with negative samples) (Col-lobert and Weston, 2008; Dai et al., 2016) is minimized L rank = (cid:88) q Q   (cid:88) s S q (cid:2) h f ( m q , s  )  h f ( m q , s + ) +  (cid:3) + + (cid:88) r R q (cid:2) h g ( p q , r  )  h g ( p q , r + ) +  (cid:3) +   , (4) where h f (  ,  ) = h ( f (  ) , f (  )) , h g (  ,  ) = h ( g (  ) , g (  )) ; the sign + and  indicate correct candidate and incorrect candidate, [  ] + = max(  , 0) , and  > 0 is a margin term. Other variants of the ranking loss are also studied (Cao et al., 2006; Zhao et al., 2015; Vu et al., 2016). To retrieve the subgraph of candidate facts using n -gram matching (Bordes et al., 2015), one first constructs the map from n -grams W n ( s ) to subject s for all subjects in the knowledge graph, yielding {W n ( s )  s | s  S , n = 1 , . . . , | s |} . Next, one uses the n -grams of mention W n ( m ) to match the n -grams of subjects W n ( s ) and fetches those matched facts to compose the subgraph { ( s, r, o )  G | W n ( s ) (cid:84) W n ( m ) (cid:54) =  , n = 1 , . . . | m |} . In our running example, for the mention Rufus Scrimgeour, we collect the subgraph of facts with the bigrams and unigrams of subjects matching the bigram { Rufus Scrimgeour } and unigrams { Rufus, Scrimgeour } . One problem with this approach is that the retrieved subgraph can be fairly large. Therefore, it is desirable to rank the subgraph by relevance to the mention and only preserve the most relevant facts. To this end, different ranking methods are used, such as surface-level matching score with added heuristics (Yin et al., 2016), relation detection network (Yu et al., 2017; Hao et al., 2018), term frequency-inverse document frequency (TF-IDF) score (Ture and Jojic, 2017; Mohammed et al., 2018). However, these ranking methods only consider matching surface forms and cannot handle inexact matches, synonyms, or polysemy (New York , the New York City, Big Ap-ple). This motivates us to rank the subgraph not only by literal relevance but also semantic relevance. Hence, we propose a ranking score with literal closeness and semantic closeness. Specifically, the literal closeness is measured by the length of the longest common subsequence |  | ( s, m ) between a subject s and a mention m . The semantic closeness is measured by the co-occurrence probability of the subject s and the mention m P ( s, m ) = P ( s | m ) P ( m ) = P ( w 1 , . . . w n | (cid:101) w 1 , . . . (cid:101) w m ) P ( (cid:101) w 1 , . . . (cid:101) w m ) (5) = n (cid:89) i =1 P ( w i | (cid:101) w 1 , . . . (cid:101) w m ) P ( (cid:101) w 1 , . . . (cid:101) w m ) (6) = n (cid:89) i =1 (cid:32) m (cid:89) k =1 P ( w i | (cid:101) w k ) (cid:33) P ( (cid:101) w 1 , . . . (cid:101) w m ) (7) = n (cid:89) i =1 (cid:32) m (cid:89) k =1 P ( w i | (cid:101) w k ) (cid:33) m  1 (cid:89) j =1 P ( (cid:101) w j +1 | (cid:101) w j ) P ( (cid:101) w 1 ) , (8) where from (5) to (6) we assume conditional independence of the words in subject and the words in mention; from (6) to (7) and from (7) to (8) we factorize the factors using the chain rule with conditional independence assumption. The marginal term P ( (cid:101) w 1 ) is calculated by the word occurrence frequency. Each conditional term is approximated by P ( w i | w j )  exp {  w Ti  w j } where  w i s are pre-trained GloVe vectors (Pennington et al., 2014). These vectors are obtained by taking into account the word co-occurrence probability of surrounding context. Hence, the GloVe vector space encodes the semantic closeness. In practice we use the log-likelihood as the semantic score to convert multiplication in (8) to summation and normalize the GloVe embeddings into a unit ball. Then, the score for ranking the subgraph is the weighted sum of the literal score and the semantic score score ( s, m ) =  |  | ( s, m ) + (1   ) log P ( s, m ) , (9) where  is a hyper-parameter whose value need to be tuned on the validation set. Consequently, for each question q , we can get the topn ranked subgraph G nq  as well as the corresponding topn ranked candidate subjects S nq  and relations R nq  . Once we have the ranked subgraph, next we need to identify the correct fact in the subgraph. One school of conventional methods (Bordes et al., 2014, 2015; Yin et al., 2016; Dai et al., 2016) is minimizing the surrogate ranking loss (4) where neural networks are used to transform the (subject, mention) and (relation, pattern) pairs into a Hilbert space and score them with inner product. separately, neglecting the difference of their contributions to fact matching. Given that the number of subjects (order of millions) are much larger than the number of relations (order of thousands), incorrect subject matching can lead to larger error than incorrect relation matching. Therefore, matching the subjects correctly should be given more importance than matching the relations. Further, the ranking loss is suboptimal, as it does not preserve the relative order of the matching scores. We empirically find that the ranking loss tends to bring the matching scores to the neighborhood of zero (during the training the scores shrink to very small numbers), which is not functioning as intended. To address these points, we propose a joint-scoring model with well-order loss (Figure 1). Together they learn to map from joint-input pairs to order-preserving scores supervised by a well-order loss, hence the name. The joint-scoring model takes joint-input pairs, (subject, mention) or (rela-tion, pattern), to produce the similarity scores directly. The well-order loss then enforces the well-order in scores. A well-order, first of all, is a total ordera binary relation on a set which is antisymmetric, transitive, and connex. In our case it is just the    relation. In addition, the well-order is a total order with the property that every non-empty set has a least element. The well-order restricts that the scores of correct matches are always larger or equal to the scores of incorrect matches, i.e.,  i :  j : S + i  S  j where S + i and S  i indicate the score of correct match and the score of incorrect match. We derive the well-order loss in the following way. Let S = { S 1 , . . . , S n } = S + (cid:83) S  be the set of scores where S + and S  are the set of scores with correct and incorrect matches. Let I = I + (cid:83) I  be the index set of S , | I + | = n 1 , | I  | = n 2 , n = n 1 + n 2 . Following the well-order relation inf S +  sup S    i +  I + :  i   I  : S + i +  S  i   0  (cid:88) i +  I + (cid:88) i   I  ( S + i +  S  i  )  0 (10)  n 2 (cid:88) i +  I + S + i +  n 1 (cid:88) i   I  S  i   0 , (11) where from (10) to (11) we expand the sums and reorder the terms. Consequently, we obtain the well-order loss L well-order ( S ms , S pr ) = (cid:34) | I + | (cid:88) i  S i  ms  | I  | (cid:88) i + S i + ms + | I + || I  |  (cid:35) + +   | J + | (cid:88) j  S j  pr  | J  | (cid:88) j + S j + pr + | J + || J  |    + , (12) where S ms , S pr are the scores for (mention, sub-ject), (pattern, relation) pairs for a question, I , J are the index sets for candidate subjects, relations in the ranked subgraph, + ,  indicate the correct candidate and incorrect candidate, [  ] + = max(  , 0) , and  > 0 is a margin term. Then, the objective (1) becomes min q Q , ( s,r ) S nq  R nq  (cid:34) | I + | (cid:88) i  h f ( m q , s i  )  | I  | (cid:88) i + h f ( m q , s i + ) + | I + || I  |  (cid:35) + +   | J + | (cid:88) j  h g ( p q , r j  )  | J  | (cid:88) j + h g ( p q , r j + ) + | J + || J  |    + . (13) This new objective with well-order loss differs from the ranking loss (4) in two ways, and plays a vital role in the optimization. First, instead of considering the match of mentionsubjects and patternrelations separately, (13) jointly considers both input pairs and their dependency . Specifically, (13) incorporates such dependency as the weight factors | I | (for subjects) and | J | (for re-lations). These factors are the controlling factors and are automatically and dynamically adjusted as they are the sizes of candidate subjects and relations. Further, the match of subjects, weighted by ( I + , I  ), will control the match of relations, weighted by ( J + , J  ). To see this, for a question and a fixed number of candidate facts in subgraph, | I | = | J | , the incorrect number of subjects | I  | is usually larger than the incorrect number of relations | J  | , which causes larger loss for mismatching subjects. As a result, the model is forced to match subjects more correctly, and in turn, prune the relations with incorrect subjects and reduce the size of J  , leading to smaller loss. Second, the well-order loss enforces the well-order relation of scores while the ranking loss does not have such constraint. Here, we evaluate our proposed approach for the KBSQA problem on the SimpleQuestions benchmark dataset and compare with baseline approaches. The SimpleQuestions (Bordes et al., 2015) dataset is released by the Facebook AI Research. It is the standard dataset on which almost all previous state-of-the-art literature reported their num-bers (Gupta et al., 2018; Hao et al., 2018). It also represents the largest publicly available dataset for KBSQA with its size several orders of magnitude larger than other available datasets. It has 108 , 442 simple questions with the corresponding facts from subsets of the Freebase (FB2M and FB5M). There are 1 , 837 unique relations. We use the default train, validation and test partitions (Bordes et al., 2015) with 75 , 910 , 10 , 845 and 21 , 687 questions, respectively. We use FB2M with 2 , 150 , 604 entities, 6 , 701 relations and 14 , 180 , 937 facts, respectively. For sequence tagging, we use the same BiLSTM-CRF model as the baseline (Dai et al., 2016) to label each word in the question as either subject or non-subject. The configurations of the model (Table 1) basically follow the baseline (Dai et al., 2016). For subgraph selection, we use only unigrams of the tagged mention to retrieve the candidate facts (see Section 3.2) and rank them by the proposed relevance score (9) with the tuned weight  = 0 . 9 (hence more emphasizing on literal matching). We select the facts with topn scores as the subgraphs and compare the corresponding recalls with the baseline method (Yin et al., 2016). For fact selection, we employ a character-based CNN (CharCNN) model to score (mention, subject) pairs and a word-based CNN (WordCNN) model to score (pattern, relation) pairs (with model configurations shown in Table 2), which is similar to one of the state-of-the-art baselines AMPCNN (Yin et al., 2016). In fact, we first replicated the AMPCNN model and achieved comparable results, and then modified the AMPCNN model to take joint inputs and output scores directly (see Section 3.3 and Figure 1). Our CNN models have only two convolutional layers (ver-sus six convolutional layers in the baseline) and have no attention mechanism, bearing much lower complexity than the baseline. The CharCNN and WordCNN differ only in the embedding layer, the former using character embeddings and the latter using word embeddings. The optimizer used for training the models is Adam (Kingma and Ba, 2014). The learning configurations are shown in Table 3. For the hyper-parameters shown in Table 1, 2 and 3, we basically follow the settings in baseline literature (Yin et al., 2016; Dai et al., 2016) to promote a fair comparison. Other hyper-parameters, such as the  in the relevance score (9), are tuned on the validation set. Our proposed approach and the baseline approaches are evaluated in terms of (1) the topn subgraph selection recall (the percentage of questions that have the correct subjects in the top-n candidates) and (2) the fact selection accuracy (i.e., the overall question answering accuracy). Subgraph selection The subgraph selection results for our approach and one of the state-of-the-art baselines (Yin et al., 2016) are summarized in Table 4. Both the baseline and our approach use unigrams to retrieve candidates. The baseline ranks the candidates by the length of the longest common subsequence with heuristics while we rank the candidates by the joint relevance score de-fined in (9). We see that the literal score used in the baseline performs well and using the semantic score (the log-likelihood) (8) only does not outperform the baseline (except for the top50 case). This is due to the nature of how the questions in the SimpleQuestions dataset are generatedthe majority of the questions only contain mentions matching the subjects in the Freebase in the lexical level, making the literal score sufficiently effective. However, we see that combining the literal score and semantic score outperforms the baseline by a large margin. For top1 , 5 , 10 , 20 , 50 recall our ranking approach surpasses the baseline by 11 . 9 %, 5 . 4 %, 4 . 6 %, 3 . 9 %, 4 . 1 %, respectively. Our approach also surpasses other baselines (Lukovnikov et al., 2017; Yu et al., 2017; Qu et al., 2018; Gupta et al., 2018) under the same settings. We note that the recall is not monotonically Rank Method Top-N Recall |  | + heuristics 1 0.736 Literal: 5 0.850 10 0.874 20 0.888 (Yin et al., 2016) 50 0.904 100 0.916 log P 1 0.482 Semantic: 10 0.753 20 0.854 50 0.921 100 0.848 0 . increasing with the topn . The reason is that, as opposed to conventional methods which rank the entire subgraph returned from unigram matching to select the topn candidates, we choose only the first 200 candidates from the subgraph and then rank them with our proposed ranking score. This is more efficient, but at the price of potentially dropping the correct facts. One could trade effi-ciency for accuracy by ranking all the candidates in the subgraph. Fact selection The fact selection results for our approach and baselines are shown in Table 5. The object accuracy is the same as the overall question answer accuracy. Recall that in Section 3.3 we explained that the weight components in the well-order loss (13) are adjusted dynamically in the training to impose a larger penalty for mentionsubject mismatches and hence enforce correct matches. This can be observed by looking at the different loss components and weights as well the subject and relation matching accuracies during the training. As weights for mention subject matches increase, the losses for mention subject matches also increase, while both the errors for mentionsubject matches and pattern relation matches are high. To reduce the errors, the model is forced to match mentionsubject more correctly. As a result, the corresponding weights and losses decrease, and both mentionsubject and patternrelation match accuracies increase. Effectiveness of well-order loss and joint-Approach Obj. scoring model The first and second row of Table 5 are taken from the baseline AMPCNN (Yin et al., 2016) and BiLSTM (Petrochuk and Zettlemoyer, 2018) (the state of the art prior to our work 2 ). The third row shows the accuracy of the baseline with our proposed well-order loss and we see a 1 . 3 % improvement, demonstrating the effectiveness of the well-order loss. Further, the fourth row shows the accuracy of our joint-scoring (JS) model with well-order loss and we see a 3 % improvement over the best baseline 3 , demonstrating the effectiveness of the joint-scoring model. Effectiveness of subgraph ranking The fifth row of Table 5 shows the accuracy of our joint-scoring model with well-order loss and top50 ranked subgraph and we see a further 4 . 3 % improvement over our model without subgraph ranking (the fourth row), and a 7 . 3 % improvement over the best baseline. In addition, the subject accuracy increases by 4 . 0 %, which is due to the subgraph ranking. Interestingly, the relation accuracy increases by 7 . 8 %, which supports our claim that improving subject matching can improve relation matching. This demonstrates the effectiveness of our subgraph ranking and joint-scoring approach. The sixth row shows the accuracy of our joint-scoring model with well-order loss and only the top1 subject. In this case, the subject accuracy is limited by the top1 recall which is 85 . 5 %. Despite that, our approach outperforms the best baseline by 1 . 2 %. Further, the relation accuracy increases by 7 . 1 % over the fifth row, because restricting the subject substantially confines 2 As noted, Ture and Jojic (2017) reported better performance than us but neither Petrochuk and Zettlemoyer (2018) nor Mohammed et al. (2018) could replicate their result. the choice of relations. This shows that a sufficiently high top1 subgraph recall reduces the need for subject matching. In order to analyze what constitutes the errors of our approach, we select the questions in the test set for which our best model has predicted wrong answers, and analyze the source of errors (see Table 6). We observe that the errors can be categorized as follows: (1) Incorrect subject prediction; however, some subjects are actually correct, e.g., the prediction New York v.s. New York City. (2) Incorrect relation prediction; however, some relations are actually correct, e.g., the prediction fictional-universe.fictional-character.character-created-by v.s. book.written-work.author in the question Who was the writer of Dark Sun? and music.album.genre v.s. music.artist.genre. (3) Incorrect prediction of both. However, these three reasons only make up 59.43% of the errors. The other 40.57% errors are due to: (4) Ambiguous questions, which take up the majority of the errors, e.g., Name a species of fish. or What movie is a short film? These questions are too general and can have multiple correct answers. Such issues in the SimpleQuestions dataset are analyzed by Petrochuk and Zettlemoyer (2018) (see further discussion on this at the end of this Section). (5) Non-simple questions, e.g., Which drama film was released in 1922? This question requires two KB facts instead of one to answer correctly. (6) Wrong fact questions where the reference fact is non-relevant, e.g., What is an active ingredient in Pacific? is labeled with Triclosan 0.15 soap. (7) Out of scope questions, which have entities or relations out the scope of FB2M. (8) Spelling inconsistencies, e.g., the predicted answer Operation Shylock: A Con-fession v.s. the reference answer Operation Shy-lock, and the predicted answer Tom and Jerry: Robin Hood and His Merry Mouse v.s. the reference answer Tom and Jerry. For these cases, even when the models predict the subjects and relations correctly, these questions are fundamentally unanswerable . Although these issues are inherited from the dataset itself, given the large size of the dataset and the small proportion of the problematic questions, it is sufficient to validate the reliability and significance of our performance improvement and conclusions. Answerable Questions Redefined Petrochuk and Zettlemoyer (2018) set an upper bound of 83.4% for the accuracy on the SimpleQuestions dataset. However, our models are able to do better than the upper bound. Are we doing something wrong? Petrochuk and Zettlemoyer (2018) claim that a question is unanswerable if there exist multiple valid subjectrelation pairs in the knowledge graph, but we claim that a question is unanswerable if and only if there is no valid fact in the knowledge graph. There is a subtle difference between these two claims. Based on different definitions of answerable questions, we further claim that incorrect subject or incorrect relation can still lead to a correct answer. For example, for the question What is a song from Hier Komt De Storm? with the fact (Hier Komt De Storm: 1980-1990 live, music.release.track-list, Stephanie), our predicted subject Hier Komt De Storm: 1980-1990 live does not match the reference subject Hier Komt De Storm, but our model predicts the correct answer Stephanie because it can deal with inexact match of the subjects. In the second example, for the question Arkham House is the publisher behind what novel?, our predicted relation book.book-edition.publisher does not match the reference relation book.publishing-company.books-published, but our model predicts the correct answer Watchers at the Strait Gate because it can deal with paraphrases of relations. In the third example, for the question Who was the king of Lydia and Croesus's fa-ther?, the correct subject Croesus ranks second in our subject predictions and the correct relation people.person.parents ranks fourth in our relation predictions, but our model predicts the correct answer Alyattes of Lydia because it reweighs the scores with respect to the subjectrelation dependency and the combined score of subject and relation ranks first. To summarize, the reason that we are able to redefine answerable questions and achieve significant performance gain is that we take advantage of the subgraph ranking and the subjectrelation dependency. In this work, we propose a subgraph ranking method and joint-scoring approach to improve the performance of KBSQA. The ranking method combines literal and semantic scores to deal with inexact match and achieves better subgraph selection results than the state of the art. The joint-scoring model with well-order loss couples the dependency of subject matching and relation matching and enforces the order of scores. Our proposed approach achieves a new state of the art on the SimpleQuestions dataset, surpassing the best baseline by a large margin. In the future work, one could further improve the performance on simple question answering tasks by exploring relation ranking, different embedding strategies and network structures, dealing with open questions and out-of-scope questions. One could also consider extending our approach to complex questions, e.g., multi-hop questions where more than one supporting facts is required. Potential directions may include ranking the subgraph by assigning each edge (relation) a closeness score and evaluating the length of the shortest path between any two path-connected entity nodes. The authors would like to thank anonymous reviewers. The authors would also like to thank Nikko Strom and other Alexa AI team members for their feedback.
abstain abstain abstain abstain objective objective objective abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain abstain abstain abstain objective abstain objective result objective objective abstain result other other other other other other other other other other other other other abstain other other other method method abstain abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain method abstain abstain other abstain abstain abstain other abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain method other other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain result abstain result result abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain result abstain result abstain abstain result abstain abstain result abstain abstain result other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain abstain objective abstain objective abstain other other