Proceedings of the the 3rd Workshop on EVENTS: Definition, Detection, Coreference, and Representation 2015
DOI: 10.3115/v1/w15-0811
|View full text |Cite
|
Sign up to set email alerts
|

Identifying Various Kinds of Event Mentions in K-Parser Output

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…For semantic analysis, in absence of clear approaches for quantification, we observe the output of a knowledge parser, K-Parser (Sharma et al 2015), and report most frequent entities and their semantic roles (Palmer, Gildea, and Kingsbury 2005).…”
Section: Authors' Style Analysismentioning
confidence: 99%
“…For semantic analysis, in absence of clear approaches for quantification, we observe the output of a knowledge parser, K-Parser (Sharma et al 2015), and report most frequent entities and their semantic roles (Palmer, Gildea, and Kingsbury 2005).…”
Section: Authors' Style Analysismentioning
confidence: 99%
“…The automatic development of such representations boils down to the well known complex problem of translating a natural language text into its formal meaning representation. Among these works, only the work of (Sharma et al, 2015b) accepts natural language knowledge sentences which it automatically converts into their required graphical representation (Sharma et al, 2015a). The remaining two (Bailey et al, 2015;Schüller, 2014) requires the knowledge to be provided in a logical form.…”
Section: Related Workmentioning
confidence: 99%
“…Graphical meaning representations are popular for natural languages such as English. It is because of their simplicity, readability and ability to be easily processed, that in the recent years there has been a significant amount of progress (Sharma et al 2015a;Banarescu et al 2013) in defining graphical representations for natural language and development of systems which can automatically parse a natural language text into those representations. Inspired by such representations, in this work we use a graphical schema to represent the sentences in a WSC problem, and a piece of knowledge.…”
Section: Graphical Representation Of a Wsc Problemmentioning
confidence: 99%
“…All the edges labels other than instance of part of a predefined set of binary relations between two nodes (as mentioned in the Definition 4). In this work, these relations are from the relations in a semantic parser called K-Parser (Sharma et al 2015a).…”
Section: Graphical Representation Of a Wsc Problemmentioning
confidence: 99%