... learn-ing categorialgrammars from strings andthe need for an adequate structure on ex-amples.1 Introduction Categorial grammars (Bar-Hillel, 1953) and Lam-bek grammars (Lambek, 1958; Lambek, ... ofclassical categorialgrammars (we recall that the w-hole class of classical categorialgrammars is equiv-alent to context free grammars; the same holds forthe class of Lambekgrammars (Pentus, ... Rigid and k-valued Grammars. Categorial grammars that assign at most k typesto each symbol in the alphabet are called k-valued grammars; 1-valued grammars are also called rigid grammars. Example...
... purposes much better than previous chart methods for Lambek grammars. 1 Introduction We present a new chart parsing method for Lambek grammars. The starting point for this work is the observation, ... D-Tree Grammars and Type-Logical Grammars. ' Proc. Fourth Workshop on Tree- Adjoining Grammars and Related Frame- works. KSnig, E. 1990, 'The complexity of parsing with extended categorial ... ' Chart Parsing Lambek Grammars: Modal Extensions and Incre- mentality', Proc. of COLING-92. Mark Hepple. 1996. 'A Compilation-Chart Method for Linear Categorial Deduction.'...
... selections [Mechanical Translation, vol.4, nos.1 and 2, November 1957; pp. 5-10] Structural Grammars † R. B. Lees, Research Laboratory of Electronics, Massachusetts Institute of Technology, ... Structure of Linguistic Theory", Preliminary Draft, M.I.T., 1956, 713 + li pp. Structural Grammars 9 DEVELOPMENT OF THE VERB PHRASE 1. PHRASE-STRUCTURE RULE to yield verb phrases ... GRAMMATICAL TRANSFORMATIONS to yield non-kernel sentences a. Passive transformation: Structural Grammars 7 ...
... refinement without heuristics.3 Symbol-Refined Tree Substitution Grammars In this section, we propose Symbol-Refined TreeSubstitution Grammars (SR-TSGs) for syntacticparsing. Our SR-TSG model is ... set (sections 2-21). The tree-bank data is right-binarized (Matsuzaki et al., 2005)to construct grammars with only unary and binaryproductions. We replace lexical words with count≤ 5 in the ... pages 1098–1107.Phil Blunsom and Trevor Cohn. 2010. UnsupervisedInduction of Tree Substitution Grammars for Depen-dency Parsing. In Proc. of EMNLP, pages 1204–1213.Eugene Charniak and Mark...
... Figure 1 shows a CCG deriva-tion from CCGbank.A well-known categorial grammar which is nota CCG is Lambekcategorial grammar (Lambek, 1958) whose introduction rules cannot be charac-terized ... phenomena have a more natural representa-tion in CCG.2 The Language Classes of Combinatory Categorial Grammars A categorial grammar is a grammatical systemconsisting of a finite set of words, a set ... grammar formalism. Unlikethe context-free grammars extracted from the Penntreebank, these allow for the categorial semanticsthat accompanies any categorial parse and for amore elegant analysis...
... leads to adaptor grammars. Informally, the units of generalization of adap-tor grammars are entire subtrees, rather than justlocal trees, as in PCFGs. Just as in tree substitu-tion grammars, each ... a function of DP concentration parameter α. “U”indicates unigram-based grammars, while “C” indicatescollocation-based grammars. Sentence → Word+Word→ Phoneme+Figure 1: The unigram word ... the start symbol areshown.tor grammars using regular expressions for clarity,but since our implementation does not handle reg-ular expressions in rules, in the grammars actuallyused by the...
... speedsubstantially. For instance, DeNero et al. (2009)describe normal forms particularly suited to trans-ducer grammars, demonstrating that well-chosenbinarizations admit cubic-time parsing algorithmswhile ... approach.ReferencesJohn DeNero, Mohit Bansal, Adam Pauls, and Dan Klein.2009. Efficient parsing for transducer grammars. In Pro-ceedings of the Annual Conference of the North AmericanAssociation for Computational ... 141–144,Suntec, Singapore, 4 August 2009.c2009 ACL and AFNLPAsynchronous Binarization for Synchronous Grammars John DeNero, Adam Pauls, and Dan KleinComputer Science DivisionUniversity of California,...
... descriptions are calledapplication grammars. A resource grammar (Ranta, to appear) is ageneral-purpose grammar that forms a basis forapplication grammars. Resource grammars haveso far been implemented ... languages)and higher abstraction level for writing application grammars. According to the ”division of labor”principle, resource grammars comprise the nec-essary linguistic knowledge allowing ... raisesthe abstraction level of writing domain-specific grammars by taking care of thegeneral grammatical rules of a language.GF resource grammars have been built inparallel for eleven languages...
... 2004b. Synchronous Dependency Insertion Grammars: A Grammar Formalism for Syn-tax Based Statistical MT. Workshop on Recent Ad-vances in Dependency Grammars, COLING-04. Bonnie J. Dorr. 1994. ... Schabes. 1990. Synchronous Tree-Adjoining Grammars, Proceedings of the 13th COLING, pp. 253-258, August 1990. Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel ... synchronous dependency insertion grammar. Synchronous depend-ency insertion grammars are a version of synchronous grammars defined on de-pendency trees. We first introduce our approach to...
... struc-tures. Our proposal generalizes MTG by movingfrom component grammars that generate context-free languages to component grammars whose gen-erative power is equivalent to Linear Context-FreeRewriting ... Wellington. 2004. Gener-alized multitext grammars. Technical Report 04-003, NYUProteus Project. http://nlp.cs.nyu.edu/pubs/.I. Dan Melamed. 2003. Multitext grammars and synchronousparsers. In ... perspicuously account forcertain syntactic phenomena that cannot be easilycaptured by context-free grammars, such as cliticclimbing, extraposition, and other types of long-distance movement (Becker...