File size: 34,230 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 | {
"paper_id": "P86-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:13:08.429243Z"
},
"title": "CATEGORIAL AND NON-CATEGORIAL LANGUAGES",
"authors": [
{
"first": "Joyce",
"middle": [],
"last": "Friedman",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Boston University",
"location": {
"addrLine": "111 Cummington Street Boston",
"postCode": "02215",
"region": "Massachusetts",
"country": "USA"
}
},
"email": ""
},
{
"first": "Ramarathnam",
"middle": [],
"last": "Venkatesan",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Boston University",
"location": {
"addrLine": "111 Cummington Street Boston",
"postCode": "02215",
"region": "Massachusetts",
"country": "USA"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We study the formal and linguistic properties of a class of parenthesis-free categorial grammars derived from those of Ades and Steedman by varying the set of reduction rules. We characterize the reduction rules capable of generating context-sensitive languages as those having a partial combination rule and a combination rule in the reverse direction. We show that any categorial language is a permutation of some context-free language, thus inheriting properties dependent on symbol counting only. We compare some of their properties with other contemporary formalisms.",
"pdf_parse": {
"paper_id": "P86-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "We study the formal and linguistic properties of a class of parenthesis-free categorial grammars derived from those of Ades and Steedman by varying the set of reduction rules. We characterize the reduction rules capable of generating context-sensitive languages as those having a partial combination rule and a combination rule in the reverse direction. We show that any categorial language is a permutation of some context-free language, thus inheriting properties dependent on symbol counting only. We compare some of their properties with other contemporary formalisms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Categorial grammars have recently been the topic of renewed interest, stemming in part from their use as the underlying formalism in Montague grammar. While the original categorial grammars were early shown to be equivalent to context-free grammars, 1, 2, 3 modifications to the formalism have led to systems both more and less powerful than context-free grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "Motivated by linguistic considerations, Ades and Steedman 4 introduced categorial grammars with some additional cancellation rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "Full cancellation rules correspond to application of functions to arguments. Their partial cancellation rules correspond to functional composition. The new backward combination rule is motivated by the need to treat preposed elements. They also modified the formalism by making category symbols parenthesis-free, treating them in general as governed by a convention of association to the left, but violating this convention in certain of the rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "This treatment of categorial grammar suggests a family of eategorial systems, differing in the set of cancellation rules that are allowed. Earlier, we began a study of the mathematical properties of that family of systems, s showing that some members are fully equivalent to context-free grammars, while others yield only a subset of the context-free languages, or a superset of them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "In this paper we continue with these investigations. We characterize the rule systems that can obtain context-sensitive languages, and compare the sets of categorial ]ar~guages with the context-free languages. Finally, we discuss the linguistic relevance of these results, and compare categorial grammars with TAG systems i, this regard.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "A categorial grammar under a set R of reduction rules is a quadruple CGR (VT, VA, S, F), whose elements are defined as follows: VT is a finite set of morphemes. VA is a finite set of atomic category symbols. S EVA is a distinguished element of VA. To define F, we must first define CA, the set of category symbols. CA is given by:i) ifAEVA,thenA ECA;ii) ifX EUA and A EVA, then X/A ECA; andiii) nothing elselsin CA . F is the lexicon, a function from VT to 2 ea such that for every aEVT, F(a) is finite. We often write CGR to denote a categorial grammar with rule set R, when the elements of the quadruple are known.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "Notation: Morphemes are denoted by a, b; morpheme strings by u,v,w.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "The symbols S,A,B,C denote atomic category symbols, and U. V, X, Y denote arbitrary (complex) category symbols. Complex category symbols whose left-most symbol is S (symbols \"headed\" by S) are denoted by Xs, Ys. Strings of category symbols are denoted by z, y.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "The language of a categorial grammar is determined in part by the set R of reduction rules. This set can include any subset of the following five rules. In each statement, A EVA, and U/A,A/U,A/V, VIA E CA. (1) (F Rule) The string of category symbols U/A A can be replaced by U. We write: U/A A---*U;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "(2) (FP Rule) The string U/A A/V can be replaced by U /V. Wewrite:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "U /A A/V-*U/V;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "(3) (B Rule) The string A V/A can be replaced by U. We write:A U/A~U;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "(4) (Bs Rule) Same as B rule, except that U is headed by S.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "(5) (BP Rule) The string A/U V/A can be replaced by V/U. We write:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "A/U V/A--*V/U.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "If XY ---,Z by the F-rule , XY is called an F-redex. Similarly, for the other four rules. Any one of them may simply be called a redex.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "The reduction relation determined by a subset of these rules is denoted by => and defined by: if X Y --* Z by one of the rules of R, then for any a, /~ in CA* , aXY/3 >aZ/3. The reflexive and transitive closure of the relation -> is =>*. A morpheme string w=wlu,~\" \"'w, is accepted by CGR(VT, VA,S,F) if there is a category string z = X1X2 \"\" \u2022 X, such that XiEF(w,) for each i=l,2,'--n, and x =>* S. The language L(CGR) accepted by CGR(VT, VA,S,F) is the set of all morpheme strings that are accepted.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTRODUCTION",
"sec_num": null
},
{
"text": "In this section we present a characterization theorem for the categorial systems that generate only context-free languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NON-CONTEXT-FREE CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "First, we introduce a lexicon FEQ that we will show has the property that for any choice R of metarules any string in L(CGR) has equal numbers of a,b, and c. We define the lexicon FEQ as FEQ (a ) = {A }, FEQ(b) = {BI, F~Q(c) ={C/A/C/B, C/D}, FEQ (d ) {D}, FEQ(e)={S/A/C/B}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NON-CONTEXT-FREE CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "We will also make use of two languages on the alphabet {a,b,e,d, For any rule system R, a redex is two adjacent categories, the tail of one matching the head of the other, and is reduced to a single category after cancelling the matching symbols. Since all occurrences of A must cancel to yield a reduction to S, #A = #A -1. This holds for all atomic categories except S, for which #S = #S-l+l. This lexicon has the property that any derivable category symbol, either has exactly one S and is S- =# (c). Thus x = a n db n ec\" , for some n. Hence L",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NON-CONTEXT-FREE CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "The next lemma shows that no language intermediate to L1 and LEQ can be context-free. It really does not involve eategorial grammar at all.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "= L (CGR). []",
"sec_num": "1"
},
{
"text": "Proof Suppose L is context-free. Since L contains L1, it has arbitrarily long strings of the form a '~ b db\"e c\". Let k and K be pumping lemma constants. Choose n >max(K,k). This string, if pumped, yields a string not in LEQ, hence we have a contradiction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "[] Corollary Let {FP ,Bs }~R. Then there is a noncontext-free language L ( CGR ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "Proof Use the lexicon FEQ. Then by lemma 1 L(CGR)~LEQ. But{FP,Bs}~R,soLI~L(CGR).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "[]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "The following theorem summarizes the results by characterizing the rule sets that can be used to generate context sensitive languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "Main Theorem A categorial system with rule set R can generate a context-sensitive language if and only if R contains a partial combination rule and a combination rule in the reverse direction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "Proof The \"if\" part follows for {FP,Bs }by lemmas 1, 2, and 3. It follows for {BP ,F } by symmetry. For the \"only if\" part, first note that any unidirectional system (system with rules that are all forward, or all backward) can generate only context-free languages. 5 The only remaining cases are {F ,B } and {FP ,BP 1. The first generates only context free languages. 5 The second generates only the empty language, since no atomic symbol can be derived using only these two rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lemma 3 If L 1C.L C-LEQ, then L is not context-free.",
"sec_num": null
},
{
"text": "Let VT = {a l, a2 \"-.,ak }. A Parikh mapping 6 v/is a mapping from morpheme strings to vectors such that x~(w) = (#al,#a2 ....",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "II. CATEGORIAL LANGUAGES ARE PERMUTA-TIONS OF CONTEXT-FREE LANGUAGES",
"sec_num": null
},
{
"text": "Let ~P(L~={W(w)IwEL}, A language L is a permutation of L iff ~(L ) = xC(L). We define a rotation as follows. In the parse tree for u E L, at any node corresponding to a B redex or BP-redex exchange its left and right subtrees, obtaining an F-redex or an FP-redex. Let v the resulting terminal string. We say that u has been transformed into v by rotation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "We now obtain results that are helpful in showing that certain languages eannol be generated by. categorial grammars. First we show that, every categorial language is a permutation of a context free language. This will enable us to show that properties of context-free languages that depend only on the symbol counts must also hold of categorial languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "Theorem Let R c: {F, FP, B, BP}. Then there exists a LCF such that \u00a2(L (CGR)) = \u00a2(LcF), where LcF is context free.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "Proof Let x eL (CGR). In its parse tree at each node corresponding to a B-redex or a BP-redex perform a rotation, so that it becomes a F -redex or a FP -redex. Semilinearity follows from Parikh's Lemma and linear growth from the pumping lemma for context-free languages. Parikh boundedness follows from the fact that any context-free language is Parikh bounded. 6 I-1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "Proposition Any one--symbol categorial grammar is regular.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "Note that if L is a semilinear subset of nonnegative integers, {a n In eL } is regular.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ". #a k). u is a permutation of v iff ~(u)=~(v).",
"sec_num": null
},
{
"text": "We now exhibit some non-categorial languages and compare eategorial languages with others. From the corollary of the previous section we have the following results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "III. NON-CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "Theorem Categorial languages are properly contained in the context-sensitive languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "III. NON-CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "Proof The languages {a h (n) [ n >/0 }, where h (n)=n 2 or h (n)=2\" which do not have linear growth rate, are not generated by any CGR. These are context sensitive. Also{arab\" I either m>n ,grin is prime and n ~<m and m is prime } is not semilinear 7 and hence not categorial.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "III. NON-CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "It is interesting to note that lexieal functional grammar can generate the first two languages mentioned above 8 and indexed languages can generate {a nbn2a ~' In>tl}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "III. NON-CATEGORIAL LANGUAGES",
"sec_num": null
},
{
"text": "We now look at some languages that exhibit crossserial dependencies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Properties",
"sec_num": null
},
{
"text": "Let G3 be the Now we can compare with Tree Adjoining Grammars (TAG). s A TAG without local constraints cannot generate L3. A TAG with local constraints can generate this, but it cannot generate L6 = {am b\" c m d\" ] m,n >-1}. L4(2) can be transformed into L6 by the homomorphism erasing ca,d and e. TAG languages are closed under homomorphisms and thus the categorial language L4(2) is not a TAG language. TAG languages exhibit only limited cross serial dependencies. Thus, though TAG Languages and CG languages share some properties like linear growth, semilinearity, generation of all context-free languages, limited context sensitive power, and Parikh boundedness, they are different in their generative capacities.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Properties",
"sec_num": null
},
{
"text": "CGR",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Properties",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Weiguo Wang and Dawei Dai for helpful discussions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "On syntactical categories",
"authors": [
{
"first": "Yehoshua",
"middle": [],
"last": "Bar-Hillel",
"suffix": ""
}
],
"year": 1950,
"venue": "Journal of Symbolic Logic",
"volume": "15",
"issue": "",
"pages": "19--37",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yehoshua Bar-Hillel, \"On syntactical categories,\" Journal of Symbolic Logic, vol. 15 , pp. 1-16 , 1950. Reprinted in Bar-Hillel (1964), pp. 19-37.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Yehoshua Bar-Hillel, Language and Information",
"authors": [],
"year": 1964,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yehoshua Bar-Hillel, Language and Information, Addison-Wesley, Reading, Mass., 1964.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "On the order of words",
"authors": [
{
"first": "Anthony",
"middle": [
"E"
],
"last": "Ades",
"suffix": ""
},
{
"first": "Mark",
"middle": [
"J"
],
"last": "Steedman",
"suffix": ""
}
],
"year": 1982,
"venue": "Linguistics and Philosophy",
"volume": "4",
"issue": "",
"pages": "517--558",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anthony E. Ades and Mark J. Steedman, \"On the order of words,\" Linguistics and Philosophy, vol. 4, pp. 517-558, 1982.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Weak Generative Capacity of Parenthesis-free Categorial Grammars",
"authors": [
{
"first": "Joyce",
"middle": [],
"last": "Friedman",
"suffix": ""
},
{
"first": "Dawei",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Weiguo",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joyce Friedman, Dawei Dai, and Weiguo Wang, \"Weak Generative Capacity of Parenthesis-free Categorial Grammars,\" Technical Report #86-1, Dept. of Computer Science, Boston University, 1986.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Parikh-Bounded Languages",
"authors": [
{
"first": "Meera",
"middle": [],
"last": "Blattner",
"suffix": ""
},
{
"first": "Michel",
"middle": [],
"last": "Latteux",
"suffix": ""
}
],
"year": 1981,
"venue": "Automata, Languages and Programming",
"volume": "115",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meera Blattner and Michel Latteux, \"Parikh- Bounded Languages,\" in Automata, Languages and Programming, LNCS 115, ed. Shimon Even and Oded Kariv, Springer-Verlag, 1981.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Elements of the Theory of Computation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Harry",
"suffix": ""
},
{
"first": "Christos",
"middle": [
"H"
],
"last": "Lewis",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Papadimitriou",
"suffix": ""
}
],
"year": 1981,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harry R. Lewis and Christos H. Papadimitriou, Ele- ments of the Theory of Computation, Prentice- Hall, 1981.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Factoring reeursion and dependencies: an aspect of tree adjoining grammars and a comparison of some formal properties of TAGs, GPSGs, PLGs and LFGs",
"authors": [
{
"first": "K",
"middle": [],
"last": "Aravind",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 1983,
"venue": "21st Ann. Meeting of the Assn. for Comp. Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aravind K. Joshi, \"Factoring reeursion and depen- dencies: an aspect of tree adjoining grammars and a comparison of some formal properties of TAGs, GPSGs, PLGs and LFGs,\" 21st Ann. Meeting of the Assn. for Comp. Linguistics, 1983.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "e} Ll={a\"db \"e c ~ In >/1 },and LEQ = {w ! #a = #b = #c >1 1,#d =#e = 1}. A lemma shows that with any set R of rules the lexicon FEQ yields a subset of LEQ. Lemma 1 Let G be -any categorial grammar, CGR(VT,VA,S,FEQ), where VT ={a,b,c,d,e}, VA = {S,A,B,C,D}, with R~{F,FP,B,BP}. Then L (C)CL~Q. Proof Let z = X IX 2...X~ = > *S. Let w = wl...w. be a corresponding morpheme string. To differentiate between the occurrence of a symbol as a head and otherwise, write C/A/C/B = CA -1C-1B-1' S /A /C /B = SA-1C-1B -1 and C /D = CD -1."
},
"FIGREF1": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "headed or does not have an occurrence of S. Hence in x, #S = 1, i.e., w has exactly one e. Let the number of occurrences in x of C/A/C/B and C/D be p and q respectively. ]t follows that #C = p +q, #C -1 = p +1. Hence q = 1 and w ha.~ exactly one d. Each occurrence of C/A/C/B introduces oneA-landB-1. Sincew has one e, #A-1 = #B-J = p +1. Hence #A = #B = p +1. Since for each A ,B and C in z there must be exactly onea,b and c,#a =#b =#c. [] We show next that in the restricted ease where R contains only the two rules FP and B s , the language L 1 is obtained. Lemma 2 Let CG R be the categorial grammar with lexicon FEQ and rule set R = {FP ,Bs }. Then L (CGR ) = L1. Proof Any x EL 1 has a unique parse of the form (Bs FP ) n Bs Bs ~, and hence L 1CL (CG R ). Conversely, any x having a parse must have exactly one e. Further, all b's and c's can appear only on the left and right of e respectively. Any derivable category having an A has the form S/(A/)\" U where U does not have any A. Thus all A's appear consecutively on the left of the e. For the rightmost e,F(c) = C/D. A d must be in between a's and b's. By lemma 1, #(a)=#(b)"
},
"FIGREF2": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Since the transformed string y is obtained by rearranging the parse tree, xt,(x)= ~(y ). Also y derivable using R I = {FP ,F } only. Hence the set of such y obtained as a permutation of some x is the same as L (CGRt), which is context free, 5 i.e., L ( CGR I) = LCF . [] Corollary For any R ~ {F, FP, B, BP}, L (CGR) is semilinear , Parikh bounded and has the linear growth property."
},
"FIGREF3": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "with R ={FP,Bs}, VT = {a ,b ,c ,d }, and with the lexicon FFI~I =IS~S1}'= {S lIB/S 1, F( c) ={S1}' B }. F(a)=lS1/a/sl, m}, Then L3 = L (G3) = {wcdw tw E{a,b}*}. The reasoning is similar to that of lemma 1. First #c = #d = 1, from #S = 1. Since we have Bs rule, c occurs on the left of d and all occurrences of a and b on the left of c get assigned A and B respectively. Similarly all a and b on the right of c, get assigned to the complex category as defined by F. It follows that all symbols to the right of d get combined by FP rule and those on the left by Bs rule. Hence a symbol occurring n symbols to the right of d must be matched by an occurrence n symbols to the right of the left-most symbol. For any k, let G4(k) be the CGR with R = {FP ,Bs } again, VT = {al ,hi ] 1 <~ i ~k } U {ci I1 ~<i <k} O {d,e}, and the lexicon F(b,) ={s,/ai/s,}, F(al) =[A,},l<~ i <~k, F(e,) ={S,/S,+I},I <i < k, F(d) ={Sk}, F (e) = {S/S a}. Then L (G,(k)) = lal\"~a2 \"2 ---a~\"kdebl\"'cx ' ek-~ bk\"kJ for any k. Note that #A i = #Ai -a. This implies #b i = #a i . The rest of the argument parallels that for L3 above . Thus {FP, Bs } has the power to express unbounded cross-serial dependencies."
}
}
}
} |