In linguistics, relational grammar (RG) is a syntactic theory which argues that primitive grammatical relations provide the ideal means to state syntactic rules in universal terms. Relational grammar began as an alternative to transformational grammar. In relational grammar, constituents that serve as the arguments to predicates are numbered in what is called the grammatical relations (GR) hierarchy. This numbering system corresponds loosely to the notions of subject, direct object and indirect object. The numbering scheme is subject → (1), direct object → (2) and indirect object → (3). Other constituents (such as oblique, genitive, and object of comparative) are called nonterms (N). The predicate is marked (P). According to Geoffrey K. Pullum (1977), the GR hierarchy directly corresponds to the accessibility hierarchy: A schematic representation of a clause in this formalism might look like: Strata Chomage (see chômeur) Predicate valence One of the components of RG theory is a set of linguistic universals stated in terms of the numbered roles presented above. Such a universal is the stratal uniqueness law, which states that there can be at most one 1, 2, and 3 per stratum. Pullum (1977) lists three more universals: The NP constituents of a clause are linearized in their GR hierarchy order, from left to right. The verb of a clause may be placed in (a) initial position in all clauses, (b) second position in all clauses, or (c) final position in all clauses. If placement of the verb leaves the subject NP noninitial, the subject may be assigned final position. However, Pullum formulated these universals before the discovery of languages with object-initial word order. After the discovery of such languages, he retracted his prior statements. Johnson, David E. (1974–1979). Toward a Theory of Relationally-based Grammar. Outstanding Dissertations in Linguistics Series, ed. Jorge Hankamer. NY: Garland Publishing, Inc. Johnson, David E. and Paul M. Postal (1980). Arc Pair Grammar. Princeton: PUP. Newmeyer, Frederick (1980).

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.