[PDF] Top 20 Type inheritance Combinatory Categorial Grammar

... Type-inheritance Combinatory Categorial Gram- mar (TCCG) is a type-inheritance, unification-based CCG of the English fragment in Sag and Wa- sow (1999), implemented in the LKB ... See full document

... The parse tree path feature is designed to capture the syntactic relation of a constituent to the pred- icate. It is defined as the path from the predicate through the parse tree to the constituent in question, ... See full document

... Though valency is a useful feature in dependency parsing (Zhang and Nivre, 2011), Zhang and Nivre (2012) showed that providing valency information dynamically, in the form of the number of depen- dencies established in a ... See full document

... We performed a subtractive analysis to investigate the individual contribution of each feature type. We can see in Table 5 that different features are important for the gold and predicted experiments. Removing the ... See full document

... (1995) categorial analysis of Turk- ish is also lexemic; all lexical entries are fully ...another categorial approach (Bozsahin and G ¨o¸cmen 1995), but morphotactic constraints are modeled with ... See full document

... In the final part of our correctness proof we now prove the completeness of the deduction system in Figure 5. Specifically we show the following stronger statement: For every derivation tree and for every derivation ... See full document

... semantic type, and logical ...argument type from its return type. The argument type appears on the right side of the slash, and the return type on the ... See full document

... The models described here are all extensions of a very simple model which models derivations by a top-down tree-generating process. This model was originally described in Hockenmaier (2001), where it was applied to a ... See full document

... Non-local dependencies (  s) are lexical depen- dencies which hold over unbounded distances. Guo et al. (2007) observed that despite the importance of  s for correct semantic interpretation, and the fact that ... See full document

... egorial Type Logic (Hendriks, 1995; Moortgat, 1997), Type Logical Grammar (Morrill, 1994; J¨ager, 1997; J¨ager, 2001; Oehrle, 2007), and CCG (Jacobson, 1999), and gap resolution in Memory- Inductive ... See full document

... that type-raising is restricted to those instances occurring in CCGbank 4 , then a CCG consisting of schema classes (1-3), (6-7) and (10-11) can generate all the derivations in CCG- ...its grammar is not ... See full document

... the type raising rules to “Sumi-ga” and “Minju-lil” which are operands, by introducing the combinator ...the Combinatory Logic formalism) consecutively the combinators B and C* to build a well-formed ... See full document

... its type (lexical or phrasal) was ...each type, with a response indicating whether a prime of the category of such a type occurred in the time win- ... See full document

... The paper shows how Combinatory Cat- egorial Grammar CCG can be adapted to take advantage of the extra resource- sensitivity provided by the Categorial Type Logic framework.. The resulti[r] ... See full document

... the grammar and the number of productions are fixed and small, but we present the formulation as infinite to allow for easy extension in the ...the grammar during parsing/training or fully lexicalize the ... See full document

... unification-based categorial grammar from a semantically-annotated corpus of child-directed ...with grammar induction from unannotated text, and assumes (sentence-level) log- ical forms to be ... See full document

... grammatical type raising (where the lexicon may still contain categories like S/(S\NP), but there is no combinatory rule that changes a complex (derived) NP to ... See full document

... The fact that the distinguisbed position must be one of the two ends of an argument category, coupled with the requirement of the principle of Adjacency, means that only the two order-pr[r] ... See full document

... Since our current system is so simple, there is ample space for future work. We plan to investigate the effect of more complex statistical models and priors that have been shown to be helpful in dependency ... See full document

... Second, we must be sure that when function composition and unary rules like subject type-raising do become involved, they produce unique derivations under conditions like 8, avoiding the[r] ... See full document