Mechanisms for compressing text have been studied for many years, and a wide range of effective methods has been developed. But compression of text makes it unwieldy in other ways – it must be decompressed before being viewed, and it is harder to directly search. One way of addressing these concerns is to build an index for the source document, and search via a query interface [Witten et al., 1...

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

We describe an approach for answer selection in a free form question answering task. In order to go beyond the key-word based matching in selecting answers to questions, one would like to incorporate both syntactic and semantic information in the question answering process. We achieve this goal by representing both questions and candidate passages using dependency trees, and incorporating seman...

Daunting for users to formulate precise queries and search correct answers. Therefore, approximate matching is introduced to trot out the problem in respondent users’ queries, and this matching might be addressed by 1st reposeful the structure and content of a given question, so longing for answers that match the relaxed queries. Ranking and returning the foremost relevant results of a question...

Matching a question to its best answer is a common task in community question answering. In this paper, we focus on the non-factoid questions and aim to pick out the best answer from its candidate answers. Most of the existing deep models directly measure the similarity between question and answer by their individual sentence embeddings. In order to tackle the problem of the information lack in...

In this paper, we propose a method to introduce an A search control into sentential matching mechanism for question-answering systems, in order to reduce the response time while the accuracy of the answer is preserved. The question answering is a new technology to retrieve not relevant documents but the answer(s) directly by combining several methodology including IR and IE. One of the essentia...

In this paper, motivated by a question posed H. de Alba and D. T. Hoang, we introduce strongly biconvex graphs as subclass of weakly chordal bipartite graphs. We give linear time algorithm to find an induced matching for such prove that indeed gives maximum matching. Applying algorithm, provide graph whose (monomial) edge ideal does not admit unique extremal Betti number. Using constructed grap...

Question answering is an important task in machine comprehension. The new SQuAD dataset allows us to deploy recent NLP deep learning techniques and train an end-to-end system to predict the start and end position of the answer in the given context, instead of precisely selecting the words of the correct answer. We propose to use combine bi-directional LSTM (BiLSTM) and context matching to devel...