CARPENTER, BOB. 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17.301--314.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....out by Briscoe and Copestake [1999] the approach of treating lexical rules as a homogeneous class introduces a series of problems. For instance, the use of lexical rules to perform arbitrary manipulations of lists results in the possibility of generating any recursively enumerable language [Carpenter 1991], posing no limits on expressivity. An alternative approach suggested by Briscoe and Copestake [1999] is to define lexical rules using asymmetric default unification. By using asymmetric default unification the output structure is identical to the input, except where otherwise specified in the ....

Carpenter, B. The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammar with Lexical Rules, Computational Linguistics, v. 17, n. 3, p. 301-313, 1991.

.... A C Type raising: B A (A B) B A (A B) As an additional extension variable categories have been proposed [11, 12] This powerful generative capacity has been applied to cover some important noncanonical natural language constructions like wh extraction or nonconstituent conjunction (e.g. see [13, 14]) The other side of the coin is that parsing of CCG as such has been turned out to be inefficient leading to spurious ambiguity [15] Therefore, a lot of work was done to improve the performance of CCG parsers, e.g. compiling the grammar in a predictive form [16, 17] normal form based parsing ....

B. Carpenter. The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules. Comp. Linguistics, Vol. 17, No. 3, 1991.

....vertical generalizations as implicational constraints. In the main part of the paper we therefore concentrate on the formally less developed field of horizontal generalizations. 2 Horizontal Generalizations Lexical rules are a powerful tool for capturing horizontal generalization in the lexicon (Carpenter 1991) and they are widely used in linguistic proposals expressed in the HPSG architecture. However, while a formal foundation for basic HPSG theories is provided by King (1989, 1994) until recently no such formal basis had been given to lexical rules. 10 In this paper we want to investigate the ....

....Extraction Lexical Rule (Pollard Sag 1994) or the Complement Cliticization Lexical Rule (Miller Sag 1993, Monachesi 1999) to operate on those raised elements. Also an analysis treating adjunct extraction via lexical rules (Van Noord Bouma 1994) results in an infinite lexicon. Finally, Carpenter (1991) provides examples from the English verbal system for which recursive rule application and hence a potentially infinite lexicon seems necessary. Let us illustrate one of these examples in which an infinite number of lexical entries (not the words described) arises in an MLR setup: the interaction ....

Carpenter, B., 1991. The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules. Computational Linguistics 17(3), 301--314.

....linguistic adequacy of such an approach, one may question the effects it will have on processing. Unary rules may, if they can be applied recursively, give rise to non branching derivations of arbitrary depth. Termination of the parse process is typically not guaranteed in such cases. In fact, Carpenter (1991) proves that even the simplest grammar formalism employing complex symbols for representing syntactic valence is in principle undecidable, if it includes a lexical rule component. His proof rests on the observation that linguistic adequacy suggests that lexical rules must be able to insert, ....

Carpenter, B.: 1991, `The Generative Power of Categorial Grammars and HeadDriven Phrase Structure Grammars with Lexical Rules'. Computational Linguistics 17(3), 301--313.

....Rules in Constraint based Grammars Ted Briscoe Ann Copestake y University of Cambridge CSLI, Stanford University Lexical rules have been used to cover a very diverse range of phenomena in constraint based grammars. Examination of the full range of rules proposed shows that Carpenter s (1991) postulated upper bound on the length of list valued attributes such as subcat in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint based formalisms utilizing HPSG style lexical rules. We argue that it is preferable to subdivide such rules into a class of ....

....CB2 3QG, UK. E mail: ejb cl.cam.ac.uk y Center for the Study of Language and Information, Stanford University, Ventura Hall, Stanford, CA 94305, USA. E mail: aac csli.stanford.edu c fl 1900 Association for Computational Linguistics Computational Linguistics Volume 1, Number 1 Firstly, Carpenter (1991) demonstrates that if lexical rules are able to perform arbitrary manipulations (deletion, addition and permutation) of potentially unbounded lists, any recursively enumerable language can be generated, even if the non derived lexicon and grammar only generate context free languages. However, once ....

[Article contains additional citation context not shown here]

Carpenter, Bob. (1991). The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17.3: 301--314.

....The research was supported in part by NSF Grant Nos. IRI95 04372, STC SBR 8920230, ARPA Grant No. N66001 94 C6043, and ARO Grant No. DAAH04 94G0426. 1 Our lexical rules to introduce type raising are non recursive and thus do not suffer from the problem of the overgeneration discussed in (Carpenter, 1991). 2 CCGs with Generalized Type Raised Categories In languages like Japanese, multiple NPs can easily form a non traditional constituent as in [ Subj 1 Obj 1 ) Subj 2 Obj 2 ) Verb . The proposed grammars (CCG GTRC) admit lexical type raised categories (LTRC) of the form T= Gamma Tna ....

Carpenter, Bob. 1991. The generative power of Categorial Grammars and Head-driven Phrase Structure Grammars with lexical rules. Computational Linguistics, 17.

....lexical polymorphism is implemented via recursive constraints. Techniques of delayed evaluation are employed to reason efficiently with such constraints. For a general assessment of the computational complexity of lexical rules in categorial or unification based frameworks, the reader can turn to [Carpenter 91] who shows that the type of operations on subcategorization information actually used lead to Turing complexity. This makes the question of the division of labour between derivational polymorphism and lexical rules pregnant again, and shows the need for a restricted theory of lexical rules. ....

Carpenter, B. (1991), `The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules'. Computational Linguistics, 17, 301--314.

....7. Lexical rules are regarded as (complex) constraints in this framework because it allows an implementation using delayed evaluation techniques from logic programming. The idea is that a certain constraint is only (partially) evaluated if enough information is available to do so 3 Refer to (Carpenter, 1991) for a proof of Turing equivalence of simple categorial grammar with recursive lexical rules. 2 6 6 6 6 6 6 6 6 6 6 4 verbal sc : h noun sem : A2 i subj : noun sem : A1 semjnucjqfsoa : kiss soa kisser : A1 kissed : A2 # 3 7 7 7 7 7 7 7 7 7 7 5 Figure 6: Category for ....

Carpenter, Bob. 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics, 17(3):301--313.

....rules (e.g. Copestake and Briscoe, 1992,1994) The combination of the restriction, DefFilter and default unification operators is not expressive enough to allow a direct implementation of lexical rules which manipulate listvalues of features, such as SUBCAT in HPSG, in complex ways. In view of Carpenter s (1991) proof that such rules considerably increase the generative power of otherwise constrained grammatical formalisms, this may not be a bad result. However, it remains to be seen whether this treatment of lexical rules can be used to characterise passive and other valency changing or diathesis ....

Carpenter, R. (1991) `The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with lexical Rules', Computational Linguistics, vol.17.3, 301--314.

....Copestake aac csli.stanford.edu Center for the Study of Language and Information Stanford University Stanford CA 94305, USA Abstract Lexical rules have been used to cover a very diverse range of phenomena in constraintbased grammars. Examination of the full range of rules proposed shows that Carpenter s (1991) postulated upper bound on the length of list valued attributes such as subcat in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint based formalisms utilizing HPSG style lexical rules. We argue that it is preferable to subdivide such rules into a class of ....

....van Noord (1994) have proposed a lexical rule of Adjunct Introduction which can recursively add adverbial categories to the subcat list of a verbal category. There are three main problems with the treatment of lexical, or what might be better termed unary, rules as a homogeneous class. Firstly, Carpenter (1991) demonstrates that if lexical rules are able to perform arbitrary manipulations (deletion, addition and permutation) of potentially unbounded lists, any recursively enumerable language can be generated, even if the non derived lexicon and grammar only generate context free languages. However, once ....

[Article contains additional citation context not shown here]

Carpenter, R. (1991) `The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules', Computational Linguistics, vol.17.3, 301--314.

.... On the other hand, such a control extension seems to be vital for practical applications of the methods described, in order to limit spurious ambiguities, adhoc features, and the chances that the lexical rule component is not well behaved , leading to non termination (given the result in [3] it is not surprising that such cases exist) ....

Bob Carpenter. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics, 17(3):301--313, 1991.

....floodgates might even appear to be inevitable. Simply compare the introduction of general transformations in transformational grammars [Peters and Ritchie 1973] metarules in phrase structure grammars [Uszkoreit and Peters 1986] and lexical rules in categorial and phrase structure systems [Carpenter 1991], all of which have been shown to be Turing complete. Although steps may be taken to restrict the power of these systems to ensure decidability, such moves appear rather ad hoc because of their lack of linguistic motivation. For instance, consider the restrictions against metarule self application ....

Carpenter, B., 1991. The Generative Power of Categorial Grammars and Headdriven Phrase Structure Grammars with Lexical Rules. Computational Linguistics 17:3, 301--314.

....8 a set of basic expressions. This approach was the basis for Lambek s [1961] non associative calculus. For a survey of the ramifications of the choice of expression algebra, both on the logic and its proof theory, see [Hepple 1990a] Morrill 1992a] and [Moortgat and Oehrle 1993] 6 See Carpenter [1991, 1992a] for a discussion of the linguistic utility and computational drawbacks of adopting lexical rules which potentially generate an infinite lexicon. 7 The lexical insertion scheme was not part of Lambek s original presentation, nor is it used by many authors. Instead, the lexicon is usually ....

Carpenter, B., 1991. The Generative Power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17:3, 301--314.

No context found.

CARPENTER, BOB. 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17.301--314.

No context found.

Bob Carpenter. 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17, 301-313.

No context found.

Bob Carpenter. 1991. The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules. Computational Linguistics, 17.

No context found.

Carpenter, B. (1991), `The generative power of categorial grammars and headdriven phrase structure grammars with lexical rules'. Computational Linguistics, 17, 301--314.

No context found.

Bob Carpenter. 1991. The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules. Computational Linguistics, 17.

No context found.

Bob Carpenter. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics, 17(3):301--313, 1991.

No context found.

Bob Carpenter. 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics, 17(3):301--313.

No context found.

Bob Carpenter 1991. The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules. Computational Linguistics 17, 301-313.

No context found.

Bob Carpenter. 1991. The generative power of categorial grammars and headdriven phrase structure grammars with lexical rules. Computational Linguistics 17, 301-313.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC