Proceedings of the 2019 Conference of the North 2019
DOI: 10.18653/v1/n19-1020
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Abstract: The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as from optional constituents that adjoin on the right, such as right adjuncts and right conjuncts. In CCG, many right-branching derivations can be replaced by semantically equivalent leftbranching incremental derivations. The problem of right-adjunction is more resistant to solution, and has been tackled in the past using revealing-based appro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…We extract binary relations of the form arg1predicate-arg2 using MONTEE, an open-domain modality-aware relation extraction system (Bijl de Vroe et al, 2021). MONTEE uses the Rotat-ingCCG parser (Stanojević and Steedman, 2019) as the basis for extracting binary relations and a modality lexicon to identify modality triggers. A relation is tagged as modal (MOD), propositional attitude (ATT_SAY, ATT_THINK) or conditional (COND) if the CCG dependency graph contains a path between a relation node and a node matching an entry in the MONTEE lexicon.…”
Section: Methodsmentioning
confidence: 99%
“…We extract binary relations of the form arg1predicate-arg2 using MONTEE, an open-domain modality-aware relation extraction system (Bijl de Vroe et al, 2021). MONTEE uses the Rotat-ingCCG parser (Stanojević and Steedman, 2019) as the basis for extracting binary relations and a modality lexicon to identify modality triggers. A relation is tagged as modal (MOD), propositional attitude (ATT_SAY, ATT_THINK) or conditional (COND) if the CCG dependency graph contains a path between a relation node and a node matching an entry in the MONTEE lexicon.…”
Section: Methodsmentioning
confidence: 99%
“…Each sentence in the document is parsed using the RotatingCCG parser (Stanojević and Steedman, 2019) over which we construct a CCG dependency graph using a method similar to the one proposed by Clark et al (2002). (See Figure 2 for an example of a dependency graph and Figure 1 for the CCG parse tree from which it was extracted.)…”
Section: Event Extraction System Overviewmentioning
confidence: 99%