File size: 49,051 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 |
{
"paper_id": "1994",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T02:06:18.794055Z"
},
"title": "A Parameter-Based Message-Passing Parser for MT of Korean and English",
"authors": [
{
"first": "Bonnie",
"middle": [],
"last": "Dorr",
"suffix": "",
"affiliation": {},
"email": "bonnie@cs.umd.edu"
},
{
"first": "Jye-Hoon",
"middle": [],
"last": "Lee",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Manitoba University of Maryland University of Maryland Winnipeg",
"location": {
"postCode": "R3T 2N2, 20724, 20742",
"settlement": "College Park, College Park",
"region": "MB, MD, MD",
"country": "Canada"
}
},
"email": "jlee@cs.umd.edu"
},
{
"first": "Sungki",
"middle": [],
"last": "Suh",
"suffix": "",
"affiliation": {},
"email": "sksuh@wam.umd.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The parsing component of previous principle-based machine translation systems are inefficient since they tend to adopt a generate-and-test paradigm. We combine the benefits of a message-passing paradigm with the benefits of a parametric approach in the implementation of a parser that avoids overgeneration and is easily ported to multiple languages. The algorithm has been implemented in C++ and successfully tested on well-known, translationally divergent sentences in a MT system called PRINCITRAN.",
"pdf_parse": {
"paper_id": "1994",
"_pdf_hash": "",
"abstract": [
{
"text": "The parsing component of previous principle-based machine translation systems are inefficient since they tend to adopt a generate-and-test paradigm. We combine the benefits of a message-passing paradigm with the benefits of a parametric approach in the implementation of a parser that avoids overgeneration and is easily ported to multiple languages. The algorithm has been implemented in C++ and successfully tested on well-known, translationally divergent sentences in a MT system called PRINCITRAN.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "This paper presents an efficient, implemented approach to cross-linguistic parsing for interlingual MT. Our design is based on Government-Binding (GB) Theory (Chomsky, 1981; Haegeman, 1991; van Riemsdijk and Williams, 1986) . One of the drawbacks to alternative GBbased parsing approaches is that they generally adopt a filter-based paradigm, generating all possible candidate structures of the sentence that satisfy Xbar theory, and then subsequently applying filters to eliminate those structures that violate GB principles. (See, for example, Abney (1989) , Correa (1991) , Dorr (1991) , Fong (1991) , and Frank 1990 .) The current approach provides an alternative to filter-based designs which avoids these difficulties by applying principles to descriptions of structures without actually building the structures themselves. In effect, structure building is deferred until the descriptions satisfy all principles.",
"cite_spans": [
{
"start": 158,
"end": 173,
"text": "(Chomsky, 1981;",
"ref_id": "BIBREF2"
},
{
"start": 174,
"end": 189,
"text": "Haegeman, 1991;",
"ref_id": "BIBREF11"
},
{
"start": 190,
"end": 223,
"text": "van Riemsdijk and Williams, 1986)",
"ref_id": "BIBREF16"
},
{
"start": 546,
"end": 558,
"text": "Abney (1989)",
"ref_id": "BIBREF0"
},
{
"start": 561,
"end": 574,
"text": "Correa (1991)",
"ref_id": "BIBREF3"
},
{
"start": 577,
"end": 588,
"text": "Dorr (1991)",
"ref_id": "BIBREF5"
},
{
"start": 591,
"end": 602,
"text": "Fong (1991)",
"ref_id": "BIBREF9"
},
{
"start": 605,
"end": 619,
"text": "and Frank 1990",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "We combine the benefits of the message-passing paradigm with the benefits of the parameterized approach to build a more efficient, but easily extensible system, called PRINCITRAN. 1 Our work extends that of Lin and Goebel (1993) and Lin (1993) in that it provides a parameterization mechanism along the lines of Dorr (1993b) that allows the system to be ported to languages other than English. We focus particularly on the problem of processing head-final languages such as Korean. The algorithm has been implemented in C++ and successfully tested on well-known, translationally divergent sentences.",
"cite_spans": [
{
"start": 180,
"end": 181,
"text": "1",
"ref_id": "BIBREF0"
},
{
"start": 207,
"end": 228,
"text": "Lin and Goebel (1993)",
"ref_id": "BIBREF12"
},
{
"start": 233,
"end": 243,
"text": "Lin (1993)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The next section presents a general framework for parsing by message passing. Section 3 presents our parameterization framework for handling cross-linguistic variation. Section 4 describes our technique for automatic precompilation of parameter settings on a per-language basis. The results of parsing translationally divergent sentences in Korean and English are presented in section 5. We conclude with a discussion about the implications of this approach and its applicability to the problem of multi-language MT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Our GB parser is an extension of the message-passing approach proposed by Lin (1993) and Lin and Goebel (1993) , which uses a network to encode the grammar. The nodes in the grammar network represent grammatical categories (e.g., NP, Nbar, N) or subcategories, such as V:NP (i.e., a transitive verb that takes an NP as complement). Figure l .a depicts a portion of the grammar network for English.",
"cite_spans": [
{
"start": 74,
"end": 84,
"text": "Lin (1993)",
"ref_id": "BIBREF13"
},
{
"start": 89,
"end": 110,
"text": "Lin and Goebel (1993)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 332,
"end": 340,
"text": "Figure l",
"ref_id": null
}
],
"eq_spans": [],
"section": "Message Passing Paradigm",
"sec_num": "2."
},
{
"text": "There are two types of links in the network: subsumption links (e.g., V to V:NP) and dominance links (e.g., Nbar to N). A dominance link from a to \u03b2 is associated with an integer id that determines the linear order between \u03b2 and other categories dominated by a, and a binary attribute to specify whether \u03b2 is optional or obligatory. 2 Input sentences are parsed by passing messages in the grammar network. The nodes in the network are computing agents that communicate with each other by sending messages in the reverse direction of the links. Each node locally stores a set of items. An item is a triplet that represents a Xbar structure a: <surface-string, attribute-values, source-messages>, where surface-string is an integer interval [i,j] denoting the i'th to j'th word in the input sentence; attribute-values specifies syntactic features of the root node (\u03b2); and sourcemessages is a set of messages that represent immediate constituents of \u03b2 and from which this item is combined. Each node has a completion predicate that determines whether an item at the node is \"complete,\" in which case the item is sent as a message to other nodes.",
"cite_spans": [
{
"start": 333,
"end": 334,
"text": "2",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Message Passing Paradigm",
"sec_num": "2."
},
{
"text": "When a node receives an item, it attempts to combine the item with items from other nodes to form new items. Two items: <[i 1 , j 1 ], A 1 , S 1 > and <[i 2 , j 2 ], A 2 , S 2 > can be combined if 1. their surface strings are adjacent to each other: i 2 = j 1 +1. 2. their attribute values A 1 and A 2 are unifiable. 3. the source messages come via different links: links(S 1 ) \u2229 links(S 2 ) = 0, where links(S) is a function that, given a set of messages, returns the set of links via which the messages arrived.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Message Passing Paradigm",
"sec_num": "2."
},
{
"text": "The result of the combination is a new item: ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Message Passing Paradigm",
"sec_num": "2."
},
{
"text": "<[i 1 ,j 2 ]> unify(A 1 , A 2 ), S 1 U S 2 >.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Message Passing Paradigm",
"sec_num": "2."
},
{
"text": "The structure of the grammar network in section 2 is too language-specific to be applicable to languages other than English. The most obvious flaw with this network is that each dominance link is associated with an integer id that determines the linear order of phrasal constituents. In this particular network, all phrasal heads precede their complements. However, in a head-final language such as Korean, the reverse order is required. In order to capture this distinction, we incorporate the parameterization approach of Dorr (1993b) into the message-passing framework so that the grammar network can be automatically precompiled on a per-language basis. The reason the message-passing paradigm is so well-suited to a parameterized model of language parsing is that, unlike head-driven models of parsing, the main message-passing operation is capable of combining two nodes (in any order) in the grammar network. The result is that a head-final language such as Korean is as efficiently parsed as a head-initial language such as English. What is most interesting about this approach is that model is consistent with experimental results (see, for example, Suh (1993)) which suggest that constituent structure is computed prior to the appearance of the head in Korean.",
"cite_spans": [
{
"start": 524,
"end": 536,
"text": "Dorr (1993b)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization for Cross-Linguistic Variation",
"sec_num": "3."
},
{
"text": "The remainder of this section describes our approach to parameterization of certain subtheories of Government-Binding (GB) Theory; we conclude with a summary of the syntactic parameter settings for English and Korean.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization for Cross-Linguistic Variation",
"sec_num": "3."
},
{
"text": "Xbar theory assumes that a constituent order parameter is used for specifying phrasal ordering on a per-language basis:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Xbar Theory",
"sec_num": "3.1."
},
{
"text": "(1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Xbar Theory",
"sec_num": "3.1."
},
{
"text": "Constituent Order: The relative order between the head and its complement can vary, depending on whether the language in question is (i) head-initial or (ii) head-final.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Xbar Theory",
"sec_num": "3.1."
},
{
"text": "The structure above represents the relative order observed in Korean, i.e., the head-final parameter setting (ii). In English, the setting of this parameter is (i). This ordering information is encoded in the grammar network by virtue of the relative ordering of integer id's associated with network links. Other types of parameters encoded in the grammar network are those pertaining to basic categories, pre-terminal categories (e.g., determiner), potential specifiers, and adjuncts for each basic category.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Xbar Theory",
"sec_num": "3.1."
},
{
"text": "In general, NP and CP nodes are considered to be barriers to movement. However, Korean allows the head noun of a relative clause to be construed with the empty category across more than one intervening CP node, as shown in the following:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "(2) [CP [CP t 1 t 2 kyengyengha-ten] hoysa 2 -ka manghayperi-n] Bill 1 -un yocum uykisochimhay issta managed-Rel company-Norn is bankrupt-Rel -Top these days is depressed 'Bill is such a person that the company which was managed by him has been bankrupt, and he is depressed these days'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "The subject NP 'Bill' is coindexed with the trace in the more deeply embedded relative clause. If we assume, following Chomsky (1986a) , that relative clause formation involves movement from an inner clause into an outer subject position, then the grammaticality of the above example suggests that the Trace theory must be parameterized so that crossing more than one barrier is allowed in Korean. Our formulation of this parametric distinction is as follows:",
"cite_spans": [
{
"start": 119,
"end": 134,
"text": "Chomsky (1986a)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "(3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "Barriers: (i) only one crossing permitted; (ii) more than one crossing permitted.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "In English the setting would be (i); in Korean the setting would be (ii).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Trace Theory",
"sec_num": "3.2."
},
{
"text": "In general, it is assumed that the relation between a case assigner and a case assignee is biunique. However, this assumption rules out so-called multiple subject constructions which are commonly used in Korean:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Case Theory",
"sec_num": "3.3."
},
{
"text": "(4) John-i phal-i pwureciessta -Nom arm-Nom was broken 'John is in the situation that his arm has been broken'",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Case Theory",
"sec_num": "3.3."
},
{
"text": "The grammaticality of the above example suggests that Nominative Case in Korean must be assigned by something other than tensed Infl. Thus, we parameterize Case Assignment as follows: (5) Case Assignment: Accusative case is assigned by transitive V; Nominative case is assigned by (i) tensed Infl; (ii) IP predication.",
"cite_spans": [
{
"start": 184,
"end": 187,
"text": "(5)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Case Theory",
"sec_num": "3.3."
},
{
"text": "In a biunique case-assignment language such as English, the setting for Nominative case assignment would be (i); in Korean, the setting would be (i) and (ii).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Case Theory",
"sec_num": "3.3."
},
{
"text": "We have just seen that certain types of syntactic parameterization may be captured in the grammar network (e.g., Xbar parameters such as constituent order). In addition to these, there are syntactic parameters that must be programmed into the message-passing mechanism itself, not just into the grammar network. Figure 2 shows the syntactic parameter settings for English and Korean. The English settings are drawn from Dorr (1993b) . The same paradigm was followed in our analysis of Korean parameters. The remainder of this paper will focus on how we automatically precompile the English and Korean parameter settings concerning Xbar theory into the grammar network (i.e., Basic Categories, Pre-tenninals, Constituent Order, Specifiers, and Adjunction).",
"cite_spans": [
{
"start": 420,
"end": 432,
"text": "Dorr (1993b)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [
{
"start": 312,
"end": 320,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Summary of Parameter Settings for English and Korean",
"sec_num": "3.4."
},
{
"text": "Our algorithm for automatic precompilation of the parameter settings into a grammar network consists of dynamic generation of code that is read as data by the message-passing parsing system. The following steps are used to construct the code: 1. Use defcategory to define:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Compilation Algorithm",
"sec_num": "4."
},
{
"text": "\u2022 X0 nodes (using Basic Categories and Constituent Order parameters) \u2022 Barl and Bar2 nodes (projecting from X0 nodes) \u2022 Pre-terminal nodes (using Pre-terminals parameter) 2. Use defeature to define:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Compilation Algorithm",
"sec_num": "4."
},
{
"text": "\u2022 Specifier links (using Specifiers parameter) \u2022 Adjunct links (using Adjunction parameter) Figure l .b shows the network that is generated as a result of executing this algorithm using the Korean Xbar parameter settings. A portion of the code that is automatically generated for this network is given in Appendix A.",
"cite_spans": [],
"ref_spans": [
{
"start": 92,
"end": 100,
"text": "Figure l",
"ref_id": null
}
],
"eq_spans": [],
"section": "Parameter Compilation Algorithm",
"sec_num": "4."
},
{
"text": "We are currently incorporating the parameterized parser into an interlingual MT system called PRINCITRAN. The current framework is well-suited to an interlingual design since the linking rules between the syntactic representations given above and the underlying lexical-semantic representation are well-defined (see Dorr (1993a) ). We adopt the Lexical Conceptual Structure (LCS) of Dorr's work and use a parameter-setting approach to account for the divergences presented in the last section. (Dorr (1993b) describes a parametric approach to mapping between the interlingua and the syntactic structure.)",
"cite_spans": [
{
"start": 316,
"end": 328,
"text": "Dorr (1993a)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implications",
"sec_num": "6."
},
{
"text": "A preliminary investigation has indicated that the message-passing paradigm is useful for generation as well as parsing, thus providing a suitable framework for bidirectional translation. The algorithm for generation is similar to that of parsing in that both construct a syntactic parse tree over an unstructured or partially structured set of lexical items. The difference is characterized as follows: in parsing, the inputs are sequences of words and the output is a structure produced by combining two adjacent trees into a single tree at each processing step; 4 in generation, the inputs are a set of unordered words with dependency relationships derived from the interlingua (LCS). The generation algorithm must produce structures that satisfy the same set of principles and constraints as the parsing algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implications",
"sec_num": "6."
},
{
"text": "Three areas of future work are relevant to the current framework: (1) scaling up the Korean dictionary, which currently has only a handful of entries for testing purposes; 5 (2) the installation of a Kimmo-based processor for handling Korean morphology; 6 and (3) the incorporation of nonstructural parameterization (i.e., parameters not pertaining to X theory such as Barriers and Case Assignment).",
"cite_spans": [
{
"start": 172,
"end": 173,
"text": "5",
"ref_id": "BIBREF4"
},
{
"start": 254,
"end": 255,
"text": "6",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implications",
"sec_num": "6."
},
{
"text": "Summarizing, we have shown that the parametric message-passing design is an efficient and portable approach to parsing. We have automated the process of grammar-network construction, and have demonstrated that the system handles well-known, translationally divergent sentences. We expect that the current framework is suitable for bidirectional, interlingual MT since the messagepassing paradigm may be used for generation as well as parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implications",
"sec_num": "6."
},
{
"text": "The name PRINCITRAN is derived from the names of two systems, UN1TRAN (Dorr (1993a)) and PRINCIPAR(Lin (1993)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For the purpose of readability, we have omitted integer id's in the graphical representation of the grammar network; link ordering is indicated instead by the starting points of links, e.g., C precedes IP under Cbar since the link leading to C is to the left of the link leading to IP.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Certain intermediate network nodes (e.g., Nspec and Nadj) do not show up in the output of the parser.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The LCS composition routine described inDorr (1992) derives the interlingua from the resulting syntactic representation.5 Our English dictionary has 90K entries, constructed automatically by applying a set of conversion routines to OALD entries. We have begun negotiations with the LDC for the acquisition of a Korean MRD for which we intend to construct similar routines.6 The English dictionary used by the message-passing system contains all morphological derivatives of every word. This approach would be impractical for Korean since the morphology is significantly richer.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The parameterized framework described above has been implemented in C++ and successfully tested on well known, translationally divergent sentences. Dorr (1990) We ran the parameterized parser on both the English and Korean sentences shown here. The results shown in Figure 5 which were obtained from running the program on a Sparcstation ELC. 3 In general, the times demonstrate a speedup of 2 to 3 orders of magnitude over previous principlebased parsers on analogous examples such as those given in Dorr (1993a) . Even more significant is the negligible difference in processing time between the two languages, despite radical differences in structure, particularly with respect to head-complement positioning. This is an improvement over previous parameterized approaches in which cross-linguistic divergences frequently induced timing discrepancies of 1-2 orders of magnitude due to the head-initial bias that underlies most parsing designs. ",
"cite_spans": [
{
"start": 148,
"end": 159,
"text": "Dorr (1990)",
"ref_id": "BIBREF4"
},
{
"start": 343,
"end": 344,
"text": "3",
"ref_id": "BIBREF2"
},
{
"start": 501,
"end": 513,
"text": "Dorr (1993a)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 266,
"end": 274,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results of Running Test Sentences for Korean/English",
"sec_num": "5."
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A Computational Model of Human Parsing",
"authors": [
{
"first": "S",
"middle": [],
"last": "Abney",
"suffix": ""
}
],
"year": 1989,
"venue": "Journal of Psycholinguistic Research",
"volume": "18",
"issue": "",
"pages": "129--144",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Abney, S. (1989). \"A Computational Model of Human Parsing,\" Journal of Psycholinguistic Research, 18, 129-144.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "The structure of shared forests in ambiguous parsing",
"authors": [
{
"first": "S",
"middle": [],
"last": "Billot",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Lang",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of ACL-89",
"volume": "",
"issue": "",
"pages": "143--151",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Billot, S. and B. Lang (1989). The structure of shared forests in ambiguous parsing. In Proceedings of ACL-89, 143-151.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Lectures on Government and Binding",
"authors": [
{
"first": "N",
"middle": [],
"last": "Chomsky",
"suffix": ""
}
],
"year": 1981,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chomsky, N. (1981). Lectures on Government and Binding. Foris Publications, Cinnaminson, USA.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Empty categories, chains, and parsing",
"authors": [
{
"first": "N",
"middle": [],
"last": "Correa",
"suffix": ""
}
],
"year": 1991,
"venue": "Principle-Based Parsing: Computation and Psycholinguistics",
"volume": "",
"issue": "",
"pages": "83--121",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Correa, N. (1991). Empty categories, chains, and parsing. In Berwick, R. C., Abney, S. P., and Tenny, C., editors, Principle-Based Parsing: Computation and Psycholinguistics, 83-121. Kluwer Academic Publishers.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Solving thematic divergences in machine translation",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of ACL-90",
"volume": "",
"issue": "",
"pages": "127--134",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dorr, B. (1990). Solving thematic divergences in machine translation. In Proceedings of ACL-90, 127-134. University of Pittsburgh, Pittsburgh, PA.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Principle-based parsing for machine translation",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1991,
"venue": "Principle-Based Parsing: Computation and Psycholinguistics",
"volume": "",
"issue": "",
"pages": "153--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dorr, B. (1991). Principle-based parsing for machine translation. In Berwick, R. C., Abney, S. P., and Tenny, C., editors, Principle-Based Parsing: Computation and Psycholinguistics, 153-184. Kluwer Academic Publishers.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The use of lexical semantics in interlingual machine translation",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1992,
"venue": "Machine Translation",
"volume": "7",
"issue": "3",
"pages": "135--193",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dorr, B. (1992). \"The use of lexical semantics in interlingual machine translation,\" Machine Translation, 7:3, 135-193.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Machine Translation: A View from the Lexicon",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dorr, B. (1993a). Machine Translation: A View from the Lexicon, MIT Press, Cambridge, MA.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Interlingual machine translation: a parameterized approach",
"authors": [
{
"first": "B",
"middle": [],
"last": "Dorr",
"suffix": ""
}
],
"year": 1993,
"venue": "Artificial Intelligence",
"volume": "63",
"issue": "",
"pages": "429--492",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dorr, B. (1993b). \"Interlingual machine translation: a parameterized approach,\" Artificial Intelligence, 63:1&2, 429-492.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "The computational implementation of principle-based parsers",
"authors": [
{
"first": "S",
"middle": [],
"last": "Fong",
"suffix": ""
}
],
"year": 1991,
"venue": "Principle-Based Parsing: Computation and Psycholinguistics",
"volume": "",
"issue": "",
"pages": "65--82",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fong, S. (1991). The computational implementation of principle-based parsers. In Berwick, B. C., Abney, S. P., and Tenny, C., editors, Principle-Based Parsing: Computation and Psycholinguistics, 65-82. Kluwer Academic Publishers.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Licensing and Tree Adjoining Grammar in GB Parsing",
"authors": [
{
"first": "R",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of ACL-90",
"volume": "",
"issue": "",
"pages": "111--118",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Frank, R, (1990). Licensing and Tree Adjoining Grammar in GB Parsing. In Proceedings of ACL-90, 111-118. University of Pittsburgh, Pittsburgh, PA.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Introduction to Government and Binding Theory",
"authors": [
{
"first": "L",
"middle": [],
"last": "Haegeman",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haegeman, L. (1991). Introduction to Government and Binding Theory. Basil Blackwell Ltd.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Context-free grammar parsing by message passing",
"authors": [
{
"first": "D",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Goebel",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of PACLING-93",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lin, D. and R. Goebel (1993). Context-free grammar parsing by message passing. In Proceedings of PACLING- 93, Vancouver, BC.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Principle-based parsing without overgeneration",
"authors": [
{
"first": "D",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of ACL-93, 112-120. Columbus",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lin, D. (1993). Principle-based parsing without overgeneration. In Proceedings of ACL-93, 112-120. Colum- bus, Ohio.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "How to process constituent structure in head final languages: The case of Korean",
"authors": [
{
"first": "S",
"middle": [],
"last": "Suh",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of Chicago Linguistic Society",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Suh, S. (1993). How to process constituent structure in head final languages: The case of Korean. In Proceed- ings of Chicago Linguistic Society, 29.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Efficient Parsing for Natural Language",
"authors": [
{
"first": "M",
"middle": [],
"last": "Tomita",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomita, M. (1986). Efficient Parsing for Natural Language. Kluwer Academic Publishers, Norwell, Mas- sachusetts.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Introduction to the Theory of Grammar. Current Studies in Linguistics",
"authors": [
{
"first": "H",
"middle": [],
"last": "Van Riemsdijk",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Williams",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "van Riemsdijk, H. and E. Williams (1986). Introduction to the Theory of Grammar. Current Studies in Linguistics. The MIT Press, Cambridge, Massachusetts.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Automatically Precompiled Code for Korean Grammar Network",
"authors": [
{
"first": "A",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Automatically Precompiled Code for Korean Grammar Network",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Network Representations of Grammars",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF1": {
"text": "Syntactic Parameter Settings for Korean",
"uris": null,
"type_str": "figure",
"num": null
},
"TABREF0": {
"type_str": "table",
"html": null,
"num": null,
"text": "The new item represents a larger Xbar structure resulting from the combination of the two smaller ones. If the new item satisfies local constraints, it is considered valid and saved in the local memory. Otherwise, it is discarded. A valid item satisfying the completion predicate of the node is sent further as a message to other nodes. Details of the algorithm are provided inLin (1993).",
"content": "<table/>"
}
}
}
} |