Abstract
In this paper we show how our semantic parser (Knowledge Parser or K-Parser) identifies various kinds of event mentions in the input text. The types include recursive (complex) and non recursive event mentions. K-Parser outputs each event mention in form of an acyclic graph with root nodes as the verbs that drive those events. The children nodes of the verbs represent the entities participating in the events, and their conceptual classes. The on-line demo of the system is available at http://kparser.org.
Cite
CITATION STYLE
Sharma, A., Vo, N. H., Aditya, S., & Baral, C. (2015). Identifying Various Kinds of Event Mentions in K-Parser Output. In NAACL HLT 2015 - 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the 3rd Workshop on EVENTS: Definition, Detection, Coreference, and Representation, EVENTS 2015 (pp. 82–88). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/w15-0811
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
