CARPENTER, BOB, &GERALD PENN. 1994. ALE: The Attribute Logic Engine: User's guide. Laboratory for Computational Linguistics Report CMU-LCL-94, Laboratory for Computational Linguistics, Carnegie Mellon University. Version 2.0.1.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... French clitics in ALE Mary Ellen Foster 22 March 2000 1 Introduction This report describes the implementation of a portion of the French clitic system in the ALE system (Carpenter and Penn, 1999). Following the suggestions of Miller and Sag (1997) clitics are implemented entirely in the lexicon through a set of lexical rules that produce valence reduced versions of inflected verbs. The rules governing agreement of past participles with a preceding pronominal direct object are also ....

....past tense with etre. In such cases, the past participle agrees with the subject. 1 (14) a. Marie Mary est is arrivee. arrived (fem. Mary arrived. b. Marie est arrive. 3 Translating the grammar into French The fragment of French described in the previous section was implemented in ALE (Carpenter and Penn, 1999), based on a provided implementation of part of the grammar described in Sag and Wasow (1999) As the original grammar was designed for English, several changes had to be made to convert it to French. For the most part, French and English (particularly in the fragment implemented in the original ....

Carpenter, Bob and Gerald Penn. 1999. ALE: The Attribute Logic Engine User's Guide. Bell Laboratories, Lucent Technologies, Murray Hill, NJ, version 3.2 beta edition, May. Local (CogSci) version available at /usr/ contrib/share/doc/ALE/aleguide.pdf.

....Chomsky, 1981; Dowty, 1982; Dowty, 1989) This was produced with the following: cite bre82,chom81,dow82b,dow89 . There are even some references that are highly stimulating (Talmy, 1985) However, as Alsina Mchombo (1988) demonstrates, you can also use a kind of nominal form for citations. Carpenter (1992) also shows this. Here, we used the command e.g. citeasnoun carp92 Sometimes you need to give a page reference (Jackendoff, 1972, p. 52) produced as follows: cite[p. 52] jac72 . However, you can only do this for the cite command and not for the citeasnoun command, unfortunately. Note ....

Carpenter, B. (1992). ALE: The attribute logic engine user's guide, Technical report, CMU, Pittsburgh.

....were proved useful for programming languages to the domain of natural languages. This paper introduces an application of this approach: an implementation technique that is common for logic programming languages, namely the use of an abstract machine, is applied to (a subset of) the ale formalism ([7, 9]) originally designed for specifying feature structure based phrase structure grammars. Various linguistic formalisms have been computationally implemented in the past, 53 J. of Language and Computation, Vol. 1 No. 1, pp. 53 92 1999 c # King s College 54 E#cient Implementation of ....

....where higher types inherit features from their super types. A type hierarchy always contains #, the most general type, subsuming every other, and #, the contradictory type, subsumed by every other. Many di#erent formalizations of TFS systems exist; we basically follow the definitions of [7, 8]. In this setup t 1 # t 2 if t 1 is less informative (alternatively, denotes a larger set of objects) than t 2 . The inheritance hierarchy is required to be bounded complete: if a finite set of types t 1 , t n is consistent, it must have a unique least upper bound (LUB) t 1 ##tn #= #. Every ....

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory 90 E#cient Implementation of Unification-Based Grammars for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

.... the context of typed feature structures have become central within computational linguistics, the most prominent undoubtedly being HPSG [22] As a result, numerous computational frameworks specifically designed for constraintbased reasoning on typed feature logics have emerged, among them ALE [5], TFS [24] and CUF [7] Likewise, systems for representing and managing lexical information in a hierarchical fashion have appeared in recent years [3] To function efficiently, all of these frameworks must first and foremost be capable of managing the associated type hierarchy effectively. 1 ....

....For each 2 L n , associate a distinct element x , and then put U = fx j 2 Lg. Define I : L U by 7 fx oe j oe g. It is easy to see that 3 this semantics satisfies the condition (sem ) and it is totally separating by construction. 2 2. 5 The role of distributivity In the systems ALE [5], TFS [24] and the ACQUILEX LKB [6] among others, the type hierarchies are not required to be distributive. In [4, pp. 15 17] Carpenter argues that type hierarchies should not be distributive. On the other hand, the CUF system [7] requires a distributive hierarchy. We shall now attempt to sort ....

B. Carpenter and G. Penn. ALE: The Attribute Logic Engine user's guide, Version 3.1 Beta. Technical report, Bell Laboratories and Universitat Tubingen, 1998.

....may be performed via purely algorithmic constraint satisfaction. The user provides only declarative constraints, and need not supply any control information. In practice, the situation is not so ideal. Existing tools for working with feature logics in general, and HPSG in particular, such as ALE [1], CUF [5] and TFS [24] are Turing complete, meaning that they are general enough to allow representation of any computational process, including undecidable ones. While some simple problems may be solved within these frameworks without the specification of control information, this is not the ....

B. Carpenter. ALE: The Attribute Logic Engine user's guide. Technical report, Carnegie Mellon University, Laboratory for Computational Linguistics, 1992.

....unification based formalisms with different forms of disjunctive descriptions. Later, additional operations came into play, e.g. negation. Other proposals consider the integration of functional relational dependencies into the formalism which make them, in general, Turing complete (e.g. ALE; cf. [6]) However the most important extension to formalisms consists of the incorporation of types , for instance in contemporary systems like TFS [20] CUF [8] ALE, or TDL [11] Types are ordered hierarchically as it is known from object oriented programming languages. This often leads to multiple ....

Bob Carpenter and Gerald Penn. ALE---the attribute logic engine user's guide. version 2.0. Technical report, Laboratory for Computational Linguistics. Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, August 1994.

.... underlying deduction system we are not interested in the normalization of feature constraints (i.e. how unification of feature structures is actually done) nor are we interested in the logic of types, e.g. whether the existence of a greatest lower bound is obligatory (TFS [ Zajac 1992 ] ALE [ Carpenter and Penn 1994 ] or optional as in TDL [ Krieger and Schafer 1994 ] We assume here that typed unification is simply a black box and can be accessed through an interface function (say unify tfs) From this perspective, our expansion mechanism can be either used as a stand alone system or as an integrated ....

....types and performs TE only at definition time as is the case for ALE 5 In both cases, there is, in general, more than one fixpoint, but it seems desirable to choose the greatest one, as it would not rule out, for instance, cyclic structures or types which are not grounded on atoms. Carpenter and Penn 1994 ] However, ALE provides recursion through a builtin bottom up chart parser and through definite clauses. Allowing TE only at definition time is in general space consuming, thus unification and copying is expensive at run time. Another possibility one might follow is to integrate TE into the ....

Bob Carpenter and Gerald Penn. ALE---the attribute logic engine user's guide. version 2.0. Technical report, Laboratory for Computational Linguistics. Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, August 1994.

....unification based formalisms with different forms of disjunctive descriptions. Later, additional operations came into play, e.g. negation. Other proposals consider the integration of functional relational dependencies into the formalism which make them in general Turing complete (e.g. ALE; cf. [5]) However the most important extension to formalisms consists of the incorporation of types , for instance in contemporary systems like TFS [20] CUF [7] ALE, or TDL [11] Types are ordered hierarchically, as it is known from object oriented programming languages. This often leads to multiple ....

Bob Carpenter and Gerald Penn. ALE---the attribute logic engine user's guide. version 2.0. Technical report, Laboratory for Computational Linguistics. Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, August 1994.

....Adjunction Grammar (TAG) Joshi Schabes, 1992) For these or similar grammar models, powerful formalisms have been designed and implemented that are usually employed for both grammar development and linguistic processing, e. g, LFG (Bresnan, 1982) PATR (Shieber, Uszkoreit, et al. 1983) ALE (Carpenter, 1992), STUF (Bouma, Koenig, et al. 1988) ALEP (Alshawi, Arnold, et al. 1991) CLE (Alshawi, 1992) TDL (Krieger Schaefer, 1994) TFS (Emele Zajac, 1990) One essential ingredient of all these formalisms is complex formal descriptions of grammatical units (words, phrases, sentences) by means of ....

....structures, with inheritance and unification as the two basic operations relating these structures to one another. The use of inheritance and unification is appealing from both engineering and linguistic points of view as these operations can be formalized in terms of lattice theoretic notions (Carpenter, 1992) which are amenable to efficient implementation and are suitable to express the hierarchical nature of lexical structure. Likewise, feature structures have a clear mathematical and computational interpretation and provide an ideal data structure to encode complex word knowledge information. ....

[Article contains additional citation context not shown here]

Carpenter, B. (1992). ALE---the attribute logic engine user's guide. Technical report, Carnegie Mellon University, Carnegie Mellon University, Pittsburgh, Pennsylvania.

....shape their representations into a formalism which maintains psychological insights while rendering them implementable. In the work presented here, Jackendoff and Pinker s theories were integrated to create a formalised representation which was incorporated into an Attribute Logic Engine [ALE] [Carpenter, 1993] implementation of an HPSG grammar for English [Penn and Carpenter, 1993] 2.1 Cognitive Grounding Semantic primitives are not a new idea, but have been seriously criticised due to their representational limitations. What differentiates the Jackendoff Pinker approach from previous proposals is ....

....insights while rendering them implementable. In the work presented here, Jackendoff and Pinker s theories were integrated to create a formalised representation which was incorporated into an Attribute Logic Engine [ALE] Carpenter, 1993] implementation of an HPSG grammar for English [Penn and Carpenter, 1993] 2.1 Cognitive Grounding Semantic primitives are not a new idea, but have been seriously criticised due to their representational limitations. What differentiates the Jackendoff Pinker approach from previous proposals is that the aim is not to provide a set of primitives capable of representing ....

Carpenter, B. (1993). ALE: The Attribute Logic Engine user's guide. Version Beta.

....the connection to the implementation clear and to come close to the structured attribute value matrix notation. of feature structures is actually done) nor are we interested in the logic of types, e.g. whether the existence of a greatest lower bound is obligatory (TFS [ Zajac, 1992 ] ALE [ Carpenter and Penn, 1994 ] or optional as in TDL [ Krieger and Schafer, 1994 ] We assume here that typed unification is simply a black box and can be accessed through an interface function (say unify tfs) From this perspective, our expansion mechanism can be either used as a stand alone system or as an integrated ....

....] However, the expansion mechanism he outlined was order dependent in that it substituted types by their definition instead of unifying the information. Moreover, it was non lazy, thus it will fail to terminate for recursive types and performs TE only at definition time as is the case for ALE [ Carpenter and Penn, 1994 ] However, ALE provides recursion through a built in bottom up chart parser and through definite clauses. Allowing TE only at definition time is in general space consuming, thus unification and copying is expensive at run time. Another possibility one might follow is to integrate TE into the ....

Bob Carpenter and Gerald Penn. ALE---the attribute logic engine user's guide. version 2.0. Technical report, Laboratory for Computational Linguistics. Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, August 1994.

....STRUCTURES Shuly Wintner Nissim Francez Computer Science Technion, Israel Institute of Technology 32000 Haifa, Israel fshuly,francezg cs.technion.ac. il Abstract In this paper we provide for parsing with respect to grammars expressed in a general TFS based formalism, a restriction of ALE ([2]) Our motivation being the design of an abstract (WAM like) machine for the formalism ( 14] we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. We emphasize the notion of abstract typed ....

....formalisms such as HPSG ( 10] or Categorial Grammar ( 8] They can represent lexical items, phrases and rules. Usually, no mechanism for manipulating TFSs (e.g. parsing algorithm) is inherent to the formalism. Current approaches to processing HPSG grammars either translate them to Prolog (e.g. [2, 5, 6]) or use a general constraint system ( 16] In this paper we provide for parsing with grammars expressed in a general TFS based formalism, a restriction of ALE ( 2] Our motivation is the design of an abstract (WAM like) machine for the formalism ( 14] we consider parsing as a computational ....

[Article contains additional citation context not shown here]

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

....unification based formalisms with different forms of disjunctive descriptions. Later, other operations came into play, e.g. classical) negation. Other proposals consider the integration of functional relational dependencies into the formalism which make them in general Turing complete (e.g. ALE [ 4 ] ) However the most important extension to formalisms consists of the incorporation of types, for instance in modern systems like TFS [ 15 ] CUF [ 6 ] or TDL [ 7 ] Types are ordered hierarchically as it is known from object oriented programming languages. This leads to multiple inheritance ....

....latter case heavily depends on the notion of resolvedness (see above) In both cases, the depth of the search space can be restricted by specifying a maximal path length. 4 Comparison with other Systems TDL is unique in that it implements many novel features not found in other systems like ALE [ 4 ] , LIFE [ 2 ] or TFS [ 15 ] Of course, these systems provide other features which are not present in our formalism. What makes TDL unique in comparison to them is the distinction open vs. closed world, the availability of the full boolean connectives and distributed disjunctions (via UDiNe) ....

Bob Carpenter. ALE---the attribute logic engine user 's guide. Version fi. Technical report, Laboratory for Computational Linguistics. Carnegie Mellon University, Pittsburgh, PA, 1992.

....to rate the possibilities for temporal structure and choose the best among them. The starting point for this work was Scha and Polanyi s discourse grammar (Scha Polanyi 1988; Prust et al. 1994) For the implementation we extended the hpsg grammar (Pollard and Sag, 1994) which Gerald Penn and Bob Carpenter first encoded in ale (Carpenter, 1993) This paper will focus on our temporal processing algorithm, and in particular on our analysis of narrative progression, rhetorical structure, perfects and temporal expressions. 2 Constraints on narrative continuations Probably the best known algorithm for ....

Bob Carpenter, 1993. ALE: The Attribute Logic Engine User's Guide. Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, version fi, May.

....with M. Nivat and L. Nolin. whether a sentence may be generated from such a grammar, and this is rather worrying from a computational point of view. Therefore, their logical counterpart, namely feature logics, have been studied [63,28,71] and tools for handling them have been developed like ALE [26], CUF [44] and TFS [119] a major challenge being to isolate a family of logics which would be sufficient for natural language purposes but, nevertheless decidable and in polynomial time if possible But one can also consider less computational descriptions of the set of all languages ....

Bob Carpenter. ALE: The Attribute Logic Engine user's guide. Technical report, Carnegie Mellon University, Laboratory for Computational Linguistics, 1992.

....and choose the best among them. The starting point for this work was Scha and Polanyi s discourse grammar (Scha Polanyi 1988; Prust et al. 1994) For the implementation we extended the hpsg grammar [ Pollard and Sag, 1994 ] which Gerald Penn and Bob Carpenter first encoded in Carpenter s ale [ Carpenter, 1993 ] This deliverable will focus on our temporal processing algorithm, and in particular on our analysis of narrative progression, rhetorical structure, perfects and temporal expressions. Section 2 describes a series of constraints and preferences that, in order to reduce ambiguity, we make use of ....

Bob Carpenter. ALE: The Attribute Logic Engine User's Guide. Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, version fi edition, May 1993.

....were proved useful for programming languages to the domain of natural languages. This paper introduces an application of this approach: an implementation technique that is common for logic programming languages, namely the use of an abstract machine, is applied to (a subset of) the ale formalism ([7, 9]) originally designed for specifying feature structure based phrase structure grammars. Various linguistic formalisms have been computationally implemented in the past, 1 J. of Language and Computation, Vol. 0 No. 0, pp. 1 40 0000 c fl Oxford University Press 2 Efficient Implementation of ....

....hierarchy where higher types inherit features from their super types. A type hierarchy always contains , the most general type, subsuming every other, and , the contradictory type, subsumed by every other. Many different formalizations of TFS systems exist; we basically follow the definitions of [7, 8]. In this setup t 1 v t 2 if t 1 is less informative (alternatively, denotes a larger set of objects) than t 2 . The inheritance hierarchy is required to be bounded complete: if a finite set of types t 1 ; t n is consistent, it must have a unique least upper bound (LUB) t 1 t Delta Delta ....

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory 38 Efficient Implementation of Unification-Based Grammars for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

....Prolog or LIFE (AitKaci Podelski 93) for specifying the grammar. Further along this line lies compilation of grammars directly into Prolog, using Prolog s internal mechanisms for performing unification. This is the implementation technique of, e.g. Profit (Erbach 94) Systems such as ale (Carpenter 92a; Carpenter Penn 95) also compile grammars into Prolog. However, ale compiles grammar descriptions directly into Prolog code, rather than into (a Prolog representation of) feature structures. At run time, ale executes the code that was compiled for the rules. Parts of the unifications (resulting ....

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

No context found.

CARPENTER, BOB, &GERALD PENN. 1994. ALE: The Attribute Logic Engine: User's guide. Laboratory for Computational Linguistics Report CMU-LCL-94, Laboratory for Computational Linguistics, Carnegie Mellon University. Version 2.0.1.

No context found.

Carpenter, B. (1992b). ALE: The Attribute Logic Engine User's Guide, Laboratory for Computational Lingustics, Carnegie Mellon University.

No context found.

B. Carpenter. ALE: The Attribute Logic Engine User's Guide. Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh PA 15213, December 1992.

No context found.

Carpenter, Bob. 1992a. ALE - the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA, December.

No context found.

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

No context found.

Bob Carpenter. ALE -- the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1992.

No context found.

Carpenter, Bob. 1992a. ALE - the attribute logic engine: User's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA.

First 50 documents

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