Relation classification is an important semantic processing task for which state-ofthe-art systems still rely on costly handcrafted features. In this work we tackle the relation classification task using a convolutional neural network that performs classification by ranking (CR-CNN). We propose a new pairwise ranking loss function that makes it easy to reduce the impact of artificial classes. We perform experiments using the the SemEval-2010 Task 8 dataset, which is designed for the task of classifying the relationship between two nominals marked in a sentence. Using CRCNN, we outperform the state-of-the-art for this dataset and achieve a F1 of 84.1 without using any costly handcrafted features. Additionally, our experimental results show that: (1) our approach is more effective than CNN followed by a softmax classifier; (2) omitting the representation of the artificial class Other improves both precision and recall; and (3) using only word embeddings as input features is enough to achieve state-of-the-art results if we consider only the text between the two target nominals.
Multi-Perspective Relevance Matching with Hierarchical ConvNets for Social Media Search
University of Maryland, College Park(马里兰大学帕克分校);Facebook Conversational AI(Facebook 对话人工智能);University of Waterloo(滑铁卢大学);Stanford University(斯坦福大学);Comcast Applied AI Research(康卡斯特应用人工智能研究)
Combining Recurrent and Convolutional Neural Networks for Relation Classification
Center for Information and Language Processing, LMU Munich(慕尼黑大学信息与语言处理中心);Institute for Natural Language Processing, University of Stuttgart(斯图加特大学自然语言处理研究所);Siemens Corporate Technology(西门子中央研究院)