• No results found

On the Syntax and Semantics of the Bound Noun Constructions: With a Computational Implementation

N/A
N/A
Protected

Academic year: 2020

Share "On the Syntax and Semantics of the Bound Noun Constructions: With a Computational Implementation"

Copied!
11
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Figure 1: Parsed Tree and MRS for ‘There is no possibility that the teacher will come.’

References

Related documents

Although Massam (2010) does not set out to provide an analysis of Niuean argument structure, there are a number of reasons to be skeptical of the applicability of a non-

reasonably standard framework. Several of the key ideas are adapted from the theoretical work of Pinkham. In particular, we divide comparatives into two separate

More recently, the PARSEME shared-task saw 13 system submissions that tried to predict LVCs along with other VMWEs for annotated corpora in 19 languages (Ramisch et al., 2018)..

Several supervised approaches have been proposed for causality identification by re- lying on shallow linguistic features. How- ever, such features do not lead to improved

With this work, Taverna joins the ranks of other sci- entific workflow management systems for which formal models have been developed, notably Kepler [LABe05, MBL06] based on

Finally, it is also worth remembering that the two internal arguments in the English dative shift construction (i.e. pattern [3] in the model offered here) have also been

However, the leading standard for business rules, Semantics for Business Vocabulary and Business Rules (SBVR), leaves certain decisions concerning the precise syntax and semantics