A General and Flexible Multi-concept Parsing Framework for Multilingual Semantic Matching
<|reference_start|>A General and Flexible Multi-concept Parsing Framework for Multilingual Semantic Matching: Sentence semantic matching is a research hotspot in natural language processing, which is considerably significant in various key scenarios, such as community question answering, searching, chatbot, and recommendation. Since most of the advanced models directly model the semantic relevance among words between two sentences while neglecting the \textit{keywords} and \textit{intents} concepts of them, DC-Match is proposed to disentangle keywords from intents and utilizes them to optimize the matching performance. Although DC-Match is a simple yet effective method for semantic matching, it highly depends on the external NER techniques to identify the keywords of sentences, which limits the performance of semantic matching for minor languages since satisfactory NER tools are usually hard to obtain. In this paper, we propose to generally and flexibly resolve the text into multi concepts for multilingual semantic matching to liberate the model from the reliance on NER models. To this end, we devise a \underline{M}ulti-\underline{C}oncept \underline{P}arsed \underline{S}emantic \underline{M}atching framework based on the pre-trained language models, abbreviated as \textbf{MCP-SM}, to extract various concepts and infuse them into the classification tokens. We conduct comprehensive experiments on English datasets QQP and MRPC, and Chinese dataset Medical-SM. Besides, we experiment on Arabic datasets MQ2Q and XNLI, the outstanding performance further prove MCP-SM's applicability in low-resource languages.<|reference_end|>
@article{yao2024a,
    title={A General and Flexible Multi-concept Parsing Framework for Multilingual
  Semantic Matching},
    author={Dong Yao},
    journal={arXiv preprint arXiv:2403.02975},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.02975},
    primaryClass={cs.CL cs.AI}
}