• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Qi Le, Zhang Yu, Liu Ting. Question Similarity Calculation Based on Key Information[J]. Journal of Computer Research and Development, 2018, 55(7): 1539-1547. DOI: 10.7544/issn1000-1239.2018.20170507
Citation: Qi Le, Zhang Yu, Liu Ting. Question Similarity Calculation Based on Key Information[J]. Journal of Computer Research and Development, 2018, 55(7): 1539-1547. DOI: 10.7544/issn1000-1239.2018.20170507

Question Similarity Calculation Based on Key Information

More Information
  • Published Date: June 30, 2018
  • Question similarity calculation is a major task in community question answering (CQA). It is helpful to retrieve relevant question-answer pairs from QA community by leveraging the similarity among queries. Questions in CQA are usually composed of topics and descriptions, which are both important in the task of question similarity calculation. In addition, due to the openness of the CQA, the length of questions is different. Meanwhile, background information of the questions will interfere with the judgment on question similarity. In order to reduce the influence of the irrelevant content and the various length of questions, the keywords are extracted from the descriptions of questions. Then, the keywords are fed to the CNN-based model to extract the similar and dissimilar information between texts. At the same time, in order to make better use of the information about the question topic, the model also combines the feature from the similarity between them. In summary, the model treats the keywords and topics as the key information about the questions, and uses the information to calculate similarity between them. The model is experimented on the question similarity task of the SemEval2017. The mean average precision (MAP) reaches 49.65%, which exceeds the best result in the evaluation.
  • Related Articles

    [1]Zhang Chao, Sun Guangyu, Zhang Xueying, Zhao Weisheng. Thermal Modeling and Management for Shift Operations of Racetrack Memory[J]. Journal of Computer Research and Development, 2017, 54(1): 154-162. DOI: 10.7544/issn1000-1239.2017.20150903
    [2]Zhang Fengjun, Zhao Ling, An Guocheng, Wang Hongan, Dai Guozhong. Mean Shift Tracking Algorithm with Scale Adaptation[J]. Journal of Computer Research and Development, 2014, 51(1): 215-224.
    [3]Guo Husheng, Wang Wenjian. A Support Vector Machine Learning Method Based on Granule Shift Parameter[J]. Journal of Computer Research and Development, 2013, 50(11): 2315-2324.
    [4]Wang Gang and Luo Zhigang. A Polynomial Time Approximation Scheme for the Traveling Salesman Problem in Curved Surfaces[J]. Journal of Computer Research and Development, 2013, 50(3): 657-665.
    [5]Rong Chuitian, Xu Tianren, Du Xiaoyong. Partition-Based Set Similarity Join[J]. Journal of Computer Research and Development, 2012, 49(10): 2066-2076.
    [6]Liu Jie, Liang Huaguo, Jiang Cuiyun. Test Compression Approach of Adopting Cyclic Shift and Optimal Coding[J]. Journal of Computer Research and Development, 2012, 49(4): 873-879.
    [7]Yuan Guanglin, Xue Mogen, Han Yusheng, Zhou Pucheng. Mean Shift Object Tracking Based on Adaptive Multi-Features Fusion[J]. Journal of Computer Research and Development, 2010, 47(9): 1663-1671.
    [8]Tang Yang, Pan Zhigeng, Tang Min, Pheng Ann Heng, Xia Deshen. Image Segmentation with Hierarchical Mean Shift[J]. Journal of Computer Research and Development, 2009, 46(9): 1424-1431.
    [9]Zhao Weizhong, Feng Haodi, and Zhu Daming. Improvement and Implementation of a Polynomial Time Approximation Scheme for Euclidean Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1790-1795.
    [10]Wang Yiran, Chen Li, Feng Xiaobing, Zhang Zhaoqing. Global Partial Replicate Computation Partitioning[J]. Journal of Computer Research and Development, 2006, 43(12): 2158-2165.

Catalog

    Article views (1221) PDF downloads (520) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return