File size: 49,193 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 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 | {
"paper_id": "C73-1007",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:28:12.757722Z"
},
"title": "JON-TIN WANG ON LOGICAL FORMULATION OF THE COMPUTATION PROCESS IN SEMANTICAL SYSTEMS",
"authors": [],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "C73-1007",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "In the recent years there is an intensive search for a rigorous and explicit semantics in the theory of natural languages (and in the field of computer languages). In this paper we want to present a general framework in which all these ideas and results can be stated and related in a unified and systematic way, and at the same time, by the using of the language of predicate logic, eventually of higher order, to reformulate and improve the different semantical systems: the system discussed by Scott and Strachey in their development of the theory of mathematical semantics for computer languages, the set-theoretic semantics for context-free fragments of natural languages proposed by Suppes and, finally, Lewis's iutensional semantics for a categorial grammar. In ~ 1, mainly by the example of context-free grammar, we show that the language of predicate logic of first-order can be used to describe the syntax of an object language. We obtain then in ~ 2 a logical characterization of structural descriptions associated with each reformulated syntactic rule. This leads to the development of the recursive mechanism in the form of definition of semantic functions by cases. This general principle will be then applied in ~ 3-5 to treat the concrete semantical systems mentioned above.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Let us begin with the study of the representation of a grammar as a first-order theory, namely as a theory formalized in the language of predicate logic of first-order. We consider especially the contextfree grammar, since it builds up on the one hand the basis for the development of the transformation grammar, on the other hand all the This work is supported by Deutsche Forschungsgemeinschaft.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GRAMMAR (SYNTAX) AND FIRST-ORDER THEORY",
"sec_num": "1."
},
{
"text": "semantical systems to be discussed below are referred essentially to context-free languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "In general, a context-free grammar consists of a set of rewriting rules each of which is of the form where A, Ai,, .... At,, stand for nonterminal symbols (category symbols) and a\u00a2,, ..., ain for terminal symbols and some of A i and at may be null. We can describe this form of context-free rule by the following logical formula (here and in the sequel we omit the universal quantifications) :",
"cite_spans": [
{
"start": 107,
"end": 124,
"text": "A, Ai,, .... At,,",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "( ,,, (x,,) = A (x'i'aFx~'aF...-x~'at,,) ,",
"cite_spans": [
{
"start": 2,
"end": 40,
"text": ",,, (x,,) = A (x'i'aFx~'aF...-x~'at,,)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "1:2) At, (xl)^ A,, (x=)^ ...^ A",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "where we take A, Ai,, ..., Ain as unary predicate symbols and at1, ..., at, as individual constants; the symbols \"^\" and \"~ \" are the conjunction and implication sign and the function symbol ..... stands for concatenation. The set of logical formulae thus obtained are called the nonlogical axioms of the first-order theory corresponding to the given context-free grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "\u2022 As an example, we consider the following context-free grammar given\u2022by P. SUVVES (1971) :",
"cite_spans": [
{
"start": 76,
"end": 89,
"text": "SUVVES (1971)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "S -~ NP VP VP -+ TV NP .'\" NP -* PN PN -*John TV-+ hit PN -* Mary",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "The nonterminal symbols are S, NP, VP, TV and PN; the terminal symbols are John, hit and Mary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "Corresponding to this set of context-free rules we can state the following nonlogical axioms:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "NP(x) ^ VPOt ) ~ S(x-y) TV(x) ^ NP(r) = vp(x-r) PN(x) = NP(x) PN(lohn) TV(hit) .. PN(Mary).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "It is obvious that a context-free grammar and its corresponding firstorder theory enumerate the same set of terminal strings. More precisely, for each K-derivation of a terminal string w in a given contextfree grammar in the sense of Chomsky, where K stands for any nonterminal symbol in this grammar, the formal sentence",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "flJN-TIN WANG",
"sec_num": null
},
{
"text": "is in the corresponding first-order theory logically derivable (J. T. WANe, 1973) .",
"cite_spans": [
{
"start": 70,
"end": 81,
"text": "WANe, 1973)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "With this result we can state even the principle to formulate each grammatical transformation, which according to Chomsky is a mapping of phrase-markers into phrase-markers, as a nonlogical axiom in the following way: we describe both the applied phrase-markers and the resulting phrase-markers, or parts of them, with formulae in the language of predicate logic of first-order which occur then respectively as premises and conclusion of an implication formula. This very implication formula can be. then taken as the representation of the grammatical transformation in question. As an example, for the passive transformation, which has been specified by Chomsky as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "structural description: NP, Aux, V~, NP structural change: x~-xa-xa-x4 ~ x4-x~-be-x3-en-by-xl",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "we might state then the following nonlogical axiom:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "S(xlx2x3x4) A NP(xl)^ Aux(x2)A Vt(xa)^ NP(x,) , D S(x~'x~'be-x~'en-by'~x~)^ Ve(x~'be-x~en-br-Xx ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "It seems evident, that the same principle stated above can be applied to the logical formulation of other grammatical transformations as well.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "K(w)",
"sec_num": null
},
{
"text": "The results obtained abo~ce indicate that, in general, syntactic rules can be described in the language of predicate logic of first-order in the form p~/X where P stands for a conjunction of formulae as premises and A for a conjunction of formulae as conclusion of the rule (nonlogical axiom) corresponding to the given syntactic rule. This suggests, however, that we may take the formula P^A as a characterization of the structural description of the strings generated by the reformulated syntactic rule in question. For example, we can take the formula '...-x~ai,,, which could be enumerated by the reformulated context-free rule, namely the logical formula (1.2) in \u00a7 1. The set of formulae of structural descriptions thus obtained, one for each reformulated syntactic rule, specify therefore exhaustly and disjoin@ the syntactic conditions, with respect to which the semantic evaluation function, which assigns a denotation or meaning to each generated terminal string, can be defined recursively. This is the kind of the definition of the (semantic) functions by cases in the usual mathematical sense. With this general characterization of our approach we are going now to treat the concrete semantical systems.",
"cite_spans": [
{
"start": 555,
"end": 567,
"text": "'...-x~ai,,,",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SYNTACTIC RULE AND STRUCTURAL DESCRIPTION",
"sec_num": "2."
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "A,,",
"eq_num": "(xl)"
}
],
"section": "SYNTACTIC RULE AND STRUCTURAL DESCRIPTION",
"sec_num": "2."
},
{
"text": "Our general idea of using the language of predicate logic, eventually. of higher order, to give a recursive definition of the semantical functions can be well illustrated by reformulating the simple semantical system for the language of numerals, whicl'/has been given by D. SCOTT and C. STI~AClIEY (1971) as an example in their development for a theory of mathematical semantics for computer languages. In the following, we give just our reformulation and do not repeat their specification of syntax and semantics for this simple language.",
"cite_spans": [
{
"start": 275,
"end": 305,
"text": "SCOTT and C. STI~AClIEY (1971)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "The numerals are expressions in a certain familiar language; while the numbers are mathematical objects (abstract objects) which provide the intended interpretations of the expressions. Based on the explicit syntax given by Scott and Strachey in the form of context-free grammar, we can describe this syntax for binary numerals by the following logical formulae:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "Numeral (~ Numeml (1) Numeml (~ Numeml (~ Numeral (x-0) Numeral (xA1), 91 f: Nml ~ N.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "Thus, for each x ~ Nml, the function value f(x) is the number denoted by the numeral x.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "Based on the idea of the semantical equations given by Scott and Strachey and using our general principles described in ~ 2, we can use the language of predicate logic to state the following semantic rules which define precisely this evaluation function:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "(3.1) (3.2) (3.3) (3.4) Numeral (0) ~ f(O) = O, Numeral (1) D f(1) = 1, Numeral (x),, Numeral (x-O) = f(x~O) = If(x), Numeral (x),, Numeral (xA1) = f(xA1) = 2f(x) + 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "This set of logical formulae forms a recursive definition of the semantic evaluation function f with the help of the auxiliary numbertheoretic functions of addition and multiplication. It is a definition of function by cases in the usual mathematical sense. Furthermore, this formulation corresponds to the intuitive idea in the linguistic theory, that on the basis of the grammatical properties and the meaning of the basic expressions of the languages the semantic rules enable one to determine the meaning of any well-formed expression in terms of its syntactic structure. In the terminology ofJ. J. KaTz, J. A. FODOR (1963) , (3.1) and (3.2) can be considered as the dictionary component, and (3.3) and (3.4) as the projection rules. However, it is essential to note, that is this kind of logical formulation of syntactic and semantic rules there is no need of any existence of phrase-marker for the semantical system where the symbol Numeral is a predicate symbol and the symbols \" 0\" and \" 1\" are individual constants. Thus, a numeral is either one of the digits \" 0 \" or \" 1 \" or is the result of suffixing one of these digits to a previously obtained numeral. Let the set of all numerals be called Nml. Semantically speaking each of the numerals is meant to denote a unique number. Let N be the set of numbers. The obvious principle of interpretation provides a function f, the evaluation mapping, which has the functional character:",
"cite_spans": [
{
"start": 615,
"end": 627,
"text": "FODOR (1963)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "to compute the denotation or meaning of the expressions. The structural description of a string generated by a syntactic rule is used just as the premises of the semantic rule corresponding to this very syntactic rule.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "In this way, we can treat the other complicated semantical systems for computer languages discussed by Scott and Strachey. However, with this simple illustration of our general approach to semantics, we like to continue our study of the semantics for natural languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICAL SYSTEM FOR THE LANGUAGE OF NUMERALS",
"sec_num": "3."
},
{
"text": "Within our general framework described in ~ 1-2 and illustrated in 3 we want now to treat the semantical system proposed by P. SUVVES (1973) . We indicate informally at first his approach and give then our reformulation and improvement of his system.",
"cite_spans": [
{
"start": 134,
"end": 140,
"text": "(1973)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "EXTENSIONAL SEMANTICS OF CONTEXT-FREE FRAGMENTS OF NATURAL LANGUAGES",
"sec_num": "4."
},
{
"text": "In his study of the semantics of context-free fragments of natural languages, Suppes intends to give a set-theoretical account of the meaning of a sentence. To do this, a set-theoretical object will be assigned to each basic expression (word). In the case of a noun like men the class of men will be assigned; in the case of a proper noun like John the class consisting of a certain single member will be assigned; in the case of a transitive verb like hit the class consisting of pairs of individuals x and y such that x hit y will be assigned. In this kihd of approach, we assume thus, that over the individual words an assignment function v be defined, which assigns a denotation to each word. (We leave aside the discussion about syncategorematic expressions). To give an account of meanings (or denotations) of the various parts of a sentence and their relationships, Suppes introduces set-theoretical functions, just like we have used number-theoretic functions in Using the assignment function v which assigns denotations to basic expressions only and using these semantic set-theoretical functions associated with each syntactic rule, the denotation of each labeled node of phrase-marker of the sentence will be then calculated. In Suppes's explicit formulation, the nodes of the phrase-marker will be numbered, so that the denotation function f is actually defined for pairs (n, s), where n is the number assigned to a node of the phrase-marker and s is a terminal or nonternfinal symbol. For example, a numbered phrase-marker looks like this ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EXTENSIONAL SEMANTICS OF CONTEXT-FREE FRAGMENTS OF NATURAL LANGUAGES",
"sec_num": "4."
},
{
"text": "and g\"B the range of the function g restricted to the domain B, and let T be truth and F falsity. Then the denotation of each labeled node of the phrase-marker is calculated by working from the bottom up: otherwise.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "f (10, Mary)-~ v(Mary), f (9, PN) = I(v(Mary)), f (8, hit) = v(hit), f (7, John) = v(John), f (6, NP) = I(v(Mary)), f (5, TV) -= I(v(hit)), f (4, PN) =-I(v(.John)), f(3, VP) f (2, NP)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "The calculation of the denotations of expressions will be thus indirectly achieved by the way of the calculation of the denotations of the nodes of the numbered phrase-marker. This unnecessary complication with the whole matter of numbered phrase-marker, which can be traced back to the specification of context-free grammar in form of rewriting rules, would not arise at all, if the context-free grammar had been formulated in the language of predicate logic since the very beginning of the development of theory of grammar by Chomsky. In fact, the process to compute the denotation of an expression can be specified by the following set of logical formulae directly and precisely: ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": ") = z, Adj(x) ^ N(y) ^ NP(x-y) -,. f(x-y) = gl (f(x), f(y)), TV(x) ^ NP(y) ^ VP(x-y) =. f(x-y) = g2(f(x), f(y)), NP(x) ^ VP(y) ^ S(x-y) =. f(x-y) = g3([(x), f(y)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "The functions gl, g2 and g3 being used to specify the denotation function f are defined as follows: By the set of the semantic rules which use these set-theoretic operations, the denotation of any well-formed expressions in this defined language can be then directly calculated. Thus, the denotation of the composed expression hit Mary is the set of individuals who hit Mary; the sentence John hit Mary is true if and only if the set consisting of the single individual John is properly contained in the set of individuals who hit Mary. This set of logical formulae forms with respect to the given assignment function v a recursive definition of the denotation functionf which assigns to each well-formed expression of the language a set-theoretical object. This function has namely the functional character:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "f: Expressions-+ Set-theoretical Objects.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "It is just what Suppes intends to have.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "Again, (4.1)-(4.3) can be considered as the dictionary component, and (4.4)-(4.7) as projection rules. The whole set of formulae constitutes a definition of function by cases. The premise of each rule states the syntactic condition, with respect to which the function value is then specified. At the same time, we do not need even the notion of phrase-marker which has played the central role in the concept formation in the theory of generative grammars.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "Note there is no general principle to guide us in choosing for each syntactic rule the corresponding semantic set-theoretical function. It may be even possible that no set-theoretical operation can be found for a given syntactic rule at all. It seems likely that in our usual understanding of natural languages we do not use any set-theoretical operation. Anyway, from the standpoint of theory of meaning, the semantics treated by Suppes is only the extensional part of the semantics of a language (A. CHURCH, 1951) . With these remarks in mind, let us now consider the intensional semantics discussed by Lewis in his theory of categorial grammar. corresponding to each derived category, where \"-t-\" stands for the concatenation.",
"cite_spans": [
{
"start": 498,
"end": 515,
"text": "(A. CHURCH, 1951)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "One of the main ideas behind the theory of categorial grammar is that the phrases of a derived category are phrases which combine phrases of basic or derived categories to form other phrases of certain category, which may be basic like the category of sentence or derived. Such phrases are called functors by H. B. CURRY (1961) . Every functor combines one or more phrases, called its arguments, to form a new phrase called its value. This syntactic property shall be reflected in stating the semantic projection rule. We note here that the contextfree rule of the form (5.1) can be described, as before, by the following logical formula as a direct translation:",
"cite_spans": [
{
"start": 315,
"end": 327,
"text": "CURRY (1961)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "(52.) clq ... c. (y),, c, (xl),, ...,, c, (xo) (y-x,-... x,,),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "where we take c/q ... q, cl ..... cn and c again as unary predicate symbols. The word order as specified in the context-free rule (5.1) is sometimes too odd; the phrase of a derived category takes always the left-most position in its combined phrase. To take into account the natural word order, we should actually describe it.by the following logical formula:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "(5.3) clcl ... c,~ (y)^q (xl)^ ...^ c,~ (Xln) :3 C (X~'...--X'~'y~xi+L~...--X,).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "With these remarks about the syntactic rules in a categorial grammar, we are prepared to treat Lewis's intensional semantics within our general framework.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "Let us denote the sets of phrases of name, common noun, adjeCtive, intransitive verb, article etc. by Names, Common-Nouns, Adjectives, Intransitive Verbs and Articles respectively. Let Things denote the set of things and Sets the set of sets of things. And let T denote the set of truth values, and let I denote the set of indices, each of which is, roughly speaking, a package of the various factors like possible world, time, place and speaker on which the extension of an expression may depend. As used before, given any two domains D1 and Da, we write [D~ ~ D~] for the set of all functions from D1 into D2. We write h: D1 ~ D2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "to indicate that h is just such a function.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "According to Lewis's theory, an appropriate intension for a name is any function from indices to things; an appropriate intension for a common noun is any function from indices to sets of things; an appropriate intension for an adjective is any function from commonnoun intensions to common-noun intensions, etc. In adapting this point of view, we shall consider in the sequel assignment functions, each of which assigns an appropriate meaning to a word of certain category, with the following functional charact.ers: is the assigned meaning of the word man, where this meaning itsel is a kind of function from indices to sets of things (individuals). In what follows, we assume that such assignment functions specifying an appropriate meaning for each word of certain category are already given or known to us, for example by learning or ostensive definition, In other words, we assume we know the meaning of each individual word. The problem is just how we can know the meaning of any well-formed expression in this language. We ask namely for a semantic evaluation function, which can compute the meaning of any wellformed expression on the basis of its syntactic structure and the meaning of its constituting words. This evaluation function f shall have namely the following functional character:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "f: Expressions -+ Meanings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "To define this function, .we begin with the specification of its value for the individual words or basic expressions, based on the given assignment functions. As before, we state thus the following semantic rules, here formulated in the language of predicate logic of higherorder due to the functional characters of the assignment functions: ~. f (y-x7x-f ...-x,) = g(f(y), f (x 0 ..... f(x,) ), based on the assumption, that the meaning of an expression depends on the meanings of its parts; it is a function of the meanings of its parts. This function g, which uses the meanings of these parts as arguments to compute the meaning of the composed phrase as its value, must be, first of all, specified. In general, as we have seen in the case of Suppes's system, there is no uniform principle to do it. In his semantic theory for categorial grammar, Lewis holds, however, the view that the result of concatenating a phrase of the category c/q ... c~ with intension i0, a phrase of the category c1 with intension/1, ..., and a phrase of the category q with intension i, is a phrase of the category e with intension ;0(il ..... i.).",
"cite_spans": [
{
"start": 347,
"end": 392,
"text": "(y-x7x-f ...-x,) = g(f(y), f (x 0 ..... f(x,)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "In accordance with this conception, we can state then, corresponding to each syntactic rule of the form (5.2), the following semantic projection rule:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "(5.9} c/c1 ... c,~ (y) ^ q (x~)^ c~ (xz} ^ ... ^ c, (x,)^ c (y-x~'xT...-x,) ~. f (y-x~'x~...-x~) In combination with the logical formulae (5.4)-(5.8), such rules enable one to derive logically the meaning of the sentence like John steeps, which can be represented as v, (sleefs) (vx (John) ). And this representation would correspond to the usual so-called logical form:",
"cite_spans": [
{
"start": 36,
"end": 75,
"text": "(xz} ^ ... ^ c, (x,)^ c (y-x~'xT...-x,)",
"ref_id": null
},
{
"start": 81,
"end": 96,
"text": "(y-x~'x~...-x~)",
"ref_id": null
},
{
"start": 270,
"end": 289,
"text": "(sleefs) (vx (John)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
},
{
"text": "SLEEP (j) . The set of projection rules thus obtained specifies in connection with those semantic rules like (5.4)-(5.8), which constitute the dictionary component, the evaluation function f recursively. This kind of formulation of semantic rules stands very near to our intuition, that on the basis of the syntactic structure and on the knowledge of the meanings of the constituting words we can understand the meaning of an expression. The semantic projection rule stated above has a nice homogeneous feature in specifying semantic evaluation function. This holds actually for all grammars using the notion of functor which combines one or more phrases as its arguments to form a new phrase. The meaning of the composed phrase can be then always considered as the result of the operation of the meaning of the functor with the meanings of its arguments. According to H. B. CURRY (1961) , what Harris and Chomsky call transformations are also functors. From this point of view, we can then state the semantic projection rule for a given transformation rule in the same way as described above.",
"cite_spans": [
{
"start": 6,
"end": 9,
"text": "(j)",
"ref_id": null
},
{
"start": 875,
"end": 887,
"text": "CURRY (1961)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": ".~ = { <x, y> I <y, x> ~A },",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "The need for abstract entities in semantic analysis",
"authors": [
{
"first": "A",
"middle": [],
"last": "Church",
"suffix": ""
}
],
"year": 1951,
"venue": "Proc. Amer. ~ Academy of arts and sci.~ LXXX",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. CHURCH, The need for abstract entities in semantic analysis, in ,Proc. Amer. ~ Academy of arts and sci.~ LXXX (1951).",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Some logical aspects of grammatical structure",
"authors": [
{
"first": "H",
"middle": [
"B"
],
"last": "Curry",
"suffix": ""
}
],
"year": 1961,
"venue": "Structure of language and its mathematical aspects",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. B. CURRY, Some logical aspects of gram- matical structure, in IL. J~.KoBsoN (ed.), Structure of language and its mathematical aspects, Providence, 1961.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The structure of a semantic theory",
"authors": [
{
"first": "J",
"middle": [
"J"
],
"last": "Katz",
"suffix": ""
},
{
"first": "J",
"middle": [
"A"
],
"last": "Fodor",
"suffix": ""
}
],
"year": 1963,
"venue": "",
"volume": "",
"issue": "",
"pages": "170--210",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J.J. KATZ, J. A. FODOR, The structure of a semantic theory, in ~ Language ~, XXXIX (1963), pp. 170-210.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "General semantic",
"authors": [
{
"first": "D",
"middle": [],
"last": "Lewis",
"suffix": ""
}
],
"year": 1970,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. LEwis, General semantic, in ~ Synthese ~, XXU (1970).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Toward a mathematical semantics for computer languages",
"authors": [
{
"first": "D",
"middle": [],
"last": "Scotx",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Strac~",
"suffix": ""
}
],
"year": 1971,
"venue": "Proc. of the syrup, on computers and automata",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. SCOTX, C. STRAC~, Toward a math- ematical semantics for computer languages, in Proc. of the syrup, on computers and automata, 1971.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Semantics of context-free flagments of natural languages",
"authors": [
{
"first": "P",
"middle": [],
"last": "Stn",
"suffix": ""
}
],
"year": 1973,
"venue": "Approaches to natural language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. Stn,l,r.s, Semantics of context-free flag- ments of natural languages, in K. J. J. HINTmKdi, et al. (eds.), Approaches to natural language, Dordrecht, 1973.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Zum rekursiven Mechanismus im semantischen System",
"authors": [
{
"first": "J",
"middle": [
"T"
],
"last": "W~a~g",
"suffix": ""
}
],
"year": 1973,
"venue": "Linguistische Perspektiven, Tiibingen",
"volume": "",
"issue": "",
"pages": "205--219",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. T. W~a~G, Zum rekursiven Mechanismus im semantischen System, in A. P. T~ CATE, P. JOlmENS (eds.), Linguistische Perspektiven, Tiibingen, 1973, pp. 205- 219.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "On tl~e representation of generative grammars as first.order theories",
"authors": [
{
"first": "T",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 1973,
"venue": "Logic, language and probability, Dordrecht",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "T. WANG, On tl~e representation of gen- erative grammars as first.order theories, in IL. J. BOGDAN, L NIINILUOTO (eds.), Logic, language and probability, Dor- drecht, 1973.",
"links": null
}
},
"ref_entries": {
"FIGREF1": {
"num": null,
"type_str": "figure",
"text": "the semantical system for the language of numerals. With each syntactic rule of the grammar there is associated a semantic set-theoretical function,",
"uris": null
},
"FIGREF2": {
"num": null,
"type_str": "figure",
"text": "NP), f(3, VP)) =IF if f(2, NP) of(3,VP)",
"uris": null
},
"FIGREF3": {
"num": null,
"type_str": "figure",
"text": ") = f(Varr) = v(Varr), PN(John) = f(John) = v(John), TV(hit) = f(hit) = v(hit), VN(x) ^ NP(x) =. NP(x) = f(x) = z +--+ PN(x) = f(x",
"uris": null
},
"FIGREF4": {
"num": null,
"type_str": "figure",
"text": ", /3)= F otherwise, or, formulated in the language of predicate logic: g~(A, 13)= C ~-.+ Ax(x e A^ x e B ,,.-.+ x e C), g,(A, B)~-C~-+Ax(Vy(<x, y) e A^y e B+-.+x e C),",
"uris": null
},
"FIGREF5": {
"num": null,
"type_str": "figure",
"text": "(1970) treats a categorial grammar in the sense of Ajdukiewicz as a context-flee grammar of the following sort.First, we have a finite number of basic categories like the categories of name (N), common noun (C) or sentence (S). Second, we have infinitely many derived categories like the categories of intransitiveverb (S/N), adjective (G/C) or article ((S/(S/N))/C). In general, whenever c, q, ..., c,, for n ~ 1, are any categories, either basic or derived, we have a derived category c/q ... c,. Third, we have context-free rule of the form (5.1) c~c/cx ... c.+q +... +c.",
"uris": null
},
"FIGREF6": {
"num": null,
"type_str": "figure",
"text": "vx : Names-+ [I ~ Things] v2: Common-Nouns ~ [!-+ Sets] vs: Adjectives-~ [[I-+ Sets]--> [I---> Sets]] v,: Intransitive Verbs-+ [[I-+ Things] ~ [I---~ T]] vs: Articles ~ [[I ~ Sets] ~ [[[I ~ Things] ~ [I ~ T]] ~ [I ~ 7\"]]] Thus, for man: E Common-Nouns, the function value (man)",
"uris": null
},
"FIGREF7": {
"num": null,
"type_str": "figure",
"text": ") ~ f (John) = v~ (John), C (man)=f (man)= v, (man), C/C (young) ~ f (young) = v~ (young), SIN (sleeps)~ f (sleeps)= v4 (sleeps), (S/(SIN))/C (the) ~ f (the) = v5 (the), where we take again the symbols N, C, C/C, S/N, (S/(S/N))/C etc. as unary predicate symbols. For the computation of the meaning of composed well-formed phrases, we shall state, corresponding to each syntactic rule, the semantic projection rule. For the syntactic rule of the form (5.2), the semantic projection rule will, in general, be of the form 4c~ ... c, (Y) ^ ~1 (x,)^ ... ^ ~, (x,) ^~ (y-xrx;...-x,)",
"uris": null
},
"FIGREF8": {
"num": null,
"type_str": "figure",
"text": "=f (y) (f(xl), ..., f(x~)), or, taking into account the proper word order: (5.~o) ~/q...~ (y)^q (xO,,...^~ (~,)^~(~7...-~'y-~,\u00f7,-...-x,) \u2022 f (~i'...~r~,+,~...~)--f (y) (f (~0, ..., f (~,)).Thus, we may have semantic projection rule likeSIN (3)^ N (x) =.f (x-y)=f (3) (f (x)).One of its instances is as follows:",
"uris": null
}
}
}
} |