[PDF] Top 20 A New Parsing Algorithm for Combinatory Categorial Grammar

... The algorithm in Figure 5 can be extended to sup- port such rule ...the algorithm only allows inferences that are licensed by valid instances of a given ... 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 parsing ... See full document

... on parsing English and Hindi using the Malt and MST parsers in the recent past (Nivre et ...stack-projective parsing algorithms for CoNLL and Stanford schemes respectively and LIBLIN- EAR learner (Fan et ... See full document

... induction algorithm (Bisk and Hockenmaier, 2012), which induces a language-specific Combinatory Categorial grammar (CCG) and lexicon based on a small number of linguistic principles, ... See full document

... An essential feature of CCG is its flexible constituent structure, licensed by type-raising and composition rules which can create “non- standard” constituents such as “John saw”, or “Mary talked to”, required in ... 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

... Since the Switchboard annotation is almost iden- tical to the one of the Penn Treebank, we use a similar translation algorithm to Hockenmaier and Steedman (2005). We identify heads, arguments and adjuncts, ... See full document

... A sign is an n-tuple of terms that represent in- formation at n distinct dimensions. Each dimension represents a level of linguistic information such as prosody, meaning, or syntactic category. As a repre- sentation, we ... 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

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

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

... Two representative syntactic theories are Chomskian TG Grammar and Categorial Grammar. Both of them consider the grammaticality of sentences is universally controlled by some symbolic operations. ... 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

... generateSign generates a sign Sign with phonology ~ , syntactic category K and semantics Z by creating a new sign SignO with phonology ~', syntactic category K' and semantics Z, unifying[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

... no grammar-based systems achieved competitive results, as input conversion turned out to be more difficult than ...that grammar-based systems can be substantially im- proved with error mining ...tic ... See full document

... the grammar underlying the Penn Treebank is very permissive, and a parser can do well on the standard Parseval measures without committing itself on certain se- mantically significant decisions, such as predicting ... See full document

... a full syntactic parse of any sentence, while simul- taneously producing logical forms for sentence spans that have a semantic representation within its predicate vocabulary. The parser is trained by jointly optimizing ... See full document

... does not directly use  tags, calls into question whether  tagging yields a net gain in a language where distinctions such as the noun/verb ambiguity are often difficult to resolve using local tagging ap- proaches. ... See full document

... CCGbank, in addition to the basic atoms S, N, N P and P P , also differentiates both the S and N P atoms with features allowing more subtle dis- tinctions. For example, declarative sentences are S[dcl], wh-questions are ... See full document