Abstract
Named entity linking(NEL) for Chinese short text is regard as a ranking task. Current research on NEL is mostly about long text and rich language, which may unfit Chinese short text situation. We propose a multi-cross matching network(CMN) to solve these problems. CMN first matches a candidate and the mention with the text in three different degree, and extracts important matching information through a couple of convolution and pooling layers. Then sequence vectors are accumulated through a Gated Recurrent Unit(GRU) which distill relationships among words in texts. Finally we use dynamic average algorithm to calculate the mention-entity similarity. Experimental results demonstrate that CMN exhibits the outstanding performance on several Chinese datasets for the Chinese short text entity linking problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
