[PDF] Top 20 Improving Dependency Parsers using Combinatory Categorial Grammar

... via Combinatory Categorial Grammar (CCG) categories from a ...popular dependency parsers (Malt and MST) for two languages: English and ...both parsers by around 0.3-0.5% in all ... See full document

... The set of CCG categories is built recursively from two atomic types, S (sentence) and N (noun). Com- plex types are of the form X/Y or X\Y, and repre- sent functions which combine with an argument of type Y to yield a ... See full document

... Our results also indicate the importance of recov- ering long-range dependencies, either through the trace information in the Penn Treebank, or directly, as in the predicate-argument structures returned by the CCG ... See full document

... Table 8 shows that while the confusion types NR ▷◁ NN and JJ ▷◁ NN have no impact on the evalua- tion, the confusions DEC ▷◁ DEG and VV ▷◁ NN , intro- duced one at a time, cause reductions in F -score of 1.50 and 1.75% ... See full document

... Osborne and Briscoe (1997) propose an unsupervised learning model for CCG induction. They create a labeled binary tree for each part-of-speech tag sequences in a greedy, bottom-up, in- cremental manner. The label of each ... See full document

... successful parsers. These parsers are trained and evaluated using CCGbank (Hockenmaier and Steedman, 2002a), an automatic conversion of the Penn Treebank into the CCG ...age parsers have been ... See full document

... of combinatory rules in the resulting ...the parsers obtained after 0, 4, 5 and 6 training iterations (denoted I-0, I-4, I-5 and ...all parsers return an analysis, we report the coverage (denoted ... See full document

... German dependency parsing under a Weighted Constraint Dependency Grammar ...transition-based dependency parsing for ...distance dependency information for the purpose of HPSG ...between ... See full document

... The memory mechanism introduced in this pa- per deals with fillers and gaps in SVC. It is similar to anaphoric resolution in ATN, Jacobson’s model, TLG, and CTL. However, it also has prominent distinction from them: The ... See full document

... TCCG of course adopts wholesale the type- inheritance, unification based approach of HPSG, adding nothing new to the underlying framework. Nonetheless, by adopting a CCG style syntax TCCG makes possible more direct ... 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 length ... See full document

... the dependency structures within parsed sentences, as well as the possible derivations for them, using a log-linear (Maximum- Entropy) ...accurate parsers for producing deep dependencies currently ... See full document

... a grammar formalism that combines the insights from Combinatory Categorial Grammar with feature structure ...mantics, using Discourse Representation Theory as first-order semantic ... See full document

... Furthermore, dependency structure allows for a number of ways to represent coordinated phrases, some having the coordinating conjunction as head (CCH) of the coordinate structure, and a special dependency ... See full document

... Categorial grammar annotations are attractive be- cause they have a transparent syntactic-semantic interface and provide a natural account of traces (Rimell et ...of parsers trained on existing cate- ... See full document

... ACGs provide a framework in which several grammatical formalisms may be encoded (de Groote and Pogodalla, 2004). They generate lan- guages of linear λ-terms, which generalize both string and tree languages. A key feature ... See full document

... The combinatory theory thus offers a way to derive such intonational phrases, using only the independently motivated rules of combinatory grammar, entirely under the control of appropria[r] ... See full document

... to parsers other than our own, we incorpo- rate our semi-supervised lexical entries into the C&C parser to see if it benefits ...C&C parsers performance over and above its back-off strategy for ... See full document

... of grammar is far from settled, but, starting with Chomsky (1970), there seems to be an agreement that deriva- tional morphology is internal to the ...Functional Grammar (LFG) (Bresnan 1995) and earlier ... 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