Product Community Question Answering (PCQA) provides useful information about products and their features (aspects) that may not be well addressed by product descriptions and reviews. We observe that a product's compatibility issues with other products are frequently discussed in PCQA and such issues are more frequently addressed in accessories, i.e., via a yes no question "Does this mouse work with windows 10?". In this paper, we address the problem of extracting compatible and incompatible products from yes no questions in PCQA. This problem can naturally have a two-stage framework: first, we perform Complementary Entity (product) Recognition (CER) on yes no questions; second, we identify the polarities of yes no answers to assign the complementary entities a compatibility label (compatible, incompatible or unknown). We leverage an existing unsupervised method for the first stage and a 3-class classifier by combining a distant PU-learning method (learning from positive and unlabeled examples) together with a binary classifier for the second stage. The benefit of using distant PU-learning is that it can help to expand more implicit yes no answers without using any human annotated data. We conduct experiments on 4 products to show that the proposed method is effective.
Determining the polarity of a yes no answer is closely related to answer summarization subtask B in SemEval-2015 Task 3 @cite_10 . The proposed problem differs from this subtask B in that our problem indirectly utilizes the polarity of an answer to classify complementary entity rather than directly summarizes the usefulness of an answer to a question. McAuley et. al @cite_7 classifies the polarity of a PCQA answer by simply training an SVM on unigrams of labeled answers. From their predictions, we observe that they may only label explicit yes no answers (e.g., answers begin with a Yes'' or No'') and put many implicit answers (e.g., I think it works.'' implies a answer) as . Identifying more implicit yes or no answer is crucial to the proposed problems since a complementary entity does not provide much information without its compatibility label (, or ).
@cite_10 @cite_7
2585949068 2251181482 2952228917 2522258376
Product Community Question Answering (PCQA) provides useful information about products and their features (aspects) that may not be well addressed by product descriptions and reviews. We observe that a product's compatibility issues with other products are frequently discussed in PCQA and such issues are more frequently addressed in accessories, i.e., via a yes no question "Does this mouse work with windows 10?". In this paper, we address the problem of extracting compatible and incompatible products from yes no questions in PCQA. This problem can naturally have a two-stage framework: first, we perform Complementary Entity (product) Recognition (CER) on yes no questions; second, we identify the polarities of yes no answers to assign the complementary entities a compatibility label (compatible, incompatible or unknown). We leverage an existing unsupervised method for the first stage and a 3-class classifier by combining a distant PU-learning method (learning from positive and unlabeled examples) together with a binary classifier for the second stage. The benefit of using distant PU-learning is that it can help to expand more implicit yes no answers without using any human annotated data. We conduct experiments on 4 products to show that the proposed method is effective. Continuous word and phrase vectors have proven useful in a number of NLP tasks. Here we describe our experience using them as a source of features for the SemEval-2015 task 3, consisting of two community question answering subtasks: Answer Selection for categorizing answers as potential, good, and bad with regards to their corresponding questions; and YES NO inference for predicting a yes, no, or unsure response to a YES NO question using all of its good answers. Our system ranked 6th and 1st in the English answer selection and YES NO inference subtasks respectively, and 2nd in the Arabic answer selection subtask. Problems at the intersection of vision and language are of significant importance both as challenging research questions and for the rich set of applications they enable. However, inherent structure in our world and bias in our language tend to be a simpler signal for learning than visual modalities, resulting in models that ignore visual information, leading to an inflated sense of their capability. We propose to counter these language priors for the task of Visual Question Answering (VQA) and make vision (the V in VQA) matter! Specifically, we balance the popular VQA dataset by collecting complementary images such that every question in our balanced dataset is associated with not just a single image, but rather a pair of similar images that result in two different answers to the question. Our dataset is by construction more balanced than the original VQA dataset and has approximately twice the number of image-question pairs. Our complete balanced dataset is publicly available at this http URL as part of the 2nd iteration of the Visual Question Answering Dataset and Challenge (VQA v2.0). We further benchmark a number of state-of-art VQA models on our balanced dataset. All models perform significantly worse on our balanced dataset, suggesting that these models have indeed learned to exploit language priors. This finding provides the first concrete empirical evidence for what seems to be a qualitative sense among practitioners. Finally, our data collection protocol for identifying complementary images enables us to develop a novel interpretable model, which in addition to providing an answer to the given (image, question) pair, also provides a counter-example based explanation. Specifically, it identifies an image that is similar to the original image, but it believes has a different answer to the same question. This can help in building trust for machines among their users. This paper proposes to improve visual question answering (VQA) with structured representations of both scene contents and questions. A key challenge in VQA is to require joint reasoning over the visual and text domains. The predominant CNN LSTM-based approach to VQA is limited by monolithic vector representations that largely ignore structure in the scene and in the form of the question. CNN feature vectors cannot effectively capture situations as simple as multiple object instances, and LSTMs process questions as series of words, which does not reflect the true complexity of language structure. We instead propose to build graphs over the scene objects and over the question words, and we describe a deep neural network that exploits the structure in these representations. This shows significant benefit over the sequential processing of LSTMs. The overall efficacy of our approach is demonstrated by significant improvements over the state-of-the-art, from 71.2 to 74.4 in accuracy on the "abstract scenes" multiple-choice benchmark, and from 34.7 to 39.1 in accuracy over pairs of "balanced" scenes, i.e. images with fine-grained differences and opposite yes no answers to a same question.