CLG : A grammar formalism based on constraint resolution

  • Luis Damas
  • Giovanni B. Varile
Natural Language Understanding
Part of the Lecture Notes in Computer Science book series (LNCS, volume 390)


We present the design and implementation of a powerful grammar formalism based on constraint resolution. Constraints are expressed in a full first order language with equality allowing on top of the expression of equational, disjunctive, conunctive, negative, implicative and if-then-else constraints. CLG has been implemented in Prolog and tested with relatively large grammars of Danish, English and German. We also report on the efficiency of the implementation and the expressive adequacy of the formalism.


Natural language processing constraint logic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Gazd86]
    Gazdar, Gerald, Geoffrey K. Pullum, Robert Carpenter, Ewan Klein, Thomas Hukari and Robert Levin. 1986. Category Structures. Cognitive Science Research Paper no. CSRP 071. University of Sussex, Brighton, EnglandGoogle Scholar
  2. [Gazd87]
    Gazdar, Gerald and Geoffrey K. Pullum. 1987. A Logic for Category Definition. Cognitive Science Research Paper no. CSRP 072, University of Sussex, Brighton, EnglandGoogle Scholar
  3. [Kart84]
    Karttunen, Lauri. 1984. Features and Values. In: COLING-84, 28–33.Google Scholar
  4. [Kasp86]
    Kasper, Robert and William Rounds. 1986. A logical semantics for feature structure. In: ACL Proceedings, 24th Annual Meeting, 257–266Google Scholar
  5. [Kasp87]
    Kasper, Robert. 1987. A Unification Method for Disjunctive Feature Description. In: ACL Proceedings, 25th Annual Meeting, 235–242.Google Scholar
  6. [Kasp88]
    Kasper, Robert. 1988. Conditional Descriptions in Functional Unification Grammar. In: ACL Proceedings, 26th Annual Meeting, 233–240Google Scholar
  7. [Kay79]
    Kay, Martin. 1979. Functional Grammar. In: Proceedings of the Fifth Annual Meeting of the Berkeley Linguistic Society, Christine Chiarrello et. al., eds., Berkeley Linguistic Society, Berkeley, California, 251–278Google Scholar
  8. [Kay84]
    Kay, Martin. 1985. Parsing in functional unification grammar. In: Natural Language Parsing, David R. Dowty, Lauri Karttunen and Arnold M. Zwicky, eds., Cambridge University Press, Cambridge, England, 251–278Google Scholar
  9. [Mosh87]
    Moshier, M. Drew and William C. Rounds. 1987. A logic for partially specified data structures. In: ACM Symposium on the Principles of Programming Languages, Association for Computing MachineryGoogle Scholar
  10. [Pere87a]
    Pereira, Fernando C.N. 1987. Grammars and Logics of Partial Information. Technical Note no. 420, SRI International, Menlo Park, CaliforniaGoogle Scholar
  11. [Pere87b]
    Pereira, Fernando C.N. and S.M. Shieber. 1987. Prolog and Natural-Language Analysis. CSLI Lecture Notes 10. Stanford, CaliforniaGoogle Scholar
  12. [Roun86]
    Rounds, William C. and Robert Kasper. 1986. A complete logical calculus for record structures representing linguistic information. In: Symposium on Logic in Computer Science, IEEE Computer SocietyGoogle Scholar
  13. [Shie83]
    Shieber, S.M., H. Uszkorheit, F.C.N. Pereira, J.J. Robinson and M. Tyson. 1983. The formalism and implementation of PATR-II. In: Research on Interactive Acquisition and Use of Knowledge. SRI International, Menlo Park, California, 39–74.Google Scholar
  14. [Shie85]
    Shieber, S.M. 1985. Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms. In: ACL Proceedings, 23rd Annual Meeting, 145–152.Google Scholar
  15. [Warr80]
    Warren, D.H.D. 1980. An Abstract Prolog Instruction Set. Technical report 309, AI Center, SRI International, Menlo park, CaliforniaGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Luis Damas
    • 1
  • Giovanni B. Varile
    • 2
  1. 1.Universidade do PortoPortoPortugal
  2. 2.CECLuxembourgLuxembourg

Personalised recommendations