[PDF] Top 20 Efficient Normal Form Parsing for Combinatory Categorial Grammar

... 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

... ner’s normal-form algorithm shows that there is at least one additional kind of spurious ambigu- ity that arises when there are three adjacent con- stituents A, B, C and both A and C can compose into ... See full document

... simple Categorial Grammars, different propositions were made to improve this formalism by adopting applicative languages such as the calculus of syntactic types proposed by ...the combinatory logic created ... 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

... CCG normal-form deriva- tions obtained by translating the Penn Tree- bank trees using an algorithm described by Hockenmaier and Steedman ...The grammar contains a set of type-changing rules similar ... See full document

... extend Combinatory Categorial Grammar (CCG) with a generalized notion of multi- dimensional sign, inspired by the types of rep- resentations found in constraint-based frame- works like HPSG or ... See full document

... Unificational Combinatory Categorial Grammar (UCCG) formalism, which was developed bearing in mind its future application in parsing and gen- erating prosodically annotated ... See full document

... Recall that each data point encodes a possibility to repeat a CCG category, referring to a particular instance of a target category at time t and a time span of duration of one second [t −d − 0.5,t − d + 0.5] in which a ... 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

... The oracle F-score (given a perfect reranker that always chooses the best n-best parse for a sentence) is used to measure the quality of n-best parses. Huang and Chiang (2005) describe efficient n-best ... See full document

... the parsing perspective, the redundancy of analyses can be controlled by (1) grammar rewriting (Wittenburg 1987), (2) checking the chart for PAS equivalence (Karttunen 1989; Komagata 1997), (3) making the ... See full document

... of dependency parsers is already extremely high. In addition, we also demonstrate the utility of CCG categories to MST (McDonald et al., 2005) for both languages. CCG lexical categories contain subcategorization ... See full document

... logical form were ex- pressed by the sentence. Note that a correct logical form need not entail all of the relations expressed by the sentence, reflecting an emphasis on preci- sion over ... See full document

... the form-function distinction — when the syntactic form of a constituent does not co- incide with its semantic function (Honnibal, ...the form of an ... See full document

... The algorithm in Figure 5 can be extended to sup- port such rule restrictions. Note that already in its present form, the algorithm only allows inferences that are licensed by valid instances of a given rule. ... See full document

... prominent grammar frameworks, efficiently deals with deletion under coordination in natural ...of parsing some pat- terns of intra-sentential ellipses in serial verb ... See full document

... the categorial semantics that accompanies any categorial parse and for a more elegant analysis of linguistic structures such as extraction and ...CFG parsing community to improve CCG ... 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

... Natural language systems based on Categorial Unifica- tion Grammar CUG have mainly employed bottom- up parsing algorithms for processing.. Conventional prediction techniques to improve t[r] ... See full document

... the parsing per- formance of these two parsers is not fair because these two grammars define different categories and different tree ...the parsing performance of these two grammars on a common test set of ... See full document