Linguistics and Philosophy

, Volume 17, Issue 3, pp 221–248 | Cite as

Two ways of formalizing grammars

  • Mark Johnson

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Carpenter, R.: 1992,The Logic of Typed Feature Structures, Cambridge Tracts in Theoretical Computer Science 32, Cambridge University Press, Cambridge, England.Google Scholar
  2. Chen, W. and D. S. Warren: 1989,Abductive Logic Programming, m.s., Department of Computer Science, State University of New York at Stony Brook.Google Scholar
  3. Chomsky, N.: 1988,Some Notes on Economy of Derivation and Representation, m.s., Department of Linguistics and Philosophy, Massachusetts Institute of Technology.Google Scholar
  4. Clark, K. L.: 1978, ‘Negation as Failure’, in H. Gallaire and J. Minker (eds.),Logic and Databases, Plenum Press, New York.Google Scholar
  5. Colmerauer, A.: 1978, ‘Metamorphosis Grammars’, in Leonard Bloc (ed.),Natural Language Communication with Computers, Springer-Verlag, Berlin, Germany.Google Scholar
  6. Fagin, R.: 1990, ‘Finite-Model Theory — a Personal Perspective’, in S. Abiteboul and P. C. Kannellakis (eds.),ICDT '90: 3rd International Conference on Database Theory, Springer-Verlag, New York.Google Scholar
  7. Gallier, J.: 1986,Logic for Computer Science, Harper and Row, New York.Google Scholar
  8. Höhfeld, M. and G. Smolka: 1988,Definite Relations over Constraint Languages, LILOG Report 53, IBM Deutschland, Stuttgart.Google Scholar
  9. Johnson, M.: 1988,Attribute Value Logic and the Theory of Grammar, CSLI Lecture Notes Series, University of Chicago Press.Google Scholar
  10. Johnson, M.: 1990a, ‘Expressing Disjunctive and Negative Feature Constraints in Classical First-Order Logic’,Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics, Pittsburgh, Pennsylvania.Google Scholar
  11. Johnson, M.: 1990b, ‘Features, Frames and Quantifier-Free Formulae’, in P. Saint-Dizier and S. Szpakowicz (eds.),Logic and Logic Grammars for Language Processing, Ellis Horwood, New York.Google Scholar
  12. Johnson, M.: 1991a, ‘Features and Formulae’,Computational Linguistics 17(1), 131–152.Google Scholar
  13. Johnson, M.: 1991b, ‘Logic and Feature Structures’,Proceedings of IJCAI-91, Sydney, Australia.Google Scholar
  14. Johnson, M.: to appear, ‘Computing with Features as Formulae’,Computational Linguistics.Google Scholar
  15. Kaplan, R. and J. Bresnan: 1982, ‘Lexical-Functional Grammar: A Formal System for Grammatical Representation’, in J. Bresnan (ed.),The Mental Representation of Grammatical Relations, The MIT Press.Google Scholar
  16. Kasper, R. and W. Rounds: 1990, ‘The logic of Unification in Grammar’,Linguistics and Philosophy 13(1), 35–58.Google Scholar
  17. Kay, M.: 1979, ‘Functional Unification Grammar’,Proceedings of the 5th Annual Meeting of the Berkeley Linguistics Association, Berkeley, California.Google Scholar
  18. Lloyd, J. W.: 1984,Foundations of Logic Programming, Springer-Verlag, Berlin.Google Scholar
  19. Manaster-Ramer, A. and W. Rounds: 1987, ‘A Logical Version of Functional Grammar’,Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Palo Alto, California.Google Scholar
  20. Nelson, G. and Oppen, D. C.: 1980, ‘Fast Decision Procedures Based on Congruence Closure’,J. ACM 27(2), 356–364.Google Scholar
  21. Pereira, F.: 1982,Logic for Natural Language Analysis, Ph.D. thesis, The University of Edinburgh. Reprinted as Technical Note 275, Artificial Intelligence Center, SRI International, Menlo Park, California.Google Scholar
  22. Pereira, F. and S. Shieber: 1984, ‘The Semantics of Grammar Formalisms seen as Computer Languages’,The Proceedings of COLINC 1984 Association for Computational Linguistics, Stanford University, Palo Alto, California.Google Scholar
  23. Pereira, F. and S. Shieber: 1987,Prolog for Natural Language Analysis, CSLI Lecture Notes Series, University of Chicago Press.Google Scholar
  24. Pereira, F. and D. H. D. Warren: 1983, ‘Parsing as Deduction’,Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, MIT, Cambridge, Massachusetts.Google Scholar
  25. Pollard, C. and I. Sag: 1988,Head-Driven Phrase Structure Grammar, CSLI Lecture Notes Series, University of Chicago Press.Google Scholar
  26. Rounds, W. C.: 1988, ‘LFP: A Logic for Linguistic Descriptions and an Analysis of its Complexity’,Computational Linguistics 14(4), 1–10.Google Scholar
  27. Stabler, E.: 1992,The Logical Approach to Syntax: Foundations, Specifications and Implementations of Theories of Government and Binding. The MIT Press, Cambridge, Massachusetts.Google Scholar
  28. Shieber, S.: 1986,An Introduction to Unification-Based Theories of Grammar, CSLI Lecture Notes Series, University of Chicago Press.Google Scholar
  29. Shieber, S.: 1992,Constraint-Based Grammar Formalisms, The MIT Press, Cambridge, Massachusetts.Google Scholar
  30. Smolka, G.: 1992, ‘Feature-Constraint Logics for Unification Grammars’,Journal of Logic Programming 12(1&2), 51–88.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • Mark Johnson
    • 1
  1. 1.Cognitive and Linguistic SciencesBrown UniversityProvidenceUSA

Personalised recommendations