This paper describes experiments in Japanese question classification, comparing methods based on pattern matching and machine learning. Classification is attempted over named entity taxonomies of various sizes and shapes. Results show that the machine learning based method achieves much better accuracy than pattern matching, even with a relatively small amount of training data. Larger taxonomie...

We prove that in all regular robust expanders G $$ , every edge is asymptotically equally likely contained a uniformly chosen perfect matching M . also show given any fixed or spanning graph N the random variable | ∩ E ( ) \mid M\cap E(N)\mid approximately Poisson distributed. This particular confirms conjecture and question due to Spiro Surya, complements results Kahn Kim who proved vertex mat...

An input to the Popular Matching problem, in the roommates setting, consists of a graph G and each vertex ranks its neighbors in strict order, known as its preference. In the Popular Matching problem the objective is to test whether there exists a matching M such that there is no matching M where more people are happier with M than with M. In this paper we settle the computational complexity of...

In recent years, deep neural models have been widely adopted for text matching tasks, such as question answering and information retrieval, showing improved performance as compared with previous methods. In this paper, we introduce the MatchZoo toolkit that aims to facilitate the designing, comparing and sharing of deep text matching models. Speci€cally, the toolkit provides a uni€ed data prepa...

Deep neural networks have been successfully applied to many text matching tasks, such as paraphrase identification, question answering, and machine translation. Although ad-hoc retrieval can also be formalized as a text matching task, few deep models have been tested on it. In this paper, we study a state-of-the-art deep matching model, namely MatchPyramid, on the ad-hoc retrieval task. The Mat...

Many tasks in natural language processing, ranging from machine translation to question answering, can be reduced to the problem of matching two sentences or more generally two short texts. We propose a new approach to the problem, called Deep Match Tree (DEEPMATCHtree), under a general setting. The approach consists of two components, 1) a mining algorithm to discover patterns for matching two...

Abstract The well-known -complete problem Matching Cut is to decide if a graph has matching that also an edge cut of the graph. We prove new complexity results for restricted H -free graphs, is, graphs do not contain some fixed as induced subgraph. two recently studied variants , on graphs. first variant requires must be extendable perfect second matching. In particular, we there exists small c...

In this talk, we will give a high level introduction to our book entitled “Semantic Matching in Search”, which was published recently in Foundations and Trends in Information Retrieval [1]. We will start our talk by pointing out the importance of semantic matching for natural language processing and information retrieval. Most of the tasks in natural language processing and information retrieva...

How many edges can there be in a maximum matching in a complete multipartite graph? Several cases where the answer is known are discussed, and then a new formula is given which answers this question.