Classifying Semantic Clause Types: Modeling Context and Genre Characteristics with Recurrent Neural Networks and Attention
Detecting aspectual properties of clauses in the form of situation entity types has been shown to depend on a combination of syntactic-semantic and contextual features. We explore this task in a deep-learning framework, where tuned word representations capture lexical, syntactic and semantic features. We introduce an attention mechanism that pinpoints relevant context not only for the current instance, but also for the larger context. Apart from implicitly capturing task relevant features, the advantage of our neural model is that it avoids the need to reproduce linguistic features for other languages and is thus more easily transferable. We present experiments for English and German that achieve competitive performance. We present a novel take on modeling and exploiting genre information and showcase the adaptation of our system from one language to another.
Code (0)
등록된 구현이 없습니다.
Tasks
Feature EngineeringGeneral ClassificationLanguage ModelingLanguage ModellingRelation ClassificationSentence ClassificationWord EmbeddingsSimilar Papers 제목 키워드 기반
Building Context-aware Clause Representations for Situation Entity Type Classification
Capabilities to categorize a clause based on the type of situation entity (e.g., events, states and generic statements) the clause introduces to the discourse can benefit many NLP applications. Observing that the situati…
ClassificationGeneral ClassificationVocal Bursts Type PredictionThe lexical and grammatical sources of neg-raising inferences
We investigate neg(ation)-raising inferences, wherein negation on a predicate can be interpreted as though in that predicate's subordinate clause. To do this, we collect a large-scale dataset of neg-raising judgments for…
NegationInvestigating Strategies for Clause Recommendation
Clause recommendation is the problem of recommending a clause to a legal contract, given the context of the contract in question and the clause type to which the clause should belong. With not much prior work being done …
Text GenerationQuantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses
Tsetlin Machines (TMs) learn interpretable Boolean clauses using finite-state automata. We introduce the Quantum-Logic Tsetlin Machine (QL-TM), which replaces Boolean literals with quantum propositions represented by pro…
Quantum Machine LearningLearning a General Clause-to-Clause Relationships for Enhancing Emotion-Cause Pair Extraction
Emotion-cause pair extraction (ECPE) is an emerging task aiming to extract potential pairs of emotions and corresponding causes from documents. Previous approaches have focused on modeling the pair-to-pair relationship a…
Emotion-Cause Pair Extraction