| { |
| "paper_id": "E91-1016", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T10:38:13.083356Z" |
| }, |
| "title": "A LOGICAL APPROACH TO !ARABIC PHONOLOGY", |
| "authors": [ |
| { |
| "first": "Steven", |
| "middle": [], |
| "last": "Bird", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "steven@cogsci.ed.ac.uk" |
| }, |
| { |
| "first": "Patrick", |
| "middle": [], |
| "last": "Blackburn", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "patrick@cogsci@ed.ae.uk" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Logical approaches to linguistic description, particularly those which employ feature structures, have generally treated phonology as though it was the same as orthography. This approach breaks down for languages where the phonological shape of a morpheme can be heavily dependent on the phonological shape of another, as is the case in Arabic. In this paper we show how the tense logical approach investigated by Blackburn (1989) can be used to encode hierarchical and temporal phonological information of the kind explored by Bird (1990). Then we show how some Arabic morphemes may be represented and combined t. _ 91 .", |
| "pdf_parse": { |
| "paper_id": "E91-1016", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Logical approaches to linguistic description, particularly those which employ feature structures, have generally treated phonology as though it was the same as orthography. This approach breaks down for languages where the phonological shape of a morpheme can be heavily dependent on the phonological shape of another, as is the case in Arabic. In this paper we show how the tense logical approach investigated by Blackburn (1989) can be used to encode hierarchical and temporal phonological information of the kind explored by Bird (1990). Then we show how some Arabic morphemes may be represented and combined t. _ 91 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "There is an increasingly widespread view that linguistic behaviour results from the complex interaction of multiple sources of partial information. This is exemplified by the rapidly growing body of work on natural language syntax and semantics such as the Unification-Based Grammar Formalisms. Similarly, in phonology there is a popular view of phonological representations as having the same topology as a spiral-bound notebook, where segments (or slots) axe strung out along the spine and each page gives a structural description of that suing according to some descriptive vocabulary. Crucially only those segmental strings which are licensed by all of the independent descriptions are acceptable.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "INTRODUCTION", |
| "sec_num": null |
| }, |
| { |
| "text": "The practical difficulty is tO come up with a model of grammatical organization which allows the right information to be brought to bear at the right stage. One model which looks particularly attractive in this regard considers the traditional modules of grammar (i.e. syntax, semantics and phonology) not in series where the output of one feeds into the input of the next, but rather in parallel, where each module exerts independent constraints. For example, a morpheme may be represented as a complex consisting of a semantic expression, a constraint on (morpho)syntactic distribution, and a phonological description. The combination of morphemes is then subject to three independent calculi, one per domain. The result is a compositional account of the relationship between form and meaning, as evidenced in the work of Bach (1983) , Hoeksema & Janda (1988) and Wheeler (1988) . However, all these proposals have assumed that phonological representations are merely linear I We are indebted to Mike Reape, Ewan Klein and members of the Edinburgh Applied Logic group for discussions of the material presented here. We are grateful for the support of ESPRIT Basic Research Action 3175 (DYANA) and SERC post-doctoral fellowship B/ITF/255. sequences of segments. Such a restriction renders a theory incapable of expressing the observations which have been made in the non-linear phonology literature (e.g. Goldsmith 1990 ). Bird & Klein (1990) and Bird (1990) have endeavoured m show how the compositional approach can be liberated from a purely linear segmental view of phonology. This paper exemplifies and extends those proposals.", |
| "cite_spans": [ |
| { |
| "start": 824, |
| "end": 835, |
| "text": "Bach (1983)", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 838, |
| "end": 861, |
| "text": "Hoeksema & Janda (1988)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 866, |
| "end": 880, |
| "text": "Wheeler (1988)", |
| "ref_id": "BIBREF21" |
| }, |
| { |
| "start": 1406, |
| "end": 1420, |
| "text": "Goldsmith 1990", |
| "ref_id": "BIBREF12" |
| }, |
| { |
| "start": 1424, |
| "end": 1443, |
| "text": "Bird & Klein (1990)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 1448, |
| "end": 1459, |
| "text": "Bird (1990)", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "INTRODUCTION", |
| "sec_num": null |
| }, |
| { |
| "text": "The first section presents a logical language for phonological description. The second section shows how it has sufficient expressive power to encompass a variety of observations about syllable structure. The final section discusses further observations which can be made about Arabic syllable structure, and provides an illustrative treatment of socalled non-concatenative morphology in the perfect tense 'verb paradigm.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "INTRODUCTION", |
| "sec_num": null |
| }, |
| { |
| "text": "Interval based tense logics are calculi of temporal reasoning in which propositions are assigned truth values over extended periods of time s. Three operators F (future), P (past) and O (overlaps) are introduced: F~b means \"q~ will be the case (at least once)\", P~b means \"~b was the case (at least once)\" and O~b means \"~b is the case at some overlapping interval (at least once)\". O corresponds to what phonologists call 'association'. Typically sentences are true at some intervals and not at others. (This is obviously the case, for example, if ~b encodes the proposition \"the sun is shining\".) Blackburn (1989) has explored the effects of adding of a new type of symbol, called nominals, to tense logic. Unlike ordinary propositions, nominals are only ever true once. In a sense, a nominal is a 'name' (or a 'temporal indexical') for that unique period of time at which it is true. Certain observations about time can only be expressed in a theory which employs nominals. For example, i ~ -~Fi picks out precisely the irreflexive time flows, whereas no formula containing only propositional variables can do this. Nominals have been employed in the analysis of temporal reference in linguistic semantics. The present paper illustrates an application of nominals to a very different domain, namely phonology. In addition to F, P and O, we shall employ the modality O to represent phonological dominance a.", |
| "cite_spans": [ |
| { |
| "start": 599, |
| "end": 615, |
| "text": "Blackburn (1989)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "2 See van Benthem 1983 for an introduction to this field and a survey of a variety of possible formulations of temporal structure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "3 The notion of dominance as eanployed in phonology corresponds closely to the use of the term in feature logics. However. we treat dominance as a relation rather than as a collection of partial functions, for two reasons. First. in phonological structures, it is the nodes and not the arcs which are labelled. Second, there can be multiple arcs emanating from a node. Syntax. Let X = {p, q, r,...} be the propositional variables and let N = {i, j, k,...} be the nominals of L. Then L is the smallest set such that all of the following hold, where \u00a2, ~P E L.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "T,_k E L X,N C L <>~b,F\u00a2,P\u00a2,O\u00a2 E L ~b v \u00a2,-~\u00a2 E L", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "We define ---., ,---, and A as usual. We also define the duals of our modal operators in the usual fashion: G~b -~F~\u00a2 (~b is always going to be the case), H~b = -~P--,\u00a2 (~b always has been the case), C~b ~. ~O--,q~ (~b holds at all overlapping intervals) and El~b ~ ~O~b (~b is true at all 'daughter' intervals). Two additional defined operators will play an important role in what follows: Me = P~b V O~b V F~b, and its dual L\u00a2 ~_ ~M~\u00a2. It follows from the semi-linear time semantics adopted below that M~b means '~b holds at some time' and L~b means '~b holds at all times'. We will often abbreviate <>(p A ~b) using the expression (p)~b and abbreviate a sequence of such applications (Pl)'\" (p,,)~b using the expression {pl\"\" \"p,)\u00a2. We adopt a similar practice for the dual forms: [p]$ is shorthand for r3(p :... \u00a2) and [Pl \" \"P,,]$ is shorthand for [Pa]'\" [P,,] \u00a2. We also write <)n (or t3\") to stand for a length n sequence of 0s (or 13s).", |
| "cite_spans": [ |
| { |
| "start": 860, |
| "end": 865, |
| "text": "[P,,]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "Semantics. Let T be a set of intervals (which we will think of as nodes), and let ~, < and e be binary relations on T.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "As < models temporal precedence, it must be irreflexive and transitive, o models temporal overlap (phonological association), and so it is reflexive and symmetric. < and o interact as follows: (i) they are disjoint, (ii) for any tl, t2, t3, t4 G T, tl < t2 o t3 < t4 implies tl < t4 (that is, precedence is transitive through overlap), and (iii) for any t~, t2 E T, tl < t2 orhot2 orb > t2 (thatis, our conception of time is semi-linear). Note that the triple (T, <, o) is what temporal logicians call an interval structure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "The remaining relation ~ encodes the hierarchical organization of phonological structures. As a phonological unit overlaps all of its constituents (cf. Hayes 1990:44), we demand that the transitive closure of 8 be contained within o. Furthermore, phonological structures are never cyclic and so we require that for any h , . . . , t, ~ T, if h tt~ ..... tn-l~tn then it is not the case that t,,btl. By a phonological frame F we mean a quadruple (T, <, o, B}:of the type just described.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "It merely remains to link L with such structures. A valuation V is a function (X t3 N) --* 2 T that obeys three constraints. First, it must assign a singleton set to each nominal. Second, for each t E T, there is an i 6 N such that V(i) = {t}. Third, fib,t2 ~ V(p) wherep ~ X then tl o tu ---* t~ = t2. In short, valuations are functions which ensure nominals act as: names, where all intervals are named, and valuations capture the idea that phonological 'tiers' are linearly ordered. A model for L is a pair (F, V). If 9*( ~, \u00a2 then we say that ~b is true in M at :t. Note that under this semantics, M really does mean 'at some time' and L means 'at all times' (by virtue of semi-linearity).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LOGICAL FRAMEWORK", |
| "sec_num": null |
| }, |
| { |
| "text": "M = (F, V):, t E T, a ~ X O N. Then: M b, \" iff t e V(a) M b, --,~b iff M ~: ~b M ~, \u00a2 V 'C, iff M ~t \u00a2 or'M ~,", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Validities. If (F, '12) ~t ~b for all frames F, for all valuations V on F, and all t E T, then we say ff is a validity.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "The following are some examples of validities. The first group concerns our intervalic structure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(TI) i ---, --,Fi. Precedence is irreflexive. (T2) ~b ~ O~b. Overlap is reflexive. (T3) ~ --~ C0\u00a2. Overlap is symmetric. (T4) Fi---,-~Oi. Pi---,-~Oi.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Precedence and overlap are disjoint.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(TS) FOFqS --. F\u00a2.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Precedence is transitive through overlap.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(T6) F~AF\u00a2--~ F(\u00a2^F\u00a2)vF(~bAF\u00a2)vF{\u00a2AO~b).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Time is semi-linear 4 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "The next two validities concern the dominance relation and its interaction with the interval structure.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(D1) 0'*\u00a2 ~ O~b. The transitive closure of dominance is included in the overlap relation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(D2) i ---* -~O'* i. Dominance is acyclic.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "The next group of validities reflect the constraints we have placed on valuations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(FORCE) Mi.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Each nominal names at least one interval.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(NOM) i A M(i A \u00a2) --. \u00a2.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Each nominal names at most one interval.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "(PLIN) p A O(p ^ \u00a2) -.-* ~.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Phonological tiers are linearly ordered.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Proof Theory. It is straightforward using techniques discussed in (Gargov et al. 1987 , 1989 , Blackburn 1990 to provide a proof theory and obtain decidability results. At present we are investigating efficient proof methods for this logic and hope to implement a theorem prover.", |
| "cite_spans": [ |
| { |
| "start": 66, |
| "end": 85, |
| "text": "(Gargov et al. 1987", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 86, |
| "end": 92, |
| "text": ", 1989", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 93, |
| "end": 109, |
| "text": ", Blackburn 1990", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Satisfaction. Let", |
| "sec_num": null |
| }, |
| { |
| "text": "Feature Matrices. L can be used for describing feature matrices. For example, consider the matrix below.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXPRESSING PHONOLOGICAL CONSTRAINTS", |
| "sec_num": null |
| }, |
| { |
| "text": "A possible description of this matrix is: ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "(PHON)(Kay A Fi) A (PHON)(pats A i A F j) A (PHON)(Blackie A j).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "[,,,,o, [ []", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "That is, nominals may be used in the representation of reentrancy (Bird 1991) , Sort Lattices. Node labels in phonologists' diagrams (e.g. see example (1)) can be thought of as classifications. For example, we can think of p E X as denoting a certain class of nodes in a phonological structure (the mora nodes). Moras may be further classified into onset moras and coda moras, which are written as Po and/~c respectively. The relationship between /~, Po and Pc can then be expressed using the following formulas:", |
| "cite_spans": [ |
| { |
| "start": 66, |
| "end": 77, |
| "text": "(Bird 1991)", |
| "ref_id": "BIBREF3" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "L(p .-. po v pc) L(po A pc .--i)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "Such constraints are Boolean constraints. For example, a simple Boolean lattice validating the two formulas concerning moras above is ( {p, #o, #c, _L} ; po I-1 pc = .L, po LJ pc = # ). This is depicted as a diagram as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "~o G 3. Each element of X appears as a node in the diagram. The join (U) of two sorts p and q is the unique sort found by following lines upwards from p and q until they first connect, and conversely for the meet (I-1). For convenience, constraints on node classifications will be depicted using lattice diagrams of the above form. Trading on the fact that L contains propositional calculus, Boolean constraints can be uniformly expressed in L as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "(i) p I-I q = r becomes L(p A q ~ r) (ii) p U q = r becomes L(p V q .-. r)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "Appropriateness Constraints. As we shall see, the hierarchical prosodic structures of phonology are highly constrained. For example, syllables dominate moras and not the other way around, and so a structure where there is a mora dominating a syllable is ill-formed. Following (Bird 1990) , we express these restrictions on dominance by augmenting the sort lattice with a binary' 'appropriateness' relation A, represented graphically using arrows. We can express in L the constraints captured by such appropriateness graphs. For example, L(p --, -~Oq) expresses the fact that a node with sort p cannot dominate a node with sort q. We can also use L to express stronger \u00a2o~traints. For example, L(p -. Oq) expresses the fact that a node of sort p must dominate at least one node of sort q. In short, the O operator allows us to express graphical constraints.", |
| "cite_spans": [ |
| { |
| "start": 276, |
| "end": 287, |
| "text": "(Bird 1990)", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "[ PHON (Kay, pats, Blackle) ]", |
| "sec_num": null |
| }, |
| { |
| "text": "A phonological theory is a collection of generalizations expressed in a language of the above logic. We choose as our language X = tr, O'h, ell, ao, trc, (rho, ~rhc, alo, ale, p, /to, Pc, 7r, Xc, xv, b, d, h, J, k, n, r, s, t, w, ?, a, u We can describe these pictures using formulas from L. For example, (lc) is described by the formula:", |
| "cite_spans": [ |
| { |
| "start": 135, |
| "end": 139, |
| "text": "O'h,", |
| "ref_id": null |
| }, |
| { |
| "start": 140, |
| "end": 144, |
| "text": "ell,", |
| "ref_id": null |
| }, |
| { |
| "start": 145, |
| "end": 148, |
| "text": "ao,", |
| "ref_id": null |
| }, |
| { |
| "start": 149, |
| "end": 153, |
| "text": "trc,", |
| "ref_id": null |
| }, |
| { |
| "start": 154, |
| "end": 159, |
| "text": "(rho,", |
| "ref_id": null |
| }, |
| { |
| "start": 160, |
| "end": 165, |
| "text": "~rhc,", |
| "ref_id": null |
| }, |
| { |
| "start": 166, |
| "end": 170, |
| "text": "alo,", |
| "ref_id": null |
| }, |
| { |
| "start": 171, |
| "end": 175, |
| "text": "ale,", |
| "ref_id": null |
| }, |
| { |
| "start": 176, |
| "end": 178, |
| "text": "p,", |
| "ref_id": null |
| }, |
| { |
| "start": 179, |
| "end": 183, |
| "text": "/to,", |
| "ref_id": null |
| }, |
| { |
| "start": 184, |
| "end": 187, |
| "text": "Pc,", |
| "ref_id": null |
| }, |
| { |
| "start": 188, |
| "end": 191, |
| "text": "7r,", |
| "ref_id": null |
| }, |
| { |
| "start": 192, |
| "end": 195, |
| "text": "Xc,", |
| "ref_id": null |
| }, |
| { |
| "start": 196, |
| "end": 199, |
| "text": "xv,", |
| "ref_id": null |
| }, |
| { |
| "start": 200, |
| "end": 202, |
| "text": "b,", |
| "ref_id": null |
| }, |
| { |
| "start": 203, |
| "end": 205, |
| "text": "d,", |
| "ref_id": null |
| }, |
| { |
| "start": 206, |
| "end": 208, |
| "text": "h,", |
| "ref_id": null |
| }, |
| { |
| "start": 209, |
| "end": 211, |
| "text": "J,", |
| "ref_id": null |
| }, |
| { |
| "start": 212, |
| "end": 214, |
| "text": "k,", |
| "ref_id": null |
| }, |
| { |
| "start": 215, |
| "end": 217, |
| "text": "n,", |
| "ref_id": null |
| }, |
| { |
| "start": 218, |
| "end": 220, |
| "text": "r,", |
| "ref_id": null |
| }, |
| { |
| "start": 221, |
| "end": 223, |
| "text": "s,", |
| "ref_id": null |
| }, |
| { |
| "start": 224, |
| "end": 226, |
| "text": "t,", |
| "ref_id": null |
| }, |
| { |
| "start": 227, |
| "end": 229, |
| "text": "w,", |
| "ref_id": null |
| }, |
| { |
| "start": 230, |
| "end": 232, |
| "text": "?,", |
| "ref_id": null |
| }, |
| { |
| "start": 233, |
| "end": 235, |
| "text": "a,", |
| "ref_id": null |
| }, |
| { |
| "start": 236, |
| "end": 237, |
| "text": "u", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "# ^ (#)(Fj ^ (Tr)t A 0r)(a A i)) ^ (p)(j ^ (x)i ^ 0r)t)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "It is possible to use formulas from L to describe ill-formed syllable structures. We shall rule these out by stating in L our empirical generalizations. We begin by specifying (i) the relationship between the sorts (i.e. the set X) using a sort lattice and (fi) how the sorts interact with dominance using an appropriateness relation. We then express in L the constraints graphically represented in the appropriateness graph in (2).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "(2) T", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "aLo~l~\u00b0ho~b k . t ? w a u i ..L", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "The arrows may be glossed as follows: (i) all syllables must dominate an onset more~ (ii) heavy syllables must dominate a coda mora and (iii) all moras must dominate a segmenL The fact that potential arrows are absent also encodes constraints. For example: (i) syllables, moras and segments alike cannot dominate syllables and (ii) light syllables do not have coda moras. Constraints concerning the number of nodes of sort p that a node of sort q can dominate, and constraints concerning temporal organization cannot be stated in this graphical style. Nevertheless, they can be expressed in L as follows. SSe\u00a2 (Bird 1990 ) for arguments justifying this view of syllable structure. Moras are traditionally employed in the representation of syllable weight: a syllable with two moras is heavy, and a syllable with one mora is light. In a heavy syllable, the onset cannot end with a consonant.", |
| "cite_spans": [ |
| { |
| "start": 610, |
| "end": 620, |
| "text": "(Bird 1990", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "We can express the constraint that two syllables cannot share a mora as follows.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "A THEORY OF PHONOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "Two syllables cannot share a mora.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(A3) L(i Acr A (p)j --~ -~M(\"~i A (#)j)).", |
| "sec_num": null |
| }, |
| { |
| "text": "An interesting alternative is to add an operator <>-1 that looks backwards along the dominance relationS.: The constraint that two syllables cannot share a mora could then be written L(# A ((r)-l~b ---, [cr]-l~b). There are further phonological phenomena which suggest that this may be an interesting extension of L to explore. For example, the requirement that all moras and segments must be linked to the hierarchical structure (prosodic licensing) may be expressed", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(A3) L(i Acr A (p)j --~ -~M(\"~i A (#)j)).", |
| "sec_num": null |
| }, |
| { |
| "text": "thus: L((# v 7r) ~ O-IT).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(A3) L(i Acr A (p)j --~ -~M(\"~i A (#)j)).", |
| "sec_num": null |
| }, |
| { |
| "text": "Partiality. Crucially for the analysis of Arabic, it is possible to have a formula which describes more than one diagram. Consider the formula M(a A (#, x)(tA Fi)) A M(trA (th ~r)(aA i)), which may be glossed 'there is a syllable which dominates a t, and a syllable which dominates an a, and the t is before the a'. :This formula describes the three diagrams in (3) equally well:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(A3) L(i Acr A (p)j --~ -~M(\"~i A (#)j)).", |
| "sec_num": null |
| }, |
| { |
| "text": "( If a level of hierarchical structure higher than the syllable was employed, then it would not be necessary to use the M operator and we could write: (tr, #, x).(t A Fi) A (a, #, 7r)(a A i).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(A3) L(i Acr A (p)j --~ -~M(\"~i A (#)j)).", |
| "sec_num": null |
| }, |
| { |
| "text": "In the Semitic languages,: individual morphemes are often not manifested as contigl!ous strings of segments. A morphologically complex form must be expressed as the \u2022 intercalation of its component morphemes. An example of this phenomena is illustrated in Figure 1 for the perfective active r. Consider the form kattab in the second row. Its particular arrangement of four consonants and two e That is, O-1 is to O as P is to F. 7 Note that these are uninflected forms. Some forms are actually non-existent (for semantic reasons); these are i~dicated by a dash. However, this is unimportant since the present interest is in phonological structure and in potential forms.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 256, |
| "end": 264, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "ARABIC VERB MORPHOLOGY", |
| "sec_num": null |
| }, |
| { |
| "text": "Verb The following \"generalizations can be made about Arabic syllable structutre.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "(A4) L(ac --* ~rh). Closed syllables are heavy.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "There is a maximum of one consonant per node.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "(A6) L((xv)~-. [xv]~).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "There is a maximum of one vowel per node.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "(AT) L0,~ ^ (~)~ -, [~]~).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "There is a maximum of one segment per coda. ((~, ,~v)q, -, b,, ,,-v] ,/,).", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 44, |
| "end": 68, |
| "text": "((~, ,~v)q, -, b,, ,,-v]", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Conj", |
| "sec_num": null |
| }, |
| { |
| "text": "There is a maximum of one vowel per syllable, SThe approadaes to Arabic phonology presented by Kay (1987) and Gibbon (1990) ---while addressing important computational issues--fail to represent the hierarchical organization of phonological structures. Onsets must have a consonant and a vowel, in that order.", |
| "cite_spans": [ |
| { |
| "start": 95, |
| "end": 105, |
| "text": "Kay (1987)", |
| "ref_id": "BIBREF16" |
| }, |
| { |
| "start": 110, |
| "end": 123, |
| "text": "Gibbon (1990)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(AS) ~", |
| "sec_num": null |
| }, |
| { |
| "text": "There are certain phonological phenomena which appear to move us beyond the bounds of L: the need to specify defaults. Phonologists often employ default consonants and vowels, which appear when the consonant or vowel positions in syllable structures have not been filled. In Arabic, the default consonant is ? (the glottal stop) and the default vowel is a. The default consonant only appears word initially. There are two ways we can treat such defaults. First, we can regard them as instructions on how one ought to 'compute' with L. That is, we regard them as instructions to attempt to build certain preferred models. Alternatively, we could combine L with a default logic.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(AS) ~", |
| "sec_num": null |
| }, |
| { |
| "text": "Consider the forms kattab and dahraJ. Both consist of two closed syllables. This observation is expressed below.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MORPHOLOGICAL COMBINATION", |
| "sec_num": null |
| }, |
| { |
| "text": "Similarly, the two consonantisms can be represented as follows. (Note that il, i2 and iz are introduced in the (KTB) lbrmula as labels of syllable nodes; these labels will be referred to in the subsequent discussion.) A is A (#, ~)(b A k3) ^ (~, ,0(r ^ ks ^ Fk,) ", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 218, |
| "end": 239, |
| "text": "A is A (#, ~)(b A k3)", |
| "ref_id": null |
| }, |
| { |
| "start": 240, |
| "end": 262, |
| "text": "^ (~, ,0(r ^ ks ^ Fk,)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "(KTB) M(a A i, A (~, r)(k A k, A Fk2)) A M(a A i: A (#, r)(t A k2 A Fka)) A i(~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": ") (DHRJ) M(aA(/~,Tr)(dAkl AFk2)) A M(a A (t~, 7r)(h. A k2 A Fks)) ^ M(~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": ") ^ U(~ ^ (#, ,~)(j ^ k,))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "To derive kattab, we simply form 0I) ^ (KTB). The final conjunct of (H) requires that there be only two syllables. Consequently, each syllable mentioned in (KTB) has to be identified with i or j. There are eight possibilities, which fall into three groups. In what follows, i ~ j is shorthand for L(i *--, j), i.e. L is rich enough to support a form of equational reasoning 9.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "(i) il ,~ i2 ~ is ~ i or il ~, i2 ,.~ is ~ j. This would require a syllable to dominate three distinct consonants. However, fxom (A1), (A2) and (A5), Arabic syllables contain a maximum of two consonants.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "(ii) i~,.~is~i,i2~j;i2~i3~i,i~j;i2~i, il i3 ,~ j; or is ~ i, il .~ i2 ,~ j. In all of these cases, we have the following reductio ad absurdum, for some k' E {kl, k2, ks}.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "M(~, ^ 0', ~\u00a2)k' ^ Fj) ^ M(,, ^ j ^ (#, ~aFk') M(Ok' A Fj) A M(j ^ OFk') (D1) M(Ok' A FOFk') (NOM) M(Ok' A Fk') (T5) M(Ok' ^ -',Ok')", |
| "eq_num": "(T4)" |
| } |
| ], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "! 9Other useful 'macros' are i -~ j, which expands to L(i --..+ Fj). and ; o j, which expands to L(i -40 j).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "(iii) il ~ i2 ~ i, i3 ~ j or ix ~ i, i2 ~ i3 ~ 3. It follows from the above default stipulations that two of the four consonants of (It) must be identical. By a similar process to that used in (ii) above, we can show that the coda consonant of i is identical to the onset consonant of j. The result is shown in (5a). AVe\\ A\\A\\", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "k ~v t gv b d ~ v h r n v J", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "The case of (II) A (DHRJ) is depicted in (5b). The four consonants of (DHRJ) satisfy the requirements of the second conjugation template (II) without the need for reentrancy.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "OTHER PHENOMENA", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(II) M(ac A i A Fj) A M(ac A j) A L(a --~ iV j)", |
| "sec_num": null |
| }, |
| { |
| "text": "In conjugations IX, XI, XII, XIV and QIV there is a non-geminate doubling of consonants. In the exceedingly rare XH, the second consonant (t) is doubled. In all the ;other cases, the final consonant is doubled.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "The most direct solution is to posit a lexical rule which fIecly applies to consonantisms, doubling their final consonant. For example, the rule would take the (KTB) form provided above and produce:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "(KTB') M((I~, ~r)AkAFkl))AM((#, 7r)AtAkl AFk2)) AM((#;rc) AbAk2AFk3))AM((#, rr) A bA k3))", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "It would be necessary to prevent this extended form from being used in conjugations 17 and V. since the patterns katbab and takatbab are unattested.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "The Reflexive Affix. Conjugations V, VI and VIII are marked by the.presence of a reflexive affix t. Rather than viewing these conjugations as basic (as Figure 1 implies) , we can treat them as having been derived from conjugations H, IN and I respectively. As this affix always appears as the onset of a light syllable, we shall represent it thus: M(ct I A (/z, a')t). This morpheme will actually be expressed lexically as a function from conjugations to conjugations which attaches a syllable of the above form to the existing phonological material of a conjugation. The affix must be ordered relative to the other syllables. A constraint encoding the observation that all conjugations end in a closed syllable would prevent the affix from being a suffix. The fact that the affix is a light syllable correctly rules out ktattab (V) and ktaatab (VI), leaving only the attested forms for (V) and (VI). A constraint which prevented the first two syllables of a conjugation both being light (cf. McCarthy 1981:387) , easily expressed in L, would rule out takatab (VIII) leaving only the attested form for (VIII).", |
| "cite_spans": [ |
| { |
| "start": 988, |
| "end": 1011, |
| "text": "(cf. McCarthy 1981:387)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 152, |
| "end": 169, |
| "text": "Figure 1 implies)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "Extrametricality. Above we specified conjugation H as having a closed final syllable. Looking back at Figure 1 , it would appear as if all conjugations end in a closed syllable. However, a study of the inflected forms reveals that this is not the case. For example, the third person plural of kattab is kattabu. From (Tll), the b must be syllabified with the vowel to its right. However, the first person plural is kattabna, and the b is syllabified with the vowel to its left. Similarly, the s of staktab is not part of the syllable tak. It is actually the coda of a previous syllable. In order to pronounce this form, ?i is prefixed, producing ?istaktab.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 102, |
| "end": 110, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "Therefore, the conjugations are not merely sequences of complete syllable templates, but rather they are sequences bounded by unsyllabified (or extrametrical) consonants. The definition of lI should therefore be modified to be Mac A M(~\u00a2 A (/~o)) A M(@ A (/~)) 10. This is intended to leave open the possibility for the final consonant to be syllabified with the second syllable or with the third syllable, while simultaneously requiring it to ultimately be syllabifled somewhere.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Doubling.", |
| "sec_num": null |
| }, |
| { |
| "text": "In this article we have presented an application of interval based tense logic to 'non-linear' phonology (specifically, 'autosegmental' phonology, Goldsmith 1990) , and exemplified it using data from Arabic (McCarthy 1981) . The chief difference between this view of phonology and its purely segmental predecessors is its use of overlapping intervals of time.", |
| "cite_spans": [ |
| { |
| "start": 105, |
| "end": 162, |
| "text": "(specifically, 'autosegmental' phonology, Goldsmith 1990)", |
| "ref_id": null |
| }, |
| { |
| "start": 207, |
| "end": 222, |
| "text": "(McCarthy 1981)", |
| "ref_id": "BIBREF17" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "CONCLUSION", |
| "sec_num": null |
| }, |
| { |
| "text": "As argued in (Bh'd 1990 ), the three primitives: dominance, precedence and overlap are sufficient to represent hierarchically and temporally organized phonological structure. Here we have taken a standard language of interval based tense logic, augmented it with an extra operator <> to express phonological dominance, and employed nominals to enable us to label nodes. A universal theory of syllable structure was expressed in L, to which further generalizations were added for Arabic. We then showed how so-called 'non-concatenative' morphology might be treated, and indicated how the phonological notions of extramela'icality and licensing were cashed out. The analysis of Arabic did not require recourse to separate consonant and vowel tiers (following Hudson 1986) . Rather, consonantisms (and vocalisms) are simply partially specified phonological structures which may be combined using logical conjunction. Even so, the exemplification given was for but a tiny fragment of Arabic phonology and much work is still to be done. For example, nothing was said about the vocalisms.", |
| "cite_spans": [ |
| { |
| "start": 757, |
| "end": 769, |
| "text": "Hudson 1986)", |
| "ref_id": "BIBREF15" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 13, |
| "end": 23, |
| "text": "(Bh'd 1990", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "CONCLUSION", |
| "sec_num": null |
| }, |
| { |
| "text": "The move from linear to non-linear phonology parallels the move from a purely Priorean tense logic in F and P to interval based systems in F, P and O. The view of phonology emerging from the present study is significantly more formal than many of its contemporaries (eL Bird & Ladd 1991) , and suggests that enhanced modal formalisms may provide a natural foundation for rigorous phonological theorizing.", |
| "cite_spans": [ |
| { |
| "start": 270, |
| "end": 287, |
| "text": "Bird & Ladd 1991)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "CONCLUSION", |
| "sec_num": null |
| }, |
| { |
| "text": "Finally, there would seem to be good reasons for being confident that complex phonological descriptions can now be fully incorporated into feature structure based grammar frameworks. Reape's (1991) logical foundation for these frameworks and the phonological arguments in favour of adopting feature structures (Hayes 1990 , Bird 1991 are but two parts of the one story.", |
| "cite_spans": [ |
| { |
| "start": 183, |
| "end": 197, |
| "text": "Reape's (1991)", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 310, |
| "end": 321, |
| "text": "(Hayes 1990", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 322, |
| "end": 333, |
| "text": ", Bird 1991", |
| "ref_id": "BIBREF3" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "CONCLUSION", |
| "sec_num": null |
| }, |
| { |
| "text": "10Note that the exhaustiveness condition L(a ~ i V j) and the sequencing constraints in the earlier version of (I1) must be expressed here also. They are omitted for the.sake of readability.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "CONCLUSION", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "On the relationship between word-grammar and phrase-grammar. Natural Language and Linguistic Theory", |
| "authors": [ |
| { |
| "first": "E", |
| "middle": [], |
| "last": "Bach", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "1", |
| "issue": "", |
| "pages": "65--89", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bach, E. (1983). On the relationship between word-grammar and phrase-grammar. Natural Language and Linguistic The- ory 1, 65--89.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The Logic of Time", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Van Benthem", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "van Benthem, J. (1983). The Logic of Time. Dordrecht: Reidel.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Constraint-Based Phonology. Ph.D. Thesis", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Bird", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bird, S. (1990). Constraint-Based Phonology. Ph.D. The- sis. Edinburgh University.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Feature structures and indices", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Bird", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "Phonology", |
| "volume": "8", |
| "issue": "1", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bird, S. (1991). Feature structures and indices. Phonology 8(1).", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Phonological Events", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "E" |
| ], |
| "last": "Bird", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Journal of Linguistics", |
| "volume": "26", |
| "issue": "", |
| "pages": "33--56", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bird, S. & E. Klein. (1990). Phonological Events. Journal of Linguistics 26, 33-56.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Presenting Autosegmental Phonology", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "D R" |
| ], |
| "last": "Bird", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ladd", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "Journal of Linguistics", |
| "volume": "27", |
| "issue": "1", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bird, S. & D. R. Ladd. (1991). Presenting Autosegmental Phonology. Journal of Linguistics 27(1).", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Nominal Tense Logic. Edinburgh University. CCS/RP-40", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Blackburn", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Proceedings of the Kleene '90 Conference", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Blackburn, P. (1989). Nominal Tense Logic. Edinburgh University. CCS/RP-40. To appear in P. Petkov (ed.) Pro- ceedings of the Kleene '90 Conference. Springer.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Nominal Tense Logic and other Sorted Intensional Frameworks", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Blackburn", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Blackburn, P. (1990). Nominal Tense Logic and other Sorted Intensional Frameworks. Ph.D. Thesis. Edinburgh Univer- sity.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Modal environment for Boolean speculations", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Gargov", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [ |
| "& T" |
| ], |
| "last": "Passy", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tinchev", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gargov, G., S. Passy & T. Tinchev. (1987). Modal en- vironment for Boolean speculations. In D. Skordev (ed.)", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Mathematical Logic and its Applications", |
| "authors": [], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Mathematical Logic and its Applications. Plenum Press.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Modal Logic with Names l. To appear", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [ |
| "V" |
| ], |
| "last": "Gurgov", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Goranko", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Bulgarian Academy of Sciences", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gurgov, G. & V. Goranko. (1989). Modal Logic with Names l. To appear. Bulgarian Academy of Sciences.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Prosodic association by template inheritance. International Workshop on Inheritance and Natural Language Processing", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Gibbon", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gibbon, D. (1990). Prosodic association by template inher- itance. International Workshop on Inheritance and Natural Language Processing. Tilburg.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Autosegmeraal and Metrical Phonology", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Goldsmith", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Goldsmith, J. (1990). Autosegmeraal and Metrical Phonol- ogy. Oxford: Blackwell.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Diphthongization and coindexing", |
| "authors": [ |
| { |
| "first": "B", |
| "middle": [], |
| "last": "Hayes", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Phonology", |
| "volume": "7", |
| "issue": "", |
| "pages": "31--71", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hayes, B. (1990). Diphthongization and coindexing. Phonol- ogy 7, 31-71.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Implications of process morphology for categorial grammar", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Hoeksema", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Janda", |
| "suffix": "" |
| } |
| ], |
| "year": 1988, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hoeksema, J. and R. Janda. (1988). Implications of process morphology for categorial grammar. In Oehrle et al.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Arabic root and pattern morphology without tiers", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Hudson", |
| "suffix": "" |
| } |
| ], |
| "year": 1986, |
| "venue": "Journal of Linguist&s", |
| "volume": "22", |
| "issue": "", |
| "pages": "85--122", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hudson, G. (1986). Arabic root and pattern morphology without tiers. Journal of Linguist&s 22, 85-122.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Nonconcatenative finite-state morphology", |
| "authors": [ |
| { |
| "first": "Martin", |
| "middle": [], |
| "last": "Kay", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "Proceedings of the 3rd EACL", |
| "volume": "", |
| "issue": "", |
| "pages": "2--10", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kay, Martin. (1987). Nonconcatenative finite-state mor- phology. Proceedings of the 3rd EACL. 2-10.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "A prosodic theory of nonconeatenafive morphology", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Mccarthy", |
| "suffix": "" |
| } |
| ], |
| "year": 1981, |
| "venue": "Linguistic Inquiry", |
| "volume": "12", |
| "issue": "", |
| "pages": "373--413", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "McCarthy, J. (1981). A prosodic theory of nonconeatena- five morphology. Linguistic Inquiry 12, 373---413.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "Categorial Grammars and Natural Language Structures", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Oehrle", |
| "suffix": "" |
| }, |
| { |
| "first": "E", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 1988, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Oehrle, R., E. Bach & D. Wheeler. (eds.) (1988). Catego- rial Grammars and Natural Language Structures. Reidel.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "A Formal Theory ofWord Order: A Case Study in Germanic", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Reape", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Reape, M. (1991). A Formal Theory ofWord Order: A Case Study in Germanic. Ph.D. Thesis. Edinburgh University.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "A logical version of functional grammar", |
| "authors": [ |
| { |
| "first": "W", |
| "middle": [ |
| "& A" |
| ], |
| "last": "Rounds", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Manaster-Ramer", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "Proceedings of the 25th Annual Meeting of the ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "89--96", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Rounds, W. & A. Manaster-Ramer. (1987). A logical ver- sion of functional grammar. Proceedings of the 25th Annual Meeting of the ACL. 89-96.", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "Consequences of some categorially motivated phonological assumptions", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Wheeler", |
| "suffix": "" |
| } |
| ], |
| "year": 1988, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Wheeler, D. (1988). Consequences of some categorially motivated phonological assumptions. In Oehrle et al.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "text": "iff qt' : tSt' and M ~,, \u00a2 M~, O~biffgt':tot' andM~,,~b M~, F\u00a2 iffSt' : t < t' and M ~,, 4~ M~,P~biffgt':t'<tandM~,,~b", |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF1": { |
| "uris": null, |
| "text": "AI) L((po)/p --~ [po]~b). Onsets are unique.", |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF2": { |
| "uris": null, |
| "text": "A2) L((#c)~ ~ [#club). Codas are unique. (\"177) L( (pc)qb ~ (#o)F~). Onsets precede codas. (T8) L(ao -~ (#, ~rv)/p A [#, rc]F~). An open syllable ends with a vowel. (T9) LCa --~ -,((p, 7rv)F~ A (~, lrc)(~ A F~b) A (#, ~rv)~b)). The vowels of a syllable must form an unbroken sequence. (T10) L(o\" h -.* \",(po)((~vv)F~ A (~c)~)).", |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF3": { |
| "uris": null, |
| "text": "o -\" (rc)F\u00a2 A (rv)~b).", |
| "num": null, |
| "type_str": "figure" |
| }, |
| "TABREF0": { |
| "text": "mirror image of this formula, obtained by replacing all Fs with Ps, is also valid.This schema expresses a familiar equivalence on feature matrices. For example:", |
| "num": null, |
| "type_str": "table", |
| "content": "<table><tr><td/><td>This</td></tr><tr><td colspan=\"2\">representation of sequences (cf. Rounds & Manaster-Ramer</td></tr><tr><td colspan=\"2\">1987) enables the expression of partial ordering constraints</td></tr><tr><td colspan=\"2\">which are widely required in phonological descriptions. Note</td></tr><tr><td colspan=\"2\">that all instances of the following variant of the NOM schema</td></tr><tr><td colspan=\"2\">are valid. E and E' are strings of modal operators from</td></tr><tr><td colspan=\"2\">{<>, F, P,O}.</td></tr><tr><td>(NOME)</td><td>Ei A E'(i ^ \u00a2) .--, E(i A \u00a2) A E'i.</td></tr><tr><td colspan=\"2\">Formulas may be transferred between different p~hs</td></tr><tr><td colspan=\"2\">to the same interval.</td></tr></table>", |
| "html": null |
| }, |
| "TABREF1": { |
| "text": ", I. The nine tr symbols are for the classification of syllables into heavy vs. light and open vs. closed and their various cross classifications. We have already been introduced to p, Po and pc, for moras, onsets and codas respectively. The remaining symbols are classifications of segments (x), firstly into vowels Orv) vs. consonants (xc), and then into the individual segments themselves (in boldface). This classification is depicted in (2) below.", |
| "num": null, |
| "type_str": "table", |
| "content": "<table><tr><td colspan=\"5\">Syllable Structure. Phonological representations for sta,</td></tr><tr><td colspan=\"4\">tat, taat and ast are given in (1) 5.</td><td/></tr><tr><td>(1)</td><td>a. o</td><td>b. o</td><td>c. o</td><td>d. o</td></tr><tr><td/><td>P-</td><td>g</td><td>lilt</td><td>I.tg</td></tr><tr><td/><td colspan=\"2\">/Ix, A sta tat</td><td>tat</td><td>Ik ast</td></tr></table>", |
| "html": null |
| } |
| } |
| } |
| } |
