• Aucun résultat trouvé

Deep Approaches to Semantic Text Matching

N/A
N/A
Protected

Academic year: 2022

Partager "Deep Approaches to Semantic Text Matching"

Copied!
1
0
0

Texte intégral

(1)

Deep Approaches to Semantic Text Matching

Jun Xu

Chinese Academy of Sciences Beijing, China

junxu@ict.ac.cn

Abstract

Semantic matching is critical in many text applications, including paraphrase identification, information re- trieval, and question answering. A variety of machine learning techniques have been developed for various semantic matching tasks, referred to as “learning to match”. Recently, deep learning approaches have shown their effectiveness in this area, and a number of methods have been proposed. In this talk, I will discuss the deep solutions to semantic matching from the aspects of the word and the sentence. At the word-level matching, I will discuss the distributed word representations that bridge the semantic gap between different words. At the sentence-level matching, I will discuss the matching methods that capture the proximity and text matching patterns. Potential applications and future directions of semantic text matching will also be discussed.

Bio

Dr. Jun Xu received his Ph.D. in Computesr Science from Nankai University, China, in 2006. After that, he worked as an associate researcher, researcher, and senior researcher at Microsoft Research Asia and Huawei Noah’s Ark Lab. In 2014, he joined Institute of Computing Technology, Chinese Academy of Sciences. Jun Xu’s research interests focus on applying machine learning to information retrieval. He has about 40 papers at top international journals and conferences, including TOIS, JMLR, SIGIR, WWW etc. He has also been active in the research communities and severed or is serving the top conferences and journals. For example, in 2017, he was the Senior PCs/Area Chairs of SIGIR ’17 and ACML 2017; PC members of KDD ’17, NIPS ’17, CIKM ’17, and WSDM ’17; reviewers of TOIS, JMLR, and TKDE etc.

Copyrightc by the paper’s authors. Copying permitted for private and academic purposes.

In: L. Dietz, C. Xiong, E. Meij (eds.): Proceedings of the First Workshop on Knowledge Graphs and Semantics for Text Retrieval and Analysis (KG4IR), Tokyo, Japan, 11-Aug-2017, published at http://ceur-ws.org

2

Références

Documents relatifs

Existing methods use logical reasoning over computed equivalence relationships or machine learning based on lex- ical and structural features of ontology elements [7, 3].. While

Most of the tasks in natural language processing and information retrieval, in- cluding search, question answering, and machine transla- tion, are based on matching between

Most interestingly, we will present tree kernels exploiting SM between words contained in a text structure, i.e., the Syntactic Semantic Tree Kernels (SSTK) [1] and the Smoothed

Unlike other information retrieval tasks, in non-factoid Question Answering the linguistic analysis of both questions and candidate answers (usually short passages) has proven to

Generation rules take the (simplified) semantic network of the question (the queried network part), the sentence type of the question, and the matching semantic network from

We propose a multi-model fusion approach to this semantic matching task and experi- mented on standard data set provided by CCKS, which includes 100,000 pairs of train- ing

Structured information is best represented in a knowledge base (the semantics is then explicit in the data) but the bulk of our knowledge of the world will always be in the form

The classification task and retrieval task are developed based on the distributional representation of the text by utilizing term - document matrix and non-negative