Skip to main content Accessibility help
  • Cited by 5
Cambridge University Press
Online publication date:
October 2011
Print publication year:
Online ISBN:

Book description

Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors. This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG). The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated. While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars. Dozens of examples and numerous exercises (many with solutions) illustrate key points. Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.


'… the book offers a good introduction to unification grammars, which is exceptional in its rigorous mathematical treatment. It may be particularly well suited for use in university courses that not only seek to convey to students some basic knowledge and understanding of unification grammars but moreover attempt to familiarise them with formal descriptions and mathematical proofs.'

Mark-Jan Nederhof Source: Theory and Practice of Logic Programming

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.


Aho, Alfred, V. and Jeffrey D., Ullman. The Theory of Parsing, Translation and Compiling, volume 1: Parsing. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1972.
Aho, Alfred, V, John E., Hopcroft, and Jeffrey D., Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
Aït-Kaci, Hassan. A lattice-theoretic approach to computation based on a calculus of partially ordered types. PhD thesis, University of Pennsylvania, 1984.
Aït-Kaci, Hassan. An introduction to LIFE – programming with logic, inheritance, functions and equations. In Dale, Miller, editor, Logic Programming – Proceedings of the 1993. International Symposium, pages 52–68, MIT Press, Cambridge, MA, 1993.
Aït-Kaci, Hassan, and Roger, Nasr. LOGIN: a logic programming language with built-in inheritance. Journal of Logic Programming, 3:185–215, 1986.
Aït-Kaci, Hassan, and Andreas, Podelski. Towards a meaning of LIFE. Journal of Logic Programming, 16(3–4):195–234, July–August 1993.
Aït-Kaci, Hassan, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. In Dale, Miller, editor, Logic Programming – Proceedings of the 1993. International Symposium, pages 506–524, MIT Press, Cambridge, MA, 1993.
Akmajian, Adrian, Richard A., Demers, and Robert M., Harnish. Linguistics: An Introduction to Language and Communication. MIT Press, Cambridge, MA, second edition, 1984.
Alblas, Henk, and Borivoj, Melichar, editors. Attributed grammars, applications and systems, volume 545 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1991.
Allen, James. Natural Language Understanding. Benjamin/Cummings, New York, NY, second edition, 1995.
Barton, Jr., G., Edward, Robert C., Berwick, and Eric Sven, Ristad. Agreement and ambiguity. In Barton et al., editors, Computational Complexity and Natural Language, chapter 3, pages 89–102, 1987.
Barton, Jr., G., Edward, Robert C., Berwick, and Eric Sven, Ristad, editors. Computational Complexity and Natural Language. Computational Models of Cognition and Perception. MIT Press, Cambridge, MA, 1987.
Barton, Jr., G., Edward, Robert C., Berwick, and Eric Sven, Ristad. The complexity of LFG. In Barton et al., editors Computational Complexity and Natural Language chapter 4, pages 103–114, 1987.
Bayer, Sam and Mark, Johnson. Features and agreement. In Proceedings of the 33rd Annual Meeting of the Associati on for Computational Linguistics, Cambridge, MA, June 1995.
Berwick, Robert, C.Computational complexity and lexical-functional grammar. Computational Linguistics, 8(3–4):97–109, 1982. ISSN 0891. 2017.
Steven, Bird, Ewan, Klein, and Edward, Loper. Natural Language Processing with Python. O'Reilly Media, Sebastopol, CA, 2009.
Bloomfield, Leonard. Language. Holt, Rinehart and Winston, New York, 1933.
Borsley, Robert, D.Modern phrase structure grammar. Number 11 in Blackwell textbooks in linguistics. Blackwell, Oxford, UK, 1996.
Bresnan, Joan, Ronald M., Kaplan, Stanley, Peters, and Annie, Zaenen. Cross-serial dependencies in Dutch. Linguistic Inquiry, 13(4):613–635, 1982.
Buszkowski, Wojciech, and Gerald, Penn. Categorial grammars determined from linguistic data by unification. Studia Logica, 49(4):431–454, 1990. URL
Butt, Miriam, Tracy Holloway King, María-Eugenia Niño, and Frédérique Segond. A Grammar Writer's Cookbook. CSLI Publications, Stanford, CA, 1999.
Carpenter, Bob. Typed feature structures: A generalization of first-order terms. In Vijai, Saraswat and Ueda, Kazunori, editors, Logic Programming – Proceedings of the 1991. International Symposium, pages 187–201, MIT Press, Cambridge, MA, 1991.
Carpenter, Bob. The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
Carpenter, Bob, and Gerald, Penn. ALE 2.0 user's guide. Technical report, Laboratory for Computational Linguistics, Philosophy Department, Carnegie Mellon University, Pittsburgh, PA 15213, December 1994.
Chomsky, Noam. Three models for the description of language. In I. R. E. transactions on information theory, Proceedings of the symposium on information theory, volume IT-2, pages 113–123, September 1956.
Chomsky, Noam. Syntactic Structures. Mouton & Co., The Hague, The Netherlands, 1957.
Copestake, Ann. The (new) LKB system. Technical report, Stanford University, September 1999.
Copestake, Ann. Implementing Typed Feature Structure Grammars. CSLI Publications, Stanford, 2002.
Covington, Michael, A.Natural Language Processing for Prolog Programmers. Prentice Hall, Englewood Cliffs, NJ, 1994.
Dalrymple, Mary. Lexical Functional Grammar, volume 34 of Syntax and Semantics. Academic Press, New York, 2001.
Dalrymple, Mary, Ronald M., Kaplan, John T., Maxwell, and Annie, Zaenen, editors. Formal Issues in Lexical-Functional Grammar, volume 47 of CSLI lecture notes. CSLI, Stanford, CA, 1995.
Damas, Luís and Nelma, Moreira. Constraint categorial grammars. In Carlos, Pinto-Ferreira and Nuno, Mamede, editors, Progress in Artificial Intelligence, volume 990 of Lecture Notes in Computer Science, pages 347–358. Springer, Berlin and Heidelberg, 1995. URL
Earley, Jay. An efficient context-free parsing algorithm. In Communications of the ACM, volume 2, pages 94–102, February 1970.
Emerson, E., Allen. Alternative semantics for temporal logics. Theoretical Computer Science, 26:121–130, 1983.
Feinstein, Daniel and Shuly, Wintner. Highly constrained unification grammars. Journal of Logic, Language and Information, 17(3):345–381, 2008. URL
Gazdar, Gerald. Applicability of indexed grammars to natural languages. In Uwe, Reyle and Christian, Rohrer, editors, Natural Language Parsing and Linguistic Theories, pages 69–94. Reidel Publishing Company, Dordrecht, 1988.
Gazdar, Gerald and Chris, Mellish. Natural Language Processing in LISP/PROLOG. Eddison Wesley, Wokingham, England, 1989.
Gazdar, Gerald and Geoffrey K., Pullum. Computationally relevant properties of natural languages and their grammars. New Generation Computing, 3:273–306, 1985.
Gerald E., Gazdar, Ewan, Klein, Jeoffrey K., Pullum, and Ivan A., Sag. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, MA, 1985.
Groenink, Annius, V.Mild context-sensitivity and tuple-based generalizations of context-grammar. Linguistics and Philosophy, 20:607–636, 1997. URL
Haas, Andrew. A parsing algorithm for unification grammar. Computational Linguistics, 15(4):219–232, December 1989.
Haddock, Nicholas, Ewan, Klein, and Glyn, Morill, editors. Categorial Grammar, Unification and Parsing, volume 1 of Working Papers in Cognitive Science. University of Edinburgh, Center for Cognitive Science, 1987.
Harrison, Michael, A.Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
Jaeger, Efrat. Unification grammars and off-line parsability. Master's thesis, Technion – Israel Institute of Technology, Haifa, Israel, November 2002.
Jaeger, Efrat, Nissim, Francez, and Shuly, Wintner. Guaranteeing parsing termination of unification grammars. In Proceedgins of COLING'02, pages 397–403, August 2002.
Jaeger, Efrat, Nissim, Francez, and Shuly, Wintner. Unification grammars and off-line parsability. Journal of Logic, Language and Information, 13(4), 2004.
Jaffar, Joxan. Efficient unification over infinite terms. New Generation Computing, 2:207–219, 1984.
Johnson, Mark. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, Stanford, CA, 1988.
Joshi, Aravind, K.An introduction to tree adjoining grammars. In Alexis, Manaster-Ramer, editor, Mathematics of Language, pages 87–114. John Benjamins, Amsterdam, 1987.
Joshi, Aravind, K.Tree-adjoining grammars. In Ruslan, Mitkov, editor, The Oxford Handbook of Computational Linguistics, chapter 26, pages 483–500. Oxford university Press, 2003.
Joshi, Aravind, K., Leon S., Levy, and Masako, Takahashi. Tree adjunct grammars. Journal of Computer and System Sciences, 10(1):136–163, 1975.
Jurafsky, Daniel and James H., Martin. Speech and Language Processing. Prentice Hall Series in Artificial Intelligence. Prentice Hall, NJ, 2000.
Kaplan, Ronald and Joan, Bresnan. Lexical functional grammar: A formal system for grammatical representation. In J., Bresnan, editor, The Mental Representation of Grammatical Relations, pages 173–281. MIT Press, Cambridge, MA, 1982.
Kaplan, Ronald, M.A general syntactic processor. In Randall, Rustin, editor, Natural Language Processing, number 8 in Courant Computer Science Symposium, pages 194–241. Algorithmics Press, P. O. Box 97, New York, NY 10012, 1973.
Kaplan, Ronald, M., Tracy Holloway, King, and John T., Maxwell III. Adapting existing grammars: The XLE approach. In N., OostijkJ., Carroll and R., Sutcliffe, editors, Proceedings of the COLING 2002 Workshop on Grammar Engineering and Evaluation, pages 29–35, 2002.
Karttunen, Lauri and Martin, Kay. Structure sharing with binary trees. In Proceedgins of the 23rd Annual Meeting of the Association for Computational Linguistics, pages 133–136, Chicago, 1985.
Kasami, T. An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, MA, 1965.
Kay, Martin. The MIND system. In Randall, Rustin, editor, Natural Language Processing, number 8 in Courant Computer Science Symposium, pages 155–188. Algorithmics Press, P. O. Box 97, New York, NY 10012, 1973.
Kay, Martin. Functional unification grammar. In 5th Annual Meeting of the Berkeley Linguistic Society, Berkeley, CA, 1979.
Kay, Martin. Unification grammar. Technical report, Xerox Palo Alto Research Center, Palo Alto, CA, 1983.
Kay, Martin. Parsing in functional unification grammar. In David, Dowty, Lauri, Karttunen, and Arnold, Zwicky, editors, Natural Language Parsing: Psychological, Computational and Theoretical Perspectives, chapter 7, pages 251–278. Cambridge University Press, Cambridge, 1985.
King Tracy, Holloway, Martin, Forst, Jonas, Kuhn, and Miriam, Butt. The feature space in parallel grammar writing. Research on Language and Computation, 3:139–163, 2005.
Knuth, Donald, E.Semantics of context free languages. Mathematical Systems Theory, 2:127–145, 1968. (correction in Mathematical Systems Theory5, pp. 95-96, 1971).
Kuhn, Jonas. Towards a simple architecture for the structure-function mapping. In Miriam, Butt and Tracy Holloway, King, editors, The Proceedings of the LFG '99 Conference. CSLI Publications, Stanford, 1999.
Lewis, Harry, R. and Christos H., Papadimitriou. Elements of the Theory of Computation. Prentice-Hall software series. Prentice-Hall, Englewood Cliffs, NJ, 1981.
Lyons, John. Introduction to Theoretical Linguistics. Cambridge University Press, Cambridge, 1968.
Manaster-Ramer, Alexis. Dutch as a formal language. Linguistics and Philosophy, 10:221–246, 1987.
Manning, Christopher, D. and Hinrich, Schütze. Foundations of statistical natural language processing. The MIT Press, Cambridge, MA, 1999.
Martelli, Alberto and Ugo, Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258–282, 1982.
Meurers, W., Detmar, Gerald, Penn, and Frank, Richter. A web-based instructional platform for constraint-based grammar formalisms and parsing. In Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching NLP and CL, pages 18–25, 2002.
Michaelis, Jens and Marcus, Kracht. Semilinearity as a syntactic invariant. In Christian, Retoré, editor, Logical Aspects of Computational Linguistics, volume 1328 of Lecture Notes in Computer Science, pages 329–345. Springer Berlin / Heidelberg, 1997. URL
Miller, Philip. Strong Generative Capacity: The Semantics of Linguistic Formalism. CSLI Publications, Stanford, CA, 1999.
Moortgat, Michael. Categorial type logics. In Johan van, Benthem and Alice ter, Meulen, editors, Handbook of Logic and Language, chapter 2, pages 93–177. Elsevier, Amsterdam, 1997.
Moshier, Drew. Extensions to Unification Grammars for the Description of Programming Languages. PhD thesis, University of Michigan, Ann Arbor, 1988.
Moshier Drew, M. and William C., Rounds. A logic for partially specified data structures. In 14th Annual ACM Symposium on Principles of Programming Languages, pages 156–167, January 1987.
Müller, Stefan. The Grammix CD Rom. a software collection for developing typed feature structure grammars. In Tracy Holloway, King and Emily M., Bender, editors, Grammar Engineering across Frameworks 2007, Studies in Computational Linguistics ONLINE, pages 259–266. CSLI Publications, Stanford, CA, 2007.
Oepen, Stephan, Daniel, Flickinger, Junichi, Tsujii, and Hans, Uszkoreit, editors. Collaborative Language Engineering. A Case Study in Efficient Grammar-Based Processing. CSLI Publications, Stanford, CA, 2002.
Pareschi, Remo and Mark, Steedman. A lazy way to chart-parse with categorial grammars. In Proceedings of the 25th Annual Meeting on Association for Computational Linguistics, pages 81–88, Morristown, NJ, 1987. Association for Computational Linguistics. doi: URL
Pereira Fernando, C. N. and Stuart M., Shieber. Prolog and natural-language analysis, volume 10 of CSLI lecture notes. CSLI, Chicago, 1987.
Pereira, Fernando, C. N. and David H. D., Warren. Parsing as deduction. In Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, pages 137–144, June 1983.
Pollard, Carl. Generalized phrase structure grammars, head grammars and natural language. PhD thesis, Stanford University, Stanford, CA, 1984.
Pollard, Carl and Ivan A., Sag. Information Based Syntax and Semantics. Number 13 in CSLI Lecture Notes. CSLI, 1987.
Pollard, Carl and Ivan A., Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press and CSLI Publications, 1994.
Pullum Geoffrey, K. and Gerald, Gazdar. Natural languages and context-free languages. Linguistics and Philosophy, 4:471–504, 1982.
Radzinski, Daniel. Chinese number-names, tree adjoining languages, and mild contextsensitivity. Computational Linguistics, 17(3):277–299, 1991.
Ristad Eric, Sven. Computational structure of GPSG models. Linguistics and Philosophy, 13(5):521–587, 1990.
Robinson John, Alan. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23–41, 1965.
Sag, Ivan, A, and Thomas, Wasow. Syntactic Theory: A Formal Introduction. CSLI, Stanford, CA, 1999.
Sag, Ivan, A.Gerald, Gazdar, Thomas, Wasow, and Steven, Weisler. Coordination and how to distinguish categories. Natural Language and Linguistic Theory, 3(2):117–171, 1985.
Satta, Giorgio. Tree-adjoining grammar parsing and boolean matrix multiplication. Computational Linguistics, 20(2), June 1994.
Savitch Walter, J.Emmon, Bach, William, Marsh, and Gila, Safran-Naveh, editors. The formal complexity of natural language, volume 33 of Studies in Linguistics and Philosophy. D. Reidel, Dordrecht, 1987.
Sells, Peter. Lectures on contemporary syntactic theories: an introduction to government-binding theory, generalized phrase structure grammar, and lexical-functional grammar, volume 3 of CSLI lecture notes. CSLI, Stanford, CA, 1988.
Shieber, Stuart, M.Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333–343, 1985.
Shieber, Stuart, M.An Introduction to Unification Based Approaches to Grammar. Number 4 in CSLI Lecture Notes. CSLI, 1986.
Shieber, Stuart, M.Constraint-Based Grammar Formalisms. MIT Press, Cambridge, MA, 1992.
Shieber, Stuart, M.Yves, Schabes, and Fernando, Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3–36, July/August 1995.
Sikkel, Klaas. Parsing Schemata. Klaas Sikkel, Enschede, 1993.
Sikkel, Klaas. Parsing Schemata. Texts in Theoretical Computer Science – An EATCS Series. Springer Verlag, Berlin, 1997.
Steedman, Mark. The Syntactic Process. Language, Speech and Communication. The MIT Press, Cambridge, MA, 2000.
Torenvliet, Leen and Marten, Trautwein. A note on the complexity of restricted attribute-value grammars. ILLC Research Report and Technical Notes Series CT-95-02, University of Amsterdam, Amsterdam, 1995.
Uszkoreit, Hans. Categorial unification grammars. In Proceedings of the 5th International Conference on Computational Linguistics, pages 187–194, Bonn, 1986.
Vijay-Shanker, K.A study of tree adjoining grammars. PhD thesis, the University of Pennsylvania, 1987.
Vijay-Shanker, K. and Aravind K., Joshi. Unification Based Tree Adjoining Grammars. In J., Wedekind, editor, Unification-based Grammars. MIT Press, Cambridge, MA, 1991.
Vijay-Shanker, K. and David J., Weir. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591–636, 1993.
Vijay-Shanker, K. and David J., Weir. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27:511–545, 1994.
Wintner, Shuly. An abstract machine for unification grammars. PhD thesis, Technion – Israel Institute of Technology, Haifa, Israel, January 1997.
Wintner, Shuly and Nissim, Francez. Parsing with typed feature structures. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 273–287, Prague, September 1995a.
Wintner, Shuly and Nissim, Francez. Parsing with typed feature structures. Technical Report LCL 95-1, Laboratory for Computational Linguistics, Technion, Israel Institute of Technology, Haifa 32000, Israel, December 1995b.
Wintner, Shuly and Nissim, Francez. Off-line parsability and the well-foundedness of subsumption. Journal of Logic, Language and Information, 8(1):1–16, January 1999.
Wintner, Shuly and Uzzi, Ornan. Syntactic analysis of Hebrew sentences. Natural Language Engineering, 1(3):261–288, September 1996.
Wood Mary, McGee. Categorial Grammars. Linguistic Theory Guides. Routledge, London, 1993.
Wroblewski, David, A.Nondestructive graph unification. In 6th Annual Conference of the American Association of Artificial Intelligence, pages 582–587, 1987.
Younger, Daniel, H.Recognition and parsing of context-free languages in time n3. Information and Control, 10(2):189–208, 1967.
Zeevat, Henk, Ewan, Klein, and Jo, Calder. An introduction to unification categorial grammar. In J. Nicholas, Haddock, Ewan, Klein, and Glyn, Morrill, editors, Edinburgh Working Papers in Cognitive Science, Vol. 1: Categorial Grammar, Unification Grammar, and Parsing. Centre for Cognitive Science, University of Edinburgh, 1987.


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.