kvalued nonassociative lambek categorial grammars

... learn- ing categorial grammars from strings and the need for an adequate structure on ex- amples. 1 Introduction Categorial grammars (Bar-Hillel, 1953) and Lam- bek grammars (Lambek, 1958; Lambek, ... of classical categorial grammars (we recall that the w- hole class of classical categorial grammars is equiv- alent to context free grammars; the same holds for the class of Lambek grammars (Pentus, ... Rigid and k-valued Grammars. Categorial grammars that assign at most k types to each symbol in the alphabet are called k-valued grammars; 1-valued grammars are also called rigid grammars. Example...

Ngày tải lên: 20/02/2014, 16:20

Ngày tải lên: 08/03/2014, 05:20

Ngày tải lên: 08/03/2014, 18:20

Ngày tải lên: 08/03/2014, 18:20

Ngày tải lên: 17/03/2014, 20:20

Ngày tải lên: 31/03/2014, 01:20

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

Ngày tải lên: 20/02/2014, 19:20

Ngày tải lên: 08/03/2014, 21:20

Ngày tải lên: 17/03/2014, 07:20

Ngày tải lên: 17/03/2014, 20:20

Ngày tải lên: 01/09/2013, 11:31

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

Ngày tải lên: 19/02/2014, 19:20

... refinement without heuristics. 3 Symbol-Refined Tree Substitution Grammars In this section, we propose Symbol-Refined Tree Substitution Grammars (SR-TSGs) for syntactic parsing. 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 binary productions. We replace lexical words with count ≤ 5 in the ... pages 1098–1107. Phil Blunsom and Trevor Cohn. 2010. Unsupervised Induction of Tree Substitution Grammars for Depen- dency Parsing. In Proc. of EMNLP, pages 1204–1213. Eugene Charniak and Mark...

Ngày tải lên: 19/02/2014, 19:20

... Figure 1 shows a CCG deriva- tion from CCGbank. A well-known categorial grammar which is not a CCG is Lambek categorial 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 system consisting of a finite set of words, a set ... grammar formalism. Unlike the context-free grammars extracted from the Penn treebank, these allow for the categorial semantics that accompanies any categorial parse and for a more elegant analysis...

Ngày tải lên: 20/02/2014, 04:20

... leads to adaptor grammars. Informally, the units of generalization of adap- tor grammars are entire subtrees, rather than just local 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” indicates collocation-based grammars. Sentence → Word + Word → Phoneme + Figure 1: The unigram word ... the start symbol are shown. tor grammars using regular expressions for clarity, but since our implementation does not handle reg- ular expressions in rules, in the grammars actually used by the...

Ngày tải lên: 20/02/2014, 09:20

... speed substantially. For instance, DeNero et al. (2009) describe normal forms particularly suited to trans- ducer grammars, demonstrating that well-chosen binarizations admit cubic-time parsing algorithms while ... approach. References John DeNero, Mohit Bansal, Adam Pauls, and Dan Klein. 2009. Efficient parsing for transducer grammars. In Pro- ceedings of the Annual Conference of the North American Association for Computational ... 141–144, Suntec, Singapore, 4 August 2009. c 2009 ACL and AFNLP Asynchronous Binarization for Synchronous Grammars John DeNero, Adam Pauls, and Dan Klein Computer Science Division University of California,...

Ngày tải lên: 20/02/2014, 09:20

... descriptions are called application grammars. A resource grammar (Ranta, to appear) is a general-purpose grammar that forms a basis for application grammars. Resource grammars have so 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 ... raises the abstraction level of writing domain- specific grammars by taking care of the general grammatical rules of a language. GF resource grammars have been built in parallel for eleven languages...

Ngày tải lên: 20/02/2014, 12:20

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

Ngày tải lên: 20/02/2014, 15:20

... struc- tures. Our proposal generalizes MTG by moving from component grammars that generate context- free languages to component grammars whose gen- erative power is equivalent to Linear Context-Free Rewriting ... Wellington. 2004. Gener- alized multitext grammars. Technical Report 04-003, NYU Proteus Project. http://nlp.cs.nyu.edu/pubs/. I. Dan Melamed. 2003. Multitext grammars and synchronous parsers. In ... perspicuously account for certain syntactic phenomena that cannot be easily captured by context-free grammars, such as clitic climbing, extraposition, and other types of long- distance movement (Becker...

Ngày tải lên: 20/02/2014, 16:20

Ngày tải lên: 20/02/2014, 18:20