[PDF] Top 20 Identifying Semantic Roles Using Combinatory Categorial Grammar

... predict semantic roles (as defined in PropBank) from sentences and their parse trees as determined by the statistical parser of Collins ...on Combinatory Categorial Grammar (CCG) ... See full document

... Finally, Figures 1 to 3 show a complete parse of the prosodically marked sentence ’Anna L+H* LH% married Manny H* LL%’. Due to space considerations we omitted the two initial steps that involve combining the sign of ... See full document

... This paper shows how the use of abstract syntax permitted by higher-order logic programming allows an elegant implementation of the semantics of Combinatory Categorial Grammar, including[r] ... See full document

... a semantic frame can apply to semantic categories if these semantic categories are consistent with the semantic ...resolving semantic issues is computationally feasible ... See full document

... Derivational and lexical ambiguity often arise in  because of the form-function distinction — when the syntactic form of a constituent does not co- incide with its semantic function (Honnibal, 2010). For ... See full document

... the categorial semantics that accompanies any categorial parse and for a more elegant analysis of linguistic structures such as extraction and ...coarse-grained grammar extracted from a train- ing ... See full document

... by Combinatory Categorial Grammar to introduce Com- binatory Categorial ...CCG combinatory op- erators to guide a non-linear transforma- tion of meaning within a ... See full document

... The parser is proved to find exactly one parse in each semantic equivalence class of allowable parses; that is, spurious ambiguity as carefully defined is shown to be both safely and com[r] ... See full document

... Third, since each zero morpheme has its own syntax and semantic interpretation in much the same way as overt morphemes, and since the semantic interpretations of binary rules that combin[r] ... See full document

... CCG is distinguished from most other gram- matical theories by the fact that its rules are type-dependent, rather than structure-dependent like classical transformations. Such rules adhere strictly to the constituent ... See full document

... The purpose of this work is the automatic analysis of Korean sentences in which there exist the problems of case, free word order structure and coordination structure. Firstly, the ACCG provides the possibility to go ... See full document

... these grammar formalisms, the Combinatorial Categorial Grammar (CCG) is a lexical- ized, mildly-context-sensitive model (Steedman, ...formal grammar theory, CCGs are known to be weekly ... 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

... and semantic scope relations of smaller ...on Combinatory Categorial Grammar that provides flexible constituency, flexible category consistency, and lexical projection of morphosyntactic ... See full document

... 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 (Copestake, 2002), a ... See full document

... evaluated using CCGbank (Hockenmaier and Steedman, 2002a), an automatic conversion of the Penn Treebank into the CCG ...trained using this resource (Hockenmaier and Steedman, 2002b; Hocken- maier, ...on ... See full document

... translation grammar. We introduce a labeling scheme based on categorial grammar, which allows syntactic labeling of many rules with a mini- mal, well-motivated label ... 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

... What grammatical representation is appropriate for unsupervised grammar induction? Initial attempts with context-free grammars (CFGs) were not very successful (Carroll and Charniak, 1992; Charniak, 1993). One ... See full document

... Hence the shared forest representation we build is polynomial with respect to the length of the input, n, despite the fact that the number of derivations trees could be exponential... We[r] ... See full document