Categorial grammar and lexical-functional grammar

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    87 Downloads (Pure)

    Abstract

    This paper introduces $\lambda$-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, $\lambda$-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of {\em linear combinators}, closed pure $\lambda$-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable. While $\lambda$-grammars could be used to formalize many approaches to grammatical theory, they are certainly natural as a basis for the formalization of LFG. This leads to a theory I would like to call $\lambda$-LFG. In this paper it will be shown how the standard components of LFG can be set up in the framework. We will have descriptions of c-structure, descriptions of f-structure, and semantics. The difference between defining and constraining information will be explained in terms of entailment, and requirements on long-distance paths in f-structure will be explained in terms of entailment in the presence of a simple set of axioms.
    Original languageEnglish
    Title of host publicationProceedings of the LFG01 Conference, University of Hong Kong, Hong Kong
    EditorsM. Butt, T.H. King
    Place of PublicationStanford, CA
    PublisherCSLI Publications
    Pages259-279
    Number of pages21
    ISBN (Print)10986782
    Publication statusPublished - 2001

    Fingerprint

    Semantics
    Chemical analysis

    Cite this

    Muskens, R. A. (2001). Categorial grammar and lexical-functional grammar. In M. Butt, & T. H. King (Eds.), Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong (pp. 259-279). Stanford, CA: CSLI Publications.
    Muskens, R.A. / Categorial grammar and lexical-functional grammar. Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong. editor / M. Butt ; T.H. King. Stanford, CA : CSLI Publications, 2001. pp. 259-279
    @inproceedings{d11e29b483bd4c77843ded563546f661,
    title = "Categorial grammar and lexical-functional grammar",
    abstract = "This paper introduces $\lambda$-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, $\lambda$-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of {\em linear combinators}, closed pure $\lambda$-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable. While $\lambda$-grammars could be used to formalize many approaches to grammatical theory, they are certainly natural as a basis for the formalization of LFG. This leads to a theory I would like to call $\lambda$-LFG. In this paper it will be shown how the standard components of LFG can be set up in the framework. We will have descriptions of c-structure, descriptions of f-structure, and semantics. The difference between defining and constraining information will be explained in terms of entailment, and requirements on long-distance paths in f-structure will be explained in terms of entailment in the presence of a simple set of axioms.",
    author = "R.A. Muskens",
    note = "Pagination: 21",
    year = "2001",
    language = "English",
    isbn = "10986782",
    pages = "259--279",
    editor = "M. Butt and T.H. King",
    booktitle = "Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong",
    publisher = "CSLI Publications",

    }

    Muskens, RA 2001, Categorial grammar and lexical-functional grammar. in M Butt & TH King (eds), Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong. CSLI Publications, Stanford, CA, pp. 259-279.

    Categorial grammar and lexical-functional grammar. / Muskens, R.A.

    Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong. ed. / M. Butt; T.H. King. Stanford, CA : CSLI Publications, 2001. p. 259-279.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    TY - GEN

    T1 - Categorial grammar and lexical-functional grammar

    AU - Muskens, R.A.

    N1 - Pagination: 21

    PY - 2001

    Y1 - 2001

    N2 - This paper introduces $\lambda$-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, $\lambda$-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of {\em linear combinators}, closed pure $\lambda$-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable. While $\lambda$-grammars could be used to formalize many approaches to grammatical theory, they are certainly natural as a basis for the formalization of LFG. This leads to a theory I would like to call $\lambda$-LFG. In this paper it will be shown how the standard components of LFG can be set up in the framework. We will have descriptions of c-structure, descriptions of f-structure, and semantics. The difference between defining and constraining information will be explained in terms of entailment, and requirements on long-distance paths in f-structure will be explained in terms of entailment in the presence of a simple set of axioms.

    AB - This paper introduces $\lambda$-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, $\lambda$-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of {\em linear combinators}, closed pure $\lambda$-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable. While $\lambda$-grammars could be used to formalize many approaches to grammatical theory, they are certainly natural as a basis for the formalization of LFG. This leads to a theory I would like to call $\lambda$-LFG. In this paper it will be shown how the standard components of LFG can be set up in the framework. We will have descriptions of c-structure, descriptions of f-structure, and semantics. The difference between defining and constraining information will be explained in terms of entailment, and requirements on long-distance paths in f-structure will be explained in terms of entailment in the presence of a simple set of axioms.

    M3 - Conference contribution

    SN - 10986782

    SP - 259

    EP - 279

    BT - Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong

    A2 - Butt, M.

    A2 - King, T.H.

    PB - CSLI Publications

    CY - Stanford, CA

    ER -

    Muskens RA. Categorial grammar and lexical-functional grammar. In Butt M, King TH, editors, Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong. Stanford, CA: CSLI Publications. 2001. p. 259-279