Machine comprehension, an unsolved problem in machine learning, enables a machine to process a passage and answer associated questions with a high level of accuracy that matches human performance. We use the SQuAD dataset, which simplifies the question-answer process, where the answer is defined by the starting and ending indices of its location in the context paragraph. In this paper, we explo...

Question answering task is now being done in TREC8 using English documents. We examined question answering task in Japanese sentences. Our method selects the answer by matching the question sentence with knowledge-based data written in natural language. We use syntactic information to obtain highly accurate answers.

QA matching is a very important task in natural language processing, but current research on text focuses more short rather than long matching. Compared with matching, rich information, distracting information frequent. This paper extracted question-and-answer pairs about psychological counseling to QA-matching technology based deep learning. We adjusted DSSM (Deep Structured Semantic Model) ma...

We train a model that combines attention with multi-perspective matching to perform question answering. For each question and context pair in SQuAD, we perform an attention calculation over each context before extracting features of the question and context, matching them from multiple perspectives. Whilst we did not have time to perform a hyper-parameter search or incorporate other features in...

We describe an approach for answer selection in a free form question answering task. In order to go beyond a key-word based matching in selecting answers to questions, one would like to develop a principled way for the answer selection process that incorporates both syntactic and semantic information. We achieve this goal by (1) representing both questions and candidate passages using dependenc...

It is a longstanding open problem whether there exists a polynomial size description of the perfect matching polytope. We give a partial answer to this question by proving the following result. The polyhedron defined by the constraints of the perfect matching polytope which are active at a given perfect matching can be obtained as the projection of a compact polyhedron. Thus there exists a comp...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

Matching is an extensively studied topic. The question we want to study here is the lower bound of a maximum matching in a graph. Earlier researchers studied the problem of the existence of a perfect matching (i.e. a matching of size n/2 with n vertices in a graph). Petersen [7] showed that a bridgeless cubic graph has a perfect matching. König [4] showed that there exists a perfect matching in...

schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...

IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this note, we resolve the question and prove that, contrary to the expectations of the authors, the given problem is strongly NP-hard (already in the simplest non-trivial case of four layers). Hence it is unlikely that the...