Abstract
Relation extraction is an important part of the information extraction. Nowadays, researches focus on tree kernels based solutions that employ different tree structures and kernel functions. since those solutions fail to employ semantic feature effectively and have a low Recall, this paper proposes a novel convolution kernel model based on semantic feature and instances partition. This model involves synonym information as a node in a parse tree, varies partial trees as instances partition and uses the convolution tree kernel function for similarity calculation which outputs data for SVM classifier. the experimental results show that the uses of synonyms and instances partition improve the performance of relation extraction.
Published Version
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.
