File size: 54,542 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 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 | {
"paper_id": "C80-1002",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:05:59.454718Z"
},
"title": "AUTOMATIC PROCESSING OF WRITTEN FRENCH LANGUAGE",
"authors": [
{
"first": "J",
"middle": [
"L"
],
"last": "Binot",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Liege",
"location": {
"country": "Belgium"
}
},
"email": ""
},
{
"first": "M",
"middle": [],
"last": "Graitson",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Liege",
"location": {
"country": "Belgium"
}
},
"email": ""
},
{
"first": "D",
"middle": [],
"last": "Lemaire",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Liege",
"location": {
"country": "Belgium"
}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Ribbens",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Liege",
"location": {
"country": "Belgium"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "An automatic processor of written French language is described. This processor uses syntactic and semantic informations about words in order to construct a semantic net representing the meaning of the sentences. The structure of the network and the principles of the parser are explained. An application to the processing of the medical records is then discussed.",
"pdf_parse": {
"paper_id": "C80-1002",
"_pdf_hash": "",
"abstract": [
{
"text": "An automatic processor of written French language is described. This processor uses syntactic and semantic informations about words in order to construct a semantic net representing the meaning of the sentences. The structure of the network and the principles of the parser are explained. An application to the processing of the medical records is then discussed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": ", Backward Approach\") is an automatic parser of French language currently developped at Liege University, Belgium I. It is now aimed at the processing of medical records 2. However, the principles of this system were conceived independently of any specific application. SABA has been fundamentally conceived as a general, flexible French language parser, which could be used as a component of a natural language interface between a human user and a given computer process 8. This parser is not limited to the processing of correct, academic French. It is aimed also at processing the casual language of an average user.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SABA (\"Semantic Analyser",
"sec_num": null
},
{
"text": "Though our system is uniquely concerned with French, we have translated our examples in English everytime that it was possible. In this way, we hope that the non French-speaking reader might be able to get the flavour of our work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SABA (\"Semantic Analyser",
"sec_num": null
},
{
"text": "SABA, as a parsing system, is essentially semantically oriented, Its goal is not to identify the complete syntactic structure of the input sentences, but rather to determine the possible semantic relationships between the terms of these sentences. More specifically, the system tries to characterize the semantic dependencies that appear in a sentence between the complements and the terms which are completed by them (from now on, a term of this last kind will be called a \"completee\"). We will insist immediately upon the fact that both concepts of\"complement\" and of \"completee\" are to be taken in a general way. The syntactic subject of a verb is thus treated as a complement of this verb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "General description of the s~stem",
"sec_num": "2."
},
{
"text": "To characterize these semantic dependen-cies, the system uses a small set of relationships like AGENT, OBJECT, INSTRU-MENT, LOCUS, and so on. In this way, our system is related to the family of \"case systems\", using the now well known principles of case grammars 3 14 However, in contrast to some authors 3 15 17 18 , we don~t try to find a complete and minimal set of universal relationships. The only criterion for the choice of our relationships is their practical usefulness. For the time being, about twenty different relationships are used by the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "General description of the s~stem",
"sec_num": "2."
},
{
"text": "All the relationships which are identified in an input sentence are summarized in a semantic network, which represents the semantic structure of this sentence. The (simplified) representation of a complete sentence may be illustrated by the figure I. The fundamental principles of the network will be described in the next section.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "General description of the s~stem",
"sec_num": "2."
},
{
"text": "The grammar used by the system has two components, syntactic and semantic, which are used interactively. The syntactic component has two main tasks. First, it segments the sentence into syntactic units. Second, it defines an order of processing for all these units. This syntactic component, which is implemented in a procedural way, will be described in section 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "General description of the s~stem",
"sec_num": "2."
},
{
"text": "The semantic component defines which semantic relationships are acceptable between terms. As we shall see later, its scope is not only the relationships between verbs and nominal groups, but also the dependencies between nouns, between nouns and adjectives, and, in fact, all possible dependencies expressible in the French language. The semantic component will be described in section 4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "General description of the s~stem",
"sec_num": "2."
},
{
"text": "Since a few years, semantic nets are well known as tools for expressing knowledge and meaning 13 16 17 . Let us recall briefly the principle of such networks: a semantic net is a set of nodes, which may represent the different significant terms of a text or of a domain of knowledge. These nodes are interconnected by labelled arcs, which represent the semantic relationships established between them.",
"cite_spans": [
{
"start": 94,
"end": 102,
"text": "13 16 17",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "A complete semantic network, which must be able to express a great variety of semantic informations, is generally a very complex structure 7 9 17 The structure that we use may be somewhat simpler, because it is aimed only at the representation of sentences, and not of general knowledge (at least at this state of our work). However it is still fairly complex, as it can be seen in figure I. Figure I. Representation of : \"John has found today the books that he was searching for since two months.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "We will not try here to discuss all the subtleties of our net structure. Rather, we will restrict ourselves to the statement of a few basic principles. All these principles can be explained with the help of the very simple example of the figure 2. First of all, in our terminology, verbs are not treated as predicates, (the arguments of which being the different nouns of the sentence), but rather as arguments themselves. We have abandoned the dominant point of view that the verbs express mainly relationships, while the others terms express objects or properties. Instead, we admit that a sentence is composed of content words, which we call \"semantic entities\", related by semantic relationships. The semantic entities include not only the nouns, but also the verbs, adjectives, adverbs, and some prepositions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "Secondly, the semantic relationships are oriented (the positive orientation being denoted in the network by an arrow). By definition, the positive orientation is such that :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "the origin of the arc is the node corresponding to the term which appears in the sentence as the complement, and -the extremity of the arc is the node corresponding to the term which appears in the sentence as the completee.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "Third, a logical interpretation corresponds to the semantic net. We will admit that to the graphic configuration R 0< .........",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A semantic net",
"sec_num": "3."
},
{
"text": "x y corresponds the logical proposition :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022",
"sec_num": null
},
{
"text": "R(x,y) = True",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022",
"sec_num": null
},
{
"text": "We will remark that the relation R is not symmetrical with respect to its arguments : the first argument corresponds to the destination node of the network representation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u2022",
"sec_num": null
},
{
"text": "The task of the semantic component of the grammar is to define which semantic relationships are acceptable between the semantic entities. In order to do that, we shall use semantic knowledge about words. To each content word are assigned two different \"property lists\": an \"E-list\" and a \"T-list\" E-lists.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "The E-list which is associated with one term lists all the relationships where this term may appear as a \"completee\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "As an alternate definition, we may say that an E-list lists all possible kinds of complements for the associated term. For example, the E-list of the verb \"to eat\"would be something like that :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "(eat(E-list(AGENT OBJECT INSTRUMENT LOCUS TIME) ) )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "E-lists appear to be very similar to the traditional case frames used by the case grammar theory. There exists however a distinction : case frames were meaned to indicate possible ARGUMENTS for verbs, considered as predicates. E-lists are used to indicate possible RELATIONSHIPS for the associated terms, which are considered as arguments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "The E-list associated to a term is a characteristic of this term itself, and cannot be deduced from the context. It must be given by a dictionary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A_semantic grammar",
"sec_num": "4."
},
{
"text": "The T-list which is associated to a term lis~ the possible relationships where this term may appear as a complement. We may also understand a T-list as the list of the possible kinds of \"completee\" of a term. In contrast to the E-list, the T-list of a term is, at least partially, bound by the context of this term in a sentence. The T-list of a noun, for example, is provided by the preposition which begins the nominal group. Each preposition introduces thus a given, fixed T-list. And, to preserve the generality of this rule, the lack of preposition is assimilated to the presence of an \"empty\" preposition, called PHI.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "For example, the T-list introduced by the French preposition \"par\" is something like this : The occurrence of the same relationship in the T-list associated to X is equivalent to :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "(~y) AGENT (y ,X)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "Consequently, the only difference between T-lists and E-lists lies in the orientation given to the relationships described by them. b) For any relationship, such as AGENT, we may define the \"inverse relationship\" AGENT -I, such that :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "AGENT(x,y) ~ AGENT-i(y,x)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "Given these inverse relationships, we have the following property of E-lists and T-lists :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "\"The occurrence of a given relationship in the E-list associated with a term X is equivalent to the occurrence of the inverse relationship in the T-list associated to the same term, and reciprocally\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "This property is used in some complex situations where a term which appears in the input sentence as a complement must be represented in the network as a completee. This is the case, for example, of past and present participles used as adjectives.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "c) The same relationship may not occur twice in a given list of properties (E-list or T-list). Concerning E-lists, this restriction may be translated as : \"two different terms cannot play in the same sentence the same role with respect to a given term\", which is a typical restriction in some case systems 3 is. d) Only one of the relationships listed in the T-list of a term may be used in a given sentence. This means that each term in a sentence has a single role to play. This condition is not true for Elists : all the relationships given by the E-list of a term may be used in a sentence where this term occurs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "The properties c) and d) are called the two \"exclusivity principles\" of the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "T-lists.",
"sec_num": null
},
{
"text": "We will now show how we will use these property lists in our system. First we will state a compatibility condition : \"given two terms, one of which is a possible complement of the second, a necessary condition to establish a given relationship between them is that this relationship be present both in the E-list of the possible completee and in the Tlist of the possible complement\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Compatibility condition and selectional restrictions",
"sec_num": null
},
{
"text": "Let us admit that we want to establish the AGENT relationship between \"eating\" and \"Peter\" in \"Peter eats\". We must of course know that Other kinds of restrictions are based on syntactic classes or on modal properties (of verbs). We shall not discuss them further here.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "This condition is a necessary but not a sufficient one. The reason of this can be shown in the following example",
"sec_num": null
},
{
"text": "The grammar, and thus the parser, are not completely free of syntactic considerations. The syntactic part of the parser has two main tasks :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The parser",
"sec_num": "5."
},
{
"text": "the segmentation of the input text into \"syntactic units\" -the determination of a parsing strategy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The parser",
"sec_num": "5."
},
{
"text": "Four kinds of syntactic units are defined : words, groups, clauses and sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "-Words, or atomic symbols are strings of characters which match dictionary entries (this definition takes into account not only single words, but also locutions, as \"at least\", that will be treated by the system as atomic symbols). To each Word are associated syntactic and semantic properties. Words are divided into two main classes :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "\u2022 the semantic entities, or content words, which can be arguments of semantic relationships : nouns, pronouns, verbs, adverbs, adjectives, and some prepositions. \u2022 the function words, which cannot be arguments of semantic relationships : coordinate and subordinate conjunctions, articles, some prepositions, negation words, and so on.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "-Groups are sequences of Words. Each Group has a central term, which may be a noun (nominal Groups), a pronoun, an adjective or an adverb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "-A Clause consists of one and only one verb, and of a set of Groups. A Clause has also a central term, which is its verb.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "-A Sentence is a sequence of Words delimited by a \"terminator\" (punctuation mark like a period, a question-mark,...) A Sentence contains a set of Clauses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "The parsing strategy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "The parsing strategy is fundamentally a bottom-up strategy, which may be defined recursively as follows :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "For each syntactic unit (except Words), execute the following steps : -the segmentation of this unit into its own internal syntactic units, -the parsing of these internal units according to a definite order, -the determination of the semantic relationships between the internal units, -the substitution of the given unit, at the next higher level, by a special symbol, which represents the analyzed unit.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "The semantic relationships are determined according to the semantic grammar defined above. We want now to insist on the two other crucial points of this algorithm : the segmentation of a given unit, and the order for parsing the internal units.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "The segmentation procedures has two tasks : breaking down sentences into clauses, and clauses into groups.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "The segmentation of sentences into clauses is based on the following technics : starting at a verb, and moving one word at a time to the left AND to the right until a delimiter is recognized. For groups, the same technics applies, except that a group is never extended to the right of its main term. Lists of clause-delimiters and of group-delimiters are known by the system. Coordinate conjunctions, which can or cannot be delimiters depending on the context, do receive a special treatment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "An important point concerning the segmentation of the sentence into clauses must be stressed. It is performed each time that a clause must be selected to be analyzed by the system. This strategy gives to the system the possibility to use informations collected in a prior state of the analysis. In this way, the structure of very complex sentences can be successfully analyzed. analysis of the relative clause \"auxquels vous vous attachez\", which is replaced by the special symbol PR e) the state of the sentence after the analysis of the relative clause \"qui vous rendent de l'affection\", which is replaced by PR f) final state of the sentence : the main clause was found and replaced by PP concerning the order for parsing the internal units at a given level, two strategies are applied, one for clauses, and one for groups. For clauses, we simply follow the bottom-up strategy, with the following rule : all subordinate clauses (relative, conjunctive, infinitive,...) are processed before the clauses on which they depend. If two clauses are on the same level, a left to right priority is applied.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "For groups, a backward strategy is applied : the system always starts from the end of the clause, and moves towards the beginning. At each step, the internal structure of a group is parsed, AND THEN THE POSSIBLE RELATIONSHIPS BET-WEEN THIS GROUP AND THE FOLLOWING GROUPS (ALREADY PARSED) ARE INVESTIGATED. This particular order (after which the system is named) has a crucial importance. It is based on two facts : the first is related to the structure of the language. In French, complements are nearly always at the right of the terms on which they depend;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "the second is related to the system : we know that the T-lists of the semantic entities are, at least partially, deduced from the context. Consequently, at the moment when the system investigates the potential relationships between a term and some possible complement, the group in which this complement appears must have already been parsed !",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic units.",
"sec_num": null
},
{
"text": "We have presented a parsing system for French language sentences. This system is characterized by -its generality, -a good amount of flexibility, due to the fact that the system is semantically oriented, -its capability to cope with complex structures, including subordinate clauses, conjunctions and references (these last two features were not discussed in the paper).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6."
},
{
"text": "The system was designed independently of any specific application and was tested on a limited corpus (approximatively one hundred) of common french sentences. We believe that this system is applicable in all domains, provided a structured semantic dictionary. An application of our system to the medical domain is currently under development 2 6. In this domain, existing automatic processing systems do function successfully for E~glish and French pathology data 4 5 I0 12. We took up the challenge to design a system for processing patient discharge summaries in internal medicine.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6."
},
{
"text": "It is quite true that the natural language of internal medicine data does not always contain well formed sentences. This is not however a real problem. One of the main advantages of the system stems from the fact that it was designed to handle French free text, no matter how academically correct or incorrect it might be. Consequently, we expect that the system can handle all kinds of medical diagnoses. Moreover, since it has been conceived to process questions as well as complete sentences, the system is not limited to the processing of medical data. Ultimately, it will be used to implement a complete natural language interface for a data base management system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6."
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Description d'un syst~me automatique d'analyse du frangais. Rapport interne",
"authors": [
{
"first": "I",
"middle": [],
"last": "Binot",
"suffix": ""
},
{
"first": "J",
"middle": [
"L"
],
"last": "Lemaire",
"suffix": ""
},
{
"first": "Ph",
"middle": [],
"last": "Ribbens",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "I. Binot,J.L.,Lemaire,Ph., & Ribbens,D., Description d'un syst~me automatique d'analyse du frangais. Rapport interne, Universit@ de Liege, 1979.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Analyse automatique de textes m~dicaux et codification des diagnostics. Rapport interne",
"authors": [
{
"first": "J",
"middle": [
"L"
],
"last": "Binot",
"suffix": ""
},
{
"first": "Ph",
"middle": [],
"last": "Lemaire",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Ribbens",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Binot,J.L., Lemaire,Ph., & Ribbens,D. Analyse automatique de textes m~dicaux et codification des diagnostics. Rap- port interne, Universit6 de Liege, 1980.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "The case for case",
"authors": [
{
"first": "C",
"middle": [
"J"
],
"last": "Fillmore",
"suffix": ""
}
],
"year": 1968,
"venue": "Universals in Linguistic Theory",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fillmore,C.J., The case for case, in Bach,E. & Harms,R. (Eds.), Univer- sals in Linguistic Theory, Holt, Rinehart & Winston,lnc., N.Y., 1968.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Identification et transformation automatique des morphemes terminaux dans le lexique m&dical frangais",
"authors": [
{
"first": "M",
"middle": [],
"last": "Graitson",
"suffix": ""
}
],
"year": 1975,
"venue": "Cahiers de Lexicologie",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graitson,M., Identification et trans- formation automatique des morphemes terminaux dans le lexique m&dical frangais, Cahiers de Lexicologie, XXVI, 1975.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Traitement automatique du frangais m~dical",
"authors": [
{
"first": "M",
"middle": [],
"last": "Graitson",
"suffix": ""
}
],
"year": 1977,
"venue": "Cahiers de Lexicologie",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graitson,M., Traitement automatique du frangais m~dical, Cahiers de Lexi- cologie, XXX, 1977.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Syst~me d'indexation automatique des dossiers m~dicaux de l",
"authors": [
{
"first": "M",
"middle": [],
"last": "Graitson",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graitson,M., Syst~me d'indexation automatique des dossiers m~dicaux de l'Universit~ de Liege, Rapport interne, Universit~ de Liege, 1980.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Associative Networks -The representation and use of knowledge in computers",
"authors": [
{
"first": "G",
"middle": [],
"last": "Hendrix",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hendrix,G., Encoding knowledge in partitioned networks, in N.V.Findler (Ed.),Associative Networks -The re- presentation and use of knowledge in computers, Academic Press, New-York.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Natural language interface engineering",
"authors": [
{
"first": "J",
"middle": [
"H"
],
"last": "Laubsch",
"suffix": ""
}
],
"year": null,
"venue": "S~minaire international sur les syst~mes intelligents de questions-r~ponses et de grandes banques de donn6es",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Laubsch,J.H., Natural language inter- face engineering, S~minaire interna- tional sur les syst~mes intelligents de questions-r~ponses et de grandes banques de donn6es, Rapport de I'IRIA.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Roles, co-descriptors, and the representation of quantified English expressions",
"authors": [
{
"first": "W",
"middle": [
"A"
],
"last": "Martin",
"suffix": ""
}
],
"year": 1979,
"venue": "Laboratory for Computer Sciences",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martin,W.A., Roles, co-descriptors, and the representation of quantified English expressions, Laboratory for Computer Sciences, M.I.T. Press,1979.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Automatic processing of pathologic data",
"authors": [
{
"first": "A",
"middle": [
"W"
],
"last": "Pratt",
"suffix": ""
}
],
"year": 1969,
"venue": "International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pratt,A.W., Automatic processing of pathologic data, International Confe- rence on Computational Linguistics, Stockholm, 1969.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Progress towards a medical information system for the research environment",
"authors": [
{
"first": "A",
"middle": [
"W"
],
"last": "Pratt",
"suffix": ""
}
],
"year": 1972,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pratt,A.W., Progress towards a medi- cal information system for the re- search environment, in Fuchs,G. & Wagner,G. (Eds), Krankenhaus-Infor- mationssysteme : Erstrebtes und er- reichtes, F.K.Schattauer Verlag, Stuttgart, 1972.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Automatic indexing of pathology data",
"authors": [
{
"first": "G",
"middle": [
"S"
],
"last": "Dunham",
"suffix": ""
},
{
"first": "H",
"middle": [
"G"
],
"last": "Pacak",
"suffix": ""
},
{
"first": "A",
"middle": [
"W"
],
"last": "Pratt",
"suffix": ""
}
],
"year": 1978,
"venue": "Journal of the American Society for Information Sciences",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dunham,G.S.,Pacak,H.G.,& Pratt,A.W., Automatic indexing of pathology data, Journal of the American Society for Information Sciences, March 1978.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Semantic memory, in Minsky",
"authors": [
{
"first": "M",
"middle": [
"R"
],
"last": "Quillian",
"suffix": ""
}
],
"year": 1968,
"venue": "Semantic Information Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Quillian,M.R., Semantic memory, in Minsky (Ed.), Semantic Information Processing, M.I.T. Press,Cambridge, Mass., 1968.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Case grammar",
"authors": [
{
"first": "W",
"middle": [],
"last": "Samlowsky",
"suffix": ""
}
],
"year": 1976,
"venue": "Computational Semantics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Samlowsky,W., Case grammar, in Charniak,E., & Wilks,Y. (Eds), Compu- tational Semantics, North-Holland, 1976.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Identification of conceptualizations underlying natural language",
"authors": [
{
"first": "R",
"middle": [],
"last": "Schank",
"suffix": ""
}
],
"year": 1973,
"venue": "Com-puterModels of Thought and Language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Schank,R., Identification of concep- tualizations underlying natural lan- guage, in Schank & Colby (Eds), Com- puterModels of Thought and Language, Freeman, San-Francisco, 1973.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Semantic nets as memory models",
"authors": [
{
"first": "G",
"middle": [],
"last": "Scragg",
"suffix": ""
}
],
"year": 1976,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Scragg,G., Semantic nets as memory models, in Charniak,E., & Wilks,Y. (Eds}, Computational Semantics, North- Holland, 1976.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Semantic networks : computation and use for understanding English sentences",
"authors": [
{
"first": "R",
"middle": [
"F"
],
"last": "Simmons",
"suffix": ""
},
{
"first": "",
"middle": [
"C"
],
"last": "; R",
"suffix": ""
},
{
"first": "K",
"middle": [
"M"
],
"last": "Colby",
"suffix": ""
}
],
"year": 1973,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Simmons,R.F., Semantic networks : computation and use for understanding English sentences, in Schank,R.C. & Colby,K.M., Computer Models of Thought and Language, Freeman and Company, 1973.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Preference semantics",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Wilks",
"suffix": ""
}
],
"year": 1975,
"venue": "Formal Semantics of Natural Language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wilks,Y., Preference semantics, in Keenan,E. (Ed.), Formal Semantics of Natural Language, Cambridge U.P., 1975.",
"links": null
}
},
"ref_entries": {
"FIGREF1": {
"text": "Representation of : \"Pete 7 eats\".",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF2": {
"text": "(par(T-iist(AGENT,PATH,ORIGIN,DESTINA-ZION,QUANTITY))) Of course, we do not consider that the lists given as examples are complete. They are only an illustration of the real configuration of the system. Some properties of T-lists and E-lists. a) From a logical point of view, the occurrence of a relationship, say AGENT, in the E-list associated with a given term X is equivalent to the following proposition :(~y) AGENT (X ,y)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF3": {
"text": "Ny)AGENT(EATING,y) and (~x)AGENT (x ,PETER),i.e, that the act of eating takes an AGENT, and that Peter may be the AGENT of some activity. But, in order to be allowed to state AGENT (EAT ING, PETER), we must also know whether the two assignmentsx=EATING y=PETER are correct. These assignments will be submitted to a set of restrictions. These restrictions are associated with the property lists of the terms. Restrictions concerning the complements of a term are associated with the E-list of this term. Restrictions concerning the completee of a term are associated with its T-list.The system uses different kinds of restrictions, in order to solve different kinds of ambiguities. The main one, which concerns nouns (and adjectives), uses a classification of these terms into a hierarchized set of semantic classes. With the help of this classification, we can for example express that \"the AGENT of the action of eating must be an Animate being\", which is denoted II in the E-list of \"eating\" as :(eating(E-list(AGENT(Animate),...))) Here is a more complete example. T-iist(AGENT,OBJECT,INSTRUMENT,.))) (WITH(T-list(INSTRUMENT,...))) (EATING(E-iist(AGENT(Animate),OBJECT (Comestible),INSrRUMENT(Instrument)))) the system can easily parse the sentence \"Peter eats an apple with a knife\" and produce the three relationships AGENT(eating,Peter) OBJECT(eating,apple) INSTRUMENT(eating,knive)",
"type_str": "figure",
"num": null,
"uris": null
},
"FIGREF4": {
"text": "All segmentation procedures are already implemented and function satisfyingly. An example of segmentation of a French sentence is shown in the figure 3. The sentence appears as a list of words, delimited on the left and on the right by the special symbol SB (Sentence Boundary). A syntactic category is assigned to each word. The results shown in the figure are a simplification of the output of the system.a) Les chiens auxquels vous vous attachez et qui vous rendent de l'affection deviennent d'inestimables compagnons. b) The dogs that you love and who love you in return become precious comrades c) ((SB) (LES ART) (CHIENS NOM) (AUXQUELS PR-REL) (VOUS PR-PERS NIL(OD OI PR S)) (VOUS PR-PERS NIL(OD OI S))(ATTACHEZ VERBE IND)(ET CC)(QUI PR-REL)(VOUS PR-PERS NIL(OD OI PR S))(RENDENT VERBE IND)(DE PREP)( L ART)(AFFECTION NOM) (DEVIENNENT VERBE IND)(D ART)(INESTI-MABLES ADJ)(COMPAGNONS NOM)(SB)) d) ((SB) (LES ART) (CHIENS NOM) (PR) (ET CC) (QUI PR-REL)(VOUS PR-PERS NIL(OD OI PR S))(RENDENT VERBE IND)(DE PREP)( L ART) (AFFECTION NOM)(DEVIENNENT VERBE IN) (D ART) (INESTIMABLES ADJ) (COMPAGNONS NOM)(SB)) e) ((SB) (LES ART) (CHIENS NOM) (PR) (ET CC) (P.R)(DEVIENNENT VERBE IND)(D PREP) (INESTIMABLES ADJ) (COMPAGNONS NOM) (SB)) f) ((SB) (PP) (SB)) Figure 3 : segmentation of a sentence a) the original French sentence b) the English translation c) the input of the segmentation procedure d) the state of the sentence after the",
"type_str": "figure",
"num": null,
"uris": null
}
}
}
} |