Skip to main content Accessibility help
×
Home
Hostname: page-component-768dbb666b-gx6zg Total loading time: 0.44 Render date: 2023-02-05T01:34:00.346Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Bibliography

Published online by Cambridge University Press:  25 October 2011

Nissim Francez
Affiliation:
Technion - Israel Institute of Technology, Haifa
Shuly Wintner
Affiliation:
University of Haifa, Israel
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Unification Grammars , pp. 299 - 306
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aho, Alfred, V. and Jeffrey D., Ullman. The Theory of Parsing, Translation and Compiling, volume 1: Parsing. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1972.Google Scholar
Aho, Alfred, V, John E., Hopcroft, and Jeffrey D., Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.Google Scholar
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.Google Scholar
Aït-Kaci, Hassan, and Roger, Nasr. LOGIN: a logic programming language with built-in inheritance. Journal of Logic Programming, 3:185–215, 1986.CrossRefGoogle Scholar
Aït-Kaci, Hassan, and Andreas, Podelski. Towards a meaning of LIFE. Journal of Logic Programming, 16(3–4):195–234, July–August 1993.CrossRefGoogle Scholar
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.Google Scholar
Akmajian, Adrian, Richard A., Demers, and Robert M., Harnish. Linguistics: An Introduction to Language and Communication. MIT Press, Cambridge, MA, second edition, 1984.Google Scholar
Alblas, Henk, and Borivoj, Melichar, editors. Attributed grammars, applications and systems, volume 545 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1991.CrossRefGoogle Scholar
Allen, James. Natural Language Understanding. Benjamin/Cummings, New York, NY, second edition, 1995.Google Scholar
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.Google Scholar
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.Google Scholar
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.Google Scholar
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.Google Scholar
Berwick, Robert, C.Computational complexity and lexical-functional grammar. Computational Linguistics, 8(3–4):97–109, 1982. ISSN 0891. 2017.Google Scholar
Steven, Bird, Ewan, Klein, and Edward, Loper. Natural Language Processing with Python. O'Reilly Media, Sebastopol, CA, 2009.Google Scholar
Bloomfield, Leonard. Language. Holt, Rinehart and Winston, New York, 1933.Google Scholar
Borsley, Robert, D.Modern phrase structure grammar. Number 11 in Blackwell textbooks in linguistics. Blackwell, Oxford, UK, 1996.Google Scholar
Bresnan, Joan, Ronald M., Kaplan, Stanley, Peters, and Annie, Zaenen. Cross-serial dependencies in Dutch. Linguistic Inquiry, 13(4):613–635, 1982.Google Scholar
Buszkowski, Wojciech, and Gerald, Penn. Categorial grammars determined from linguistic data by unification. Studia Logica, 49(4):431–454, 1990. URL http://dx.doi.org/10.1007/BF00370157.CrossRefGoogle Scholar
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.Google Scholar
Carpenter, Bob. The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.CrossRefGoogle Scholar
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.Google Scholar
Chomsky, Noam. Syntactic Structures. Mouton & Co., The Hague, The Netherlands, 1957.Google Scholar
Copestake, Ann. The (new) LKB system. Technical report, Stanford University, September 1999.
Copestake, Ann. Implementing Typed Feature Structure Grammars. CSLI Publications, Stanford, 2002.Google Scholar
Covington, Michael, A.Natural Language Processing for Prolog Programmers. Prentice Hall, Englewood Cliffs, NJ, 1994.Google Scholar
Dalrymple, Mary. Lexical Functional Grammar, volume 34 of Syntax and Semantics. Academic Press, New York, 2001.CrossRefGoogle Scholar
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.Google Scholar
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 http://dx.doi.org/10.1007/3-540-60428-6_29.Google Scholar
Earley, Jay. An efficient context-free parsing algorithm. In Communications of the ACM, volume 2, pages 94–102, February 1970.Google Scholar
Emerson, E., Allen. Alternative semantics for temporal logics. Theoretical Computer Science, 26:121–130, 1983.CrossRefGoogle Scholar
Feinstein, Daniel and Shuly, Wintner. Highly constrained unification grammars. Journal of Logic, Language and Information, 17(3):345–381, 2008. URL http://dx.doi.org/10.1007/s10849-008-9062-9.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Gazdar, Gerald and Chris, Mellish. Natural Language Processing in LISP/PROLOG. Eddison Wesley, Wokingham, England, 1989.Google Scholar
Gazdar, Gerald and Geoffrey K., Pullum. Computationally relevant properties of natural languages and their grammars. New Generation Computing, 3:273–306, 1985.CrossRefGoogle Scholar
Gerald E., Gazdar, Ewan, Klein, Jeoffrey K., Pullum, and Ivan A., Sag. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, MA, 1985.Google Scholar
Groenink, Annius, V.Mild context-sensitivity and tuple-based generalizations of context-grammar. Linguistics and Philosophy, 20:607–636, 1997. URL http://dx.doi.org/10.1023/A:1005376413354.CrossRefGoogle Scholar
Haas, Andrew. A parsing algorithm for unification grammar. Computational Linguistics, 15(4):219–232, December 1989.Google Scholar
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.Google Scholar
Harrison, Michael, A.Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.Google Scholar
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.Google Scholar
Jaffar, Joxan. Efficient unification over infinite terms. New Generation Computing, 2:207–219, 1984.CrossRefGoogle Scholar
Johnson, Mark. Attribute-Value Logic and the Theory of Grammar, volume 16 of CSLI Lecture Notes. CSLI, Stanford, CA, 1988.Google Scholar
Joshi, Aravind, K.An introduction to tree adjoining grammars. In Alexis, Manaster-Ramer, editor, Mathematics of Language, pages 87–114. John Benjamins, Amsterdam, 1987.CrossRefGoogle Scholar
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.Google Scholar
Joshi, Aravind, K., Leon S., Levy, and Masako, Takahashi. Tree adjunct grammars. Journal of Computer and System Sciences, 10(1):136–163, 1975.CrossRefGoogle Scholar
Jurafsky, Daniel and James H., Martin. Speech and Language Processing. Prentice Hall Series in Artificial Intelligence. Prentice Hall, NJ, 2000.Google Scholar
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.Google Scholar
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.Google Scholar
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.Google Scholar
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.CrossRefGoogle Scholar
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.Google Scholar
Kay, Martin. Functional unification grammar. In 5th Annual Meeting of the Berkeley Linguistic Society, Berkeley, CA, 1979.Google Scholar
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.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Knuth, Donald, E.Semantics of context free languages. Mathematical Systems Theory, 2:127–145, 1968. (correction in Mathematical Systems Theory5, pp. 95-96, 1971).CrossRefGoogle Scholar
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.Google Scholar
Lewis, Harry, R. and Christos H., Papadimitriou. Elements of the Theory of Computation. Prentice-Hall software series. Prentice-Hall, Englewood Cliffs, NJ, 1981.Google Scholar
Lyons, John. Introduction to Theoretical Linguistics. Cambridge University Press, Cambridge, 1968.CrossRefGoogle Scholar
Manaster-Ramer, Alexis. Dutch as a formal language. Linguistics and Philosophy, 10:221–246, 1987.CrossRefGoogle Scholar
Manning, Christopher, D. and Hinrich, Schütze. Foundations of statistical natural language processing. The MIT Press, Cambridge, MA, 1999.Google Scholar
Martelli, Alberto and Ugo, Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258–282, 1982.CrossRefGoogle Scholar
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.Google Scholar
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 http://dx.doi.org/10.1007.BFb0052165.Google Scholar
Miller, Philip. Strong Generative Capacity: The Semantics of Linguistic Formalism. CSLI Publications, Stanford, CA, 1999.Google Scholar
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.CrossRefGoogle Scholar
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.Google Scholar
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.Google Scholar
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.Google Scholar
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: http://dx.doi.org/10.3115/981175.981187. URL http://dx.doi.org/10.3115/981175.981187.CrossRefGoogle Scholar
Pereira Fernando, C. N. and Stuart M., Shieber. Prolog and natural-language analysis, volume 10 of CSLI lecture notes. CSLI, Chicago, 1987.Google Scholar
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.CrossRefGoogle Scholar
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.Google Scholar
Pollard, Carl and Ivan A., Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press and CSLI Publications, 1994.Google Scholar
Pullum Geoffrey, K. and Gerald, Gazdar. Natural languages and context-free languages. Linguistics and Philosophy, 4:471–504, 1982.CrossRefGoogle Scholar
Radzinski, Daniel. Chinese number-names, tree adjoining languages, and mild contextsensitivity. Computational Linguistics, 17(3):277–299, 1991.Google Scholar
Ristad Eric, Sven. Computational structure of GPSG models. Linguistics and Philosophy, 13(5):521–587, 1990.CrossRefGoogle Scholar
Robinson John, Alan. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23–41, 1965.CrossRefGoogle Scholar
Sag, Ivan, A, and Thomas, Wasow. Syntactic Theory: A Formal Introduction. CSLI, Stanford, CA, 1999.Google Scholar
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.Google Scholar
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.CrossRefGoogle Scholar
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.Google Scholar
Shieber, Stuart, M.Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333–343, 1985.CrossRefGoogle Scholar
Shieber, Stuart, M.An Introduction to Unification Based Approaches to Grammar. Number 4 in CSLI Lecture Notes. CSLI, 1986.Google Scholar
Shieber, Stuart, M.Constraint-Based Grammar Formalisms. MIT Press, Cambridge, MA, 1992.Google Scholar
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.CrossRefGoogle Scholar
Sikkel, Klaas. Parsing Schemata. Klaas Sikkel, Enschede, 1993.Google Scholar
Sikkel, Klaas. Parsing Schemata. Texts in Theoretical Computer Science – An EATCS Series. Springer Verlag, Berlin, 1997.CrossRefGoogle Scholar
Steedman, Mark. The Syntactic Process. Language, Speech and Communication. The MIT Press, Cambridge, MA, 2000.Google Scholar
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.Google Scholar
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.Google Scholar
Vijay-Shanker, K. and David J., Weir. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591–636, 1993.Google Scholar
Vijay-Shanker, K. and David J., Weir. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27:511–545, 1994.CrossRefGoogle Scholar
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.Google Scholar
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.CrossRefGoogle Scholar
Wintner, Shuly and Uzzi, Ornan. Syntactic analysis of Hebrew sentences. Natural Language Engineering, 1(3):261–288, September 1996.Google Scholar
Wood Mary, McGee. Categorial Grammars. Linguistic Theory Guides. Routledge, London, 1993.Google Scholar
Wroblewski, David, A.Nondestructive graph unification. In 6th Annual Conference of the American Association of Artificial Intelligence, pages 582–587, 1987.Google Scholar
Younger, Daniel, H.Recognition and parsing of context-free languages in time n3. Information and Control, 10(2):189–208, 1967.CrossRefGoogle Scholar
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.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Bibliography
  • Nissim Francez, Technion - Israel Institute of Technology, Haifa, Shuly Wintner, University of Haifa, Israel
  • Book: Unification Grammars
  • Online publication: 25 October 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9781139013574.012
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Bibliography
  • Nissim Francez, Technion - Israel Institute of Technology, Haifa, Shuly Wintner, University of Haifa, Israel
  • Book: Unification Grammars
  • Online publication: 25 October 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9781139013574.012
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Bibliography
  • Nissim Francez, Technion - Israel Institute of Technology, Haifa, Shuly Wintner, University of Haifa, Israel
  • Book: Unification Grammars
  • Online publication: 25 October 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9781139013574.012
Available formats
×