File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/metho/80/c80-1062_metho.xml
Size: 6,891 bytes
Last Modified: 2025-10-06 14:11:20
<?xml version="1.0" standalone="yes"?> <Paper uid="C80-1062"> <Title>RANDOM ORDERINGS QUASI ORDERINGS UNORDERINGS SEMI PARTIAL SEMI ORDERINGS PARTIAL ORDERINGS \ / TOTAL ORDERINGS (= &quot;NON-CONTRADICTORY&quot; SIMULTANEOUS APPLICATION)</Title> <Section position="1" start_page="0" end_page="0" type="metho"> <SectionTitle> FORMAL PROPERTIES OF RULE ORDERINGS IN LINGUISTICS </SectionTitle> <Paragraph position="0"/> <Section position="1" start_page="0" end_page="0" type="sub_section"> <SectionTitle> Francis Jeffry Pelletier </SectionTitle> <Paragraph position="0"> Dept. Philosophy, Univ. Alberta, Edmonton Alberta Canada Abs tract The discovery in the late 1960's that standard linguistic theory (of Chomsky's Aspects) was equivalent in generative power to unrestricted rewrite rules caused linguists to search for a &quot;stronger linguistic metatheory&quot;. It seemed to some of these researchers that this meant describing linguistic theory by means of rules which were more restricted than type 0 languages. Such a view we call the L-view of constraints on linguistic theory: it advocates constraining the allowable rules in such a way that legitimate grammars can no longer generate arbitrary r.e. sets, but only some subset of them. To other researchers this discovery meant rather that one should place restrictions on linguistic theory so that the kinds of grammars allowed would be limited, regardless of whether such limitations affected the generative power of the theory. We call this the G-view of constraints. The L- and G-views are not equivalent limitations. For example, a G-view limitation on the class of regular grammars that any legitimate grammar be right-embedding is not thereby a L-view limitation, since this does not effect an alteration in generative power of the grammars allowed. The G-view is avowedly psychological; according to it, the point of placing constraints on grammars is to lessen directly the language learner's burden of choosing the correct grammar from all the possible ones. For the L-view, this is a side effect of disallowing whole classes of grammars in the first place.</Paragraph> <Paragraph position="1"> One area in linguistics where restrictions on linguistic theory have been advocated is in the ordering (within the cycle) of the application of the rules which generate the language. Here are eight proposals that have been aired in linguistics about how the rules might be ordered. null Total Ordering: there is a unique first rules a unique second ..... a unique last rule.</Paragraph> <Paragraph position="2"> Every derivation applies the rules in this order.</Paragraph> <Paragraph position="3"> Partial Ordering: there is a unique first rule, but thereafter at every stage of a derivation there are two rules which are candidates for application: the rule which was just applied and the (unique) next different rule.</Paragraph> <Paragraph position="4"> Semi Ordering: the rules are given a total ordering, but different derivations may start at different places in the ordering and choose any &quot;later&quot; rule as the next rule to be applied.</Paragraph> <Paragraph position="5"> Semi Partial Ordering: the rules are given a partial ordering, but different derivations may start at different places in the ordering and choose either the last-applied rule or else any &quot;later&quot; rule as the next rule to be applied.</Paragraph> <Paragraph position="6"> Unorderings: any derivation can apply the rules in any order, subject only to the constraint that once a rule has been applied in a derivation, it is no longer eligible for application at a later stage of that derivation. null Quasi Ordering: any derivation can apply the rules in any order, subject only to the constraint that once a rule has been applied in a derivation, the only other time it may be applied in that derivation is to its own output.</Paragraph> <Paragraph position="7"> Random Ordering: there is no order imposed on the rules; any derivation can apply the rules in any order.</Paragraph> <Paragraph position="8"> Simultaneous Application: the entire set of rules is applied to an input &quot;all at once&quot;; this prevents some of the rules from creating or destroying part of the input in such a way as to affect the applicability of other rules.</Paragraph> <Paragraph position="9"> Advocates of one or another of these rule orderings have adopted the G-view, and feel that the rule ordering restrictions they desire will directly lessen the psychological task of learning the correct grammar. The arguments for this conclusion are canvassed and found to be inconclusive (at best). The present paper adopts the L-view and, consequently, investigates the issue of generative power of the various theories of rule orderings. We are really interested in more than just the weak generative power of these theories: we would want to know whether every empirical claim (such as ambiguity, paraphrase, etc.) which can be made by one theory could also be made by another (their strong generative capacity). We trust that if, for any grammar obeying rule ordering conditions A there is a grammar obeying rule ordering conditions B such that they both obey standard linguistic strictures -412 on the correctness of rules and such that the two contain exactly the same class of derivations, then rule ordering theory B is at least as powerful in strong generative capacity as rule ordering theory A. If the converse can also be established, then they are equivalent in strong generative capacity~ if the converse cannot also be established then rule ordering theory B is more powerful in strong generative capacity than rule ordering theory A. If they can each be shown to generate empirical claims the other can't, then they are non-comparable i_nq strong generative capacity. A series of theorems are proved resulting in the relationships illustrated in Figure 1 (attached). Some linguists who advocate &quot;random ordering&quot; actually have in mind random ordering plus some &quot;universal principles&quot;. These universal principles are intended to rule out certain derivations - - those derivations in which pairs of rules are not applied in the order specified by the principles. (Also, since their proponents hold the G-view, these principles are supposed to correspond to psychologically plausible learning/processing strategies). We investigate the effect of four of these principles from the standpoint of the L-view, showing that two of them are strongly equivalent to total orderings and that two of them are intermediate between total and partial orderings.</Paragraph> <Paragraph position="10"> We close with an indication of what the role of mathematical linguistics Should be for the ordinary working linguist.</Paragraph> </Section> </Section> class="xml-element"></Paper>