File size: 85,004 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 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 | {
"paper_id": "P05-1011",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:38:12.894591Z"
},
"title": "Probabilistic disambiguation models for wide-coverage HPSG parsing",
"authors": [
{
"first": "Yusuke",
"middle": [],
"last": "Miyao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Tokyo Hongo",
"location": {
"addrLine": "7-3-1, Bunkyo-ku",
"settlement": "Tokyo",
"country": "Japan"
}
},
"email": "yusuke@is.s.u-tokyo.ac.jp"
},
{
"first": "Jun",
"middle": [
"'"
],
"last": "Ichi Tsujii",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Tokyo Hongo",
"location": {
"addrLine": "7-3-1, Bunkyo-ku",
"settlement": "Tokyo",
"country": "Japan CREST, JST"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper reports the development of loglinear models for the disambiguation in wide-coverage HPSG parsing. The estimation of log-linear models requires high computational cost, especially with widecoverage grammars. Using techniques to reduce the estimation cost, we trained the models using 20 sections of Penn Treebank. A series of experiments empirically evaluated the estimation techniques, and also examined the performance of the disambiguation models on the parsing of real-world sentences.",
"pdf_parse": {
"paper_id": "P05-1011",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper reports the development of loglinear models for the disambiguation in wide-coverage HPSG parsing. The estimation of log-linear models requires high computational cost, especially with widecoverage grammars. Using techniques to reduce the estimation cost, we trained the models using 20 sections of Penn Treebank. A series of experiments empirically evaluated the estimation techniques, and also examined the performance of the disambiguation models on the parsing of real-world sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Head-Driven Phrase Structure Grammar (HPSG) (Pollard and Sag, 1994) has been studied extensively from both linguistic and computational points of view. However, despite research on HPSG processing efficiency (Oepen et al., 2002a) , the application of HPSG parsing is still limited to specific domains and short sentences (Oepen et al., 2002b; . Scaling up HPSG parsing to assess real-world texts is an emerging research field with both theoretical and practical applications.",
"cite_spans": [
{
"start": 44,
"end": 67,
"text": "(Pollard and Sag, 1994)",
"ref_id": "BIBREF22"
},
{
"start": 208,
"end": 229,
"text": "(Oepen et al., 2002a)",
"ref_id": "BIBREF19"
},
{
"start": 321,
"end": 342,
"text": "(Oepen et al., 2002b;",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recently, a wide-coverage grammar and a large treebank have become available for English HPSG (Miyao et al., 2004) . A large treebank can be used as training and test data for statistical models. Therefore, we now have the basis for the development and the evaluation of statistical disambiguation models for wide-coverage HPSG parsing.",
"cite_spans": [
{
"start": 94,
"end": 114,
"text": "(Miyao et al., 2004)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The aim of this paper is to report the development of log-linear models for the disambiguation in widecoverage HPSG parsing, and their empirical evaluation through the parsing of the Wall Street Journal of Penn Treebank II (Marcus et al., 1994) . This is challenging because the estimation of log-linear models is computationally expensive, and we require solutions to make the model estimation tractable. We apply two techniques for reducing the training cost. One is the estimation on a packed representation of HPSG parse trees (Section 3). The other is the filtering of parse candidates according to a preliminary probability distribution (Section 4).",
"cite_spans": [
{
"start": 223,
"end": 244,
"text": "(Marcus et al., 1994)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To our knowledge, this work provides the first results of extensive experiments of parsing Penn Treebank with a probabilistic HPSG. The results from the Wall Street Journal are significant because the complexity of the sentences is different from that of short sentences. Experiments of the parsing of realworld sentences can properly evaluate the effectiveness and possibility of parsing models for HPSG.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Discriminative log-linear models are now becoming a de facto standard for probabilistic disambiguation models for deep parsing (Johnson et al., 1999; Riezler et al., 2002; Geman and Johnson, 2002; Miyao and Tsujii, 2002; Clark and Curran, 2004b; Kaplan et al., 2004) . Previous studies on probabilistic models for HPSG Baldridge and Osborne, 2003; Malouf and van Noord, 2004 ) also adopted log-linear models. HPSG exploits feature structures to represent linguistic constraints. Such constraints are known to introduce inconsistencies in probabilistic models estimated using simple relative frequency (Abney, 1997) . Log-linear models are required for credible probabilistic models and are also beneficial for incorporating various overlapping features.",
"cite_spans": [
{
"start": 127,
"end": 149,
"text": "(Johnson et al., 1999;",
"ref_id": "BIBREF10"
},
{
"start": 150,
"end": 171,
"text": "Riezler et al., 2002;",
"ref_id": "BIBREF23"
},
{
"start": 172,
"end": 196,
"text": "Geman and Johnson, 2002;",
"ref_id": "BIBREF8"
},
{
"start": 197,
"end": 220,
"text": "Miyao and Tsujii, 2002;",
"ref_id": "BIBREF15"
},
{
"start": 221,
"end": 245,
"text": "Clark and Curran, 2004b;",
"ref_id": "BIBREF5"
},
{
"start": 246,
"end": 266,
"text": "Kaplan et al., 2004)",
"ref_id": "BIBREF11"
},
{
"start": 319,
"end": 347,
"text": "Baldridge and Osborne, 2003;",
"ref_id": "BIBREF1"
},
{
"start": 348,
"end": 374,
"text": "Malouf and van Noord, 2004",
"ref_id": "BIBREF12"
},
{
"start": 601,
"end": 614,
"text": "(Abney, 1997)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Disambiguation models for HPSG",
"sec_num": "2"
},
{
"text": "This study follows previous studies on the probabilistic models for HPSG. The probability, \u00d4\u00b4\u00d8 \u00d7\u00b5, of producing the parse result \u00d8 from a given sentence \u00d7 is defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Disambiguation models for HPSG",
"sec_num": "2"
},
{
"text": "\u00d4\u00b4\u00d8 \u00d7\u00b5 \u00bd \u00d7 \u00d4 \u00bc\u00b4\u00d8 \u00d7\u00b5 \u00dc\u00d4\u00b4 \u00b4\u00d8 \u00d7\u00b5 \u00b4\u00d8 \u00d7\u00b5\u00b5 \u00d7 \u00d8 \u00bc \u00be\u00cc\u00b4\u00d7\u00b5 \u00d4 \u00bc\u00b4\u00d8 \u00bc \u00d7\u00b5 \u00dc \u1ed0 \u00b4\u00d8 \u00bc \u00d7 \u00b5 \u00b4\u00d8 \u00bc \u00d7 \u00b5\u00b5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Disambiguation models for HPSG",
"sec_num": "2"
},
{
"text": "where \u00d4 \u00bc\u00b4\u00d8 \u00d7\u00b5 is a reference distribution (usually assumed to be a uniform distribution), and \u00cc\u00b4\u00d7\u00b5 is a set of parse candidates assigned to \u00d7. The feature function \u00b4\u00d8 \u00d7\u00b5 represents the characteristics of \u00d8 and \u00d7, while the corresponding model parameter \u00b4\u00d8 \u00d7\u00b5 is its weight. Model parameters that maximize the loglikelihood of the training data are computed using a numerical optimization method (Malouf, 2002) . Estimation of the above model requires a set of pairs \u00d8 \u00d7 \u00cc\u00d7\u00b5 , where \u00d8 \u00d7 is the correct parse for sentence \u00d7. While \u00d8 \u00d7 is provided by a treebank, \u00cc\u00b4\u00d7\u00b5 is computed by parsing each \u00d7 in the treebank. Previous studies assumed \u00cc\u00b4\u00d7\u00b5 could be enumerated; however, the assumption is impractical because the size of \u00cc\u00b4\u00d7\u00b5 is exponentially related to the length of \u00d7. The problem of exponential explosion is inevitable in the wide-coverage parsing of real-world texts because many parse candidates are produced to support various constructions in long sentences.",
"cite_spans": [
{
"start": 396,
"end": 410,
"text": "(Malouf, 2002)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Disambiguation models for HPSG",
"sec_num": "2"
},
{
"text": "To avoid exponential explosion, we represent \u00cc\u00b4\u00d7\u00b5 in a packed form of HPSG parse trees. A parse tree of HPSG is represented as a set of tuples \u00d1 \u00d0 \u00d6 , where \u00d1 \u00d0 and \u00d6 are the signs of mother, left daughter, and right daughter, respectively 1 . In chart parsing, partial parse candidates are stored in a chart, in which phrasal signs are identified and packed into an equivalence class if they are determined to be equivalent and dominate the same word sequence. A set of parse trees is then represented as a set of relations among equivalence classes. Figure 1 shows a chart for parsing \"he saw a girl with a telescope\", where the modifiee (\"saw\" or \"girl\") of \"with\" is ambiguous. Each feature structure expresses an equivalence class, and the arrows represent immediate-dominance relations. The phrase, \"saw a girl with a telescope\", has two trees (A in the figure). Since the signs of the top-most nodes are equivalent, they are packed into an equivalence class. The ambiguity is represented as two pairs of arrows that come out of the node.",
"cite_spans": [],
"ref_spans": [
{
"start": 552,
"end": 560,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Packed representation of HPSG parse trees",
"sec_num": "3"
},
{
"text": "Formally, a set of HPSG parse trees is represented in a chart as a tuple \u00d6 \u00ab , where is a set of equivalence classes, \u00d6 is a set of root nodes, and \u00ab \u00be \u00a2 is a function to represent immediate-dominance relations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Packed representation of HPSG parse trees",
"sec_num": "3"
},
{
"text": "Our representation of the chart can be interpreted as an instance of a feature forest (Miyao and Tsujii, 2002; Geman and Johnson, 2002) . A feature forest is an \"and/or\" graph to represent exponentiallymany tree structures in a packed form. If \u00cc\u00b4\u00d7\u00b5 is represented in a feature forest, \u00d4\u00b4\u00d8 \u00cc\u00b4\u00d7\u00b5\u00b5 can be estimated using dynamic programming without unpacking the chart. A feature forest is formally defined as a tuple, \u00ca AE , where is a set of conjunctive nodes, is a set of disjunctive nodes, \u00ca is a set of root nodes 2 , \u00be is a conjunctive daughter function, and AE \u00be is a disjunctive daughter function. The feature functions \u00b4\u00d8 \u00d7\u00b5 are assigned to conjunctive nodes. The simplest way to map a chart of HPSG parse trees into a feature forest is to map each equivalence class \u00be to a conjunctive node \u00be . However, in HPSG parsing, important features for disambiguation are combinations of a mother and its daughters, i.e., \u00d1 \u00d0 \u00d6 . Hence, we map the tuple \u00d1 \u00d0 \u00d6 , which corresponds to \u00d1 \u00d0 \u00d6 , into a conjunctive node. Figure 2 shows (a part of) the HPSG parse trees in Figure 1 represented as a feature forest. Square boxes are conjunctive nodes, dotted lines express a disjunctive daughter function, and solid arrows represent a conjunctive daughter function.",
"cite_spans": [
{
"start": 86,
"end": 110,
"text": "(Miyao and Tsujii, 2002;",
"ref_id": "BIBREF15"
},
{
"start": 111,
"end": 135,
"text": "Geman and Johnson, 2002)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [
{
"start": 1013,
"end": 1021,
"text": "Figure 2",
"ref_id": "FIGREF1"
},
{
"start": 1064,
"end": 1072,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Packed representation of HPSG parse trees",
"sec_num": "3"
},
{
"text": "The mapping is formally defined as follows. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Packed representation of HPSG parse trees",
"sec_num": "3"
},
{
"text": "\u00d1 \u00d0 \u00d6 \u00d1 \u00be \u00d0 \u00d6 \u00be \u00d0 \u00d6 \u00be \u00ab\u00b4 \u00d1 \u00b5 , , \u00ca \u00d1 \u00d0 \u00d6 \u00d1 \u00be \u00d6 \u00d1 \u00d0 \u00d6 \u00be , \u00d1 \u00b4 \u00d1 \u00b5 \u00d1 \u00be \u00b4 \u00d1 \u00b5 \u00d1 \u00d0 \u00d6 \u00d0 \u00d6 \u00be \u00d0 \u00d6 \u00be \u00ab\u00b4 \u00d1 \u00b5 , and AE \u00d1 \u00d0 \u00d6 \u00d0 \u00d6 \u00d1 \u00d0 \u00d6 \u00be .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Packed representation of HPSG parse trees",
"sec_num": "3"
},
{
"text": "The above method allows for the tractable estimation of log-linear models on exponentially-many HPSG parse trees. However, despite the development of methods to improve HPSG parsing efficiency (Oepen et al., 2002a) , the exhaustive parsing of all sentences in a treebank is still expensive.",
"cite_spans": [
{
"start": 193,
"end": 214,
"text": "(Oepen et al., 2002a)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Our idea is that we can omit the computation of parse trees with low probabilities in the estimation stage because \u00cc\u00b4\u00d7\u00b5 can be approximated with parse trees with high probabilities. To achieve this, we first prepared a preliminary probabilistic model whose estimation did not require the parsing of a treebank. The preliminary model was used to reduce the search space for parsing a training treebank.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "The preliminary model in this study is a unigram model, \u00d4\u00b4\u00d8 \u00d7\u00b5 \u00c9 \u00db\u00be\u00d7 \u00d4\u00b4\u00d0 \u00db\u00b5 where \u00db \u00be \u00d7 is a word in the sentence \u00d7, and \u00d0 is a lexical entry assigned to \u00db. This model can be estimated without parsing a treebank.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Given this model, we restrict the number of lexical entries used to parse a treebank. With a threshold \u00d2 for the number of lexical entries and a thresh-old\u00affor the probability, lexical entries are assigned to a word in descending order of probability, until the number of assigned entries exceeds \u00d2, or the accumulated probability exceeds\u00af. If the lexical entry necessary to produce the correct parse is not assigned, it is additionally assigned to the word. Figure 3 shows an example of filtering lexical entries assigned to \"saw\". With\u00af \u00bc , four lexical entries are assigned. Although the lexicon includes other lexical entries, such as a verbal entry taking a sentential complement (\u00d4 \u00bc \u00bc\u00bd in the figure), they are filtered out. This method reduces the time for parsing a treebank, while this approximation causes bias in the training data and results in lower accuracy. The trade-off between the parsing cost and the accuracy will be examined experimentally.",
"cite_spans": [],
"ref_spans": [
{
"start": 459,
"end": 467,
"text": "Figure 3",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "We have several ways to integrate \u00d4 with the estimated model \u00d4\u00b4\u00d8 \u00cc\u00b4\u00d7\u00b5\u00b5. In the experiments, we will empirically compare the following methods in terms of accuracy and estimation time.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Filtering only The unigram probability \u00d4 is used only for filtering.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Product The probability is defined as the product of \u00d4 and the estimated model \u00d4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Reference distribution \u00d4 is used as a reference distribution of \u00d4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Feature function \u00d0\u00d3 \u00d4 is used as a feature function of \u00d4. This method was shown to be a generalization of the reference distribution method (Johnson and Riezler, 2000) .",
"cite_spans": [
{
"start": 140,
"end": 167,
"text": "(Johnson and Riezler, 2000)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Filtering by preliminary distribution",
"sec_num": "4"
},
{
"text": "Feature functions in the log-linear models are designed to capture the characteristics of \u00d1 \u00d0 \u00d6 . In this paper, we investigate combinations of the atomic features listed in Table 1 . The following combinations are used for representing the characteristics of the binary/unary schema applications.",
"cite_spans": [],
"ref_spans": [
{
"start": 174,
"end": 181,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "binary \u00b6 RULE,DIST,COMMA",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "SPAN \u00d0 SYM \u00d0 WORD \u00d0 POS \u00d0 LE \u00d0 SPAN \u00d6 SYM \u00d6 WORD \u00d6 POS \u00d6 LE \u00d6 \u2022 unary RULE,SYM,WORD,POS,LE",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "In addition, the following is for expressing the condition of the root node of the parse tree. Figure 4 shows examples: root is for the root node, in which the phrase symbol is S and the surface form, part-of-speech, and lexical entry of the lexical head are \"saw\", VBD, and a transitive verb, respectively. binary is for the binary rule application to \"saw a girl\" and \"with a telescope\", in which the applied schema is the Head-Modifier Schema, the left daughter is VP headed by \"saw\", and the right daughter is PP headed by \"with\", whose part-of-speech is IN and the lexical entry is a VP-modifying preposition.",
"cite_spans": [],
"ref_spans": [
{
"start": 95,
"end": 103,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "In an actual implementation, some of the atomic features are abstracted (i.e., ignored) for smoothing. Table 2 shows a full set of templates of combined features used in the experiments. Each row represents a template of a feature function. A check means the atomic feature is incorporated while a hyphen means the feature is ignored.",
"cite_spans": [],
"ref_spans": [
{
"start": 103,
"end": 110,
"text": "Table 2",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "Restricting the domain of feature functions to \u00d1 \u00d0 \u00d6 seems to limit the flexibility of feature design. Although it is true to some extent, this does not necessarily mean the impossibility of incorporating features on nonlocal dependencies into the model. This is because a feature forest model does not assume probabilistic independence of conjunctive nodes. This means that we can unpack a part of the forest without changing the model. Actually, in our previous study (Miyao et al., 2003) , we successfully developed a probabilistic model including features on nonlocal predicate-argument dependencies. However, since we could not observe significant improvements by incorporating nonlocal features, this paper investigates only the features described above.",
"cite_spans": [
{
"start": 470,
"end": 490,
"text": "(Miyao et al., 2003)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": "5"
},
{
"text": "DIST COMMA SPAN SYM WORD POS LE \u00d4 \u00d4 \u00d4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RULE",
"sec_num": null
},
{
"text": "-- ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RULE",
"sec_num": null
},
{
"text": "\u00d4 \u00d4 \u00d4 \u00d4 \u00d4 \u00d4 - - \u00d4 \u00d4 - \u00d4 \u00d4 \u00d4 - - \u00d4 - \u00d4 \u00d4 \u00d4 \u00d4 - \u00d4 \u00d4 - - \u00d4 - \u00d4 \u00d4 - \u00d4 \u00d4 \u00d4 \u00d4 - \u00d4 \u00d4 - \u00d4 \u00d4 - \u00d4 - \u00d4 \u00d4 - \u00d4 - \u00d4 \u00d4 - \u00d4 \u00d4 \u00d4 \u00d4 - - \u00d4 \u00d4 \u00d4 - - - \u00d4 \u00d4 \u00d4 \u00d4 \u00d4 - - - \u00d4 - \u00d4 \u00d4 \u00d4 - - - - \u00d4 \u00d4 \u00d4 \u00d4 - \u00d4 - - - \u00d4 - \u00d4 \u00d4 - - \u00d4 \u00d4 \u00d4 - \u00d4 \u00d4 - - \u00d4 - \u00d4 - \u00d4 \u00d4 - - - \u00d4 \u00d4 - \u00d4 \u00d4 \u00d4 - - - RULE SYM WORD POS LE \u00d4 - \u00d4 \u00d4 \u00d4 \u00d4 - \u00d4 \u00d4 - \u00d4 - \u00d4 - \u00d4 \u00d4 \u00d4 \u00d4 - - \u00d4 - - \u00d4 \u00d4 \u00d4 - - \u00d4 - \u00d4 - - - \u00d4 \u00d4 \u00d4 - - - SYM WORD POS LE - \u00d4 \u00d4 \u00d4 - \u00d4 \u00d4 - - \u00d4 - \u00d4 \u00d4 \u00d4 - - - - \u00d4 \u00d4 - - \u00d4 - - - - \u00d4 \u00d4 - - -",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RULE",
"sec_num": null
},
{
"text": "We used an HPSG grammar derived from Penn Treebank (Marcus et al., 1994) Section 02-21 (39,832 sentences) by our method of grammar development (Miyao et al., 2004) . The training data was the HPSG treebank derived from the same portion of the Penn Treebank 3 . For the training, we eliminated sentences with no less than 40 words and for which the parser could not produce the correct parse. The resulting training set consisted of 33,574 sentences. The treebanks derived from Sections 22 and 23 were used as the development (1,644 sentences) and final test sets (2,299 sentences). We measured the accuracy of predicate-argument dependencies output by the parser. A dependency is defined as a tuple \u00db \u00db , where is the predicate type (e.g., adjective, intransitive verb), \u00db is the head word of the predicate, is the argument label (MODARG, ARG1, ..., ARG4), and \u00db is the head word of the argument. Labeled precision/recall (LP/LR) is the ratio of tuples correctly identified by the parser, while unlabeled precision/recall (UP/UR) is the ratio of \u00db and \u00db correctly identified regardless of and . The F-score is the harmonic mean of LP and LR. The accuracy was measured by parsing test sentences with part-of-speech tags pro-vided by the treebank. The Gaussian prior was used for smoothing (Chen and Rosenfeld, 1999) , and its hyper-parameter was tuned for each model to maximize the F-score for the development set. The optimization algorithm was the limited-memory BFGS method (Nocedal and Wright, 1999) . All the following experiments were conducted on AMD Opteron servers with a 2.0-GHz CPU and 12-GB memory. Table 3 shows the accuracy for the development/test sets. Features occurring more than twice were included in the model (598,326 features). Filtering was done by the reference distribution method with \u00d2 \u00bd\u00bc and\u00af \u00bc . The unigram model for filtering was a log-linear model with two feature templates, WORD POS LE and POS LE (24,847 features). Our results cannot be strictly compared with other grammar formalisms because each formalism represents predicate-argument dependencies differently; for reference, our results are competitive with the corresponding measures reported for Combinatory Categorial Grammar (CCG) (LP/LR = 86.6/86.3) (Clark and Curran, 2004b) . Different from the results of CCG and PCFG (Collins, 1999; Charniak, 2000) , the recall was clearly lower than precision. This results from the HPSG grammar having stricter feature constraints and the parser not being able to produce parse results for around one percent of the sentences. To improve recall, we need techniques of robust processing with HPSG. Table 4 compares the estimation methods introduced in Section 4. In all of the following experiments, we show the accuracy for the test set ( 40 words) only. Table 4 revealed that our simple method of filtering caused a fatal bias in training data when a preliminary distribution was used only for filtering. However, the model combined with a preliminary model achieved sufficient accuracy. The reference distribution method achieved higher accuracy and lower cost. The feature function method achieved lower accuracy in our experiments. A possible reason is that a hyper-parameter of the prior was set to the same value for all the features including the feature of the preliminary distribution. Table 5 shows the results of changing the filtering threshold. We can determine the correlation between the estimation/parsing cost and accuracy. In our experiment, \u00d2 \u00bd\u00bc and\u00af \u00bc \u00bc seem necessary to preserve the F-score over \u00bc. Figure 5 shows the accuracy for each sentence length. It is apparent from this figure that the accuracy was significantly higher for shorter sentences ( 10 words). This implies that experiments with only short sentences overestimate the performance of parsers. Sentences with at least 10 words are nec- Figure 6 shows the learning curve. A feature set was fixed, while the parameter of the prior was optimized for each model. High accuracy was attained even with small data, and the accuracy seemed to be saturated. This indicates that we cannot further improve the accuracy simply by increasing training data. The exploration of new types of features is necessary for higher accuracy. Table 6 shows the accuracy with difference feature sets. The accuracy was measured by removing some of the atomic features from the final model. The last row denotes the accuracy attained by the preliminary model. The numbers in bold type represent that the difference from the final model was significant according to stratified shuffling tests (Cohen, 1995) with p-value \u00bc \u00bc . The results indicate that DIST, COMMA, SPAN, WORD, : Accuracy with different feature sets ferences were slight. In contrast, RULE, SYM, and LE features did not affect the accuracy. However, if each of them was removed together with another feature, the accuracy decreased drastically. This implies that such features had overlapping information. Table 7 shows the manual classification of the causes of errors in 100 sentences randomly chosen from the development set. In our evaluation, one error source may cause multiple errors of dependencies. For example, if a wrong lexical entry was assigned to a verb, all the argument dependencies of the verb are counted as errors. The numbers in the table include such double-counting. Major causes were classified into three types: argument/modifier distinction, attachment ambiguity, and lexical ambiguity. While attachment/lexical ambiguities are well-known causes, the other is peculiar to deep parsing. Most of the errors cannot be resolved by features we investigated in this study, and the design of other features is crucial for further improvements.",
"cite_spans": [
{
"start": 51,
"end": 72,
"text": "(Marcus et al., 1994)",
"ref_id": "BIBREF14"
},
{
"start": 143,
"end": 163,
"text": "(Miyao et al., 2004)",
"ref_id": "BIBREF17"
},
{
"start": 1288,
"end": 1314,
"text": "(Chen and Rosenfeld, 1999)",
"ref_id": "BIBREF3"
},
{
"start": 1477,
"end": 1503,
"text": "(Nocedal and Wright, 1999)",
"ref_id": "BIBREF18"
},
{
"start": 2245,
"end": 2270,
"text": "(Clark and Curran, 2004b)",
"ref_id": "BIBREF5"
},
{
"start": 2316,
"end": 2331,
"text": "(Collins, 1999;",
"ref_id": "BIBREF7"
},
{
"start": 2332,
"end": 2347,
"text": "Charniak, 2000)",
"ref_id": "BIBREF2"
},
{
"start": 4647,
"end": 4671,
"text": "DIST, COMMA, SPAN, WORD,",
"ref_id": null
}
],
"ref_spans": [
{
"start": 1611,
"end": 1618,
"text": "Table 3",
"ref_id": "TABREF2"
},
{
"start": 2632,
"end": 2639,
"text": "Table 4",
"ref_id": "TABREF4"
},
{
"start": 2790,
"end": 2797,
"text": "Table 4",
"ref_id": "TABREF4"
},
{
"start": 3330,
"end": 3337,
"text": "Table 5",
"ref_id": "TABREF5"
},
{
"start": 3556,
"end": 3564,
"text": "Figure 5",
"ref_id": null
},
{
"start": 3859,
"end": 3867,
"text": "Figure 6",
"ref_id": "FIGREF5"
},
{
"start": 4242,
"end": 4249,
"text": "Table 6",
"ref_id": "TABREF7"
},
{
"start": 4967,
"end": 4974,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "6"
},
{
"text": "Experiments on deep parsing of Penn Treebank have been reported for Combinatory Categorial Grammar (CCG) (Clark and Curran, 2004b) and Lexical Functional Grammar (LFG) (Kaplan et al., 2004) . They developed log-linear models on a packed representation of parse forests, which is similar to our representation. Although HPSG exploits further complicated feature constraints and requires high com- Table 7 : Error analysis putational cost, our work has proved that log-linear models can be applied to HPSG parsing and attain accurate and wide-coverage parsing. Clark and Curran (2004a) described a method of reducing the cost of parsing a training treebank in the context of CCG parsing. They first assigned to each word a small number of supertags, which correspond to lexical entries in our case, and parsed supertagged sentences. Since they did not mention the probabilities of supertags, their method corresponds to our \"filtering only\" method. However, they also applied the same supertagger in a parsing stage, and this seemed to be crucial for high accuracy. This means that they estimated the probability of producing a parse tree from a supertagged sentence.",
"cite_spans": [
{
"start": 105,
"end": 130,
"text": "(Clark and Curran, 2004b)",
"ref_id": "BIBREF5"
},
{
"start": 168,
"end": 189,
"text": "(Kaplan et al., 2004)",
"ref_id": "BIBREF11"
},
{
"start": 559,
"end": 583,
"text": "Clark and Curran (2004a)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 396,
"end": 403,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Discussion and related work",
"sec_num": "7"
},
{
"text": "Another approach to estimating log-linear models for HPSG is to extract a small informative sample from the original set \u00cc\u00b4\u00d7\u00b5 (Osborne, 2000) . Malouf and van Noord (2004) successfully applied this method to German HPSG. The problem with this method was in the approximation of exponentially many parse trees by a polynomial-size sample. However, their method has the advantage that any features on a parse tree can be incorporated into the model. The trade-off between approximation and locality of features is an outstanding problem.",
"cite_spans": [
{
"start": 126,
"end": 141,
"text": "(Osborne, 2000)",
"ref_id": "BIBREF21"
},
{
"start": 144,
"end": 171,
"text": "Malouf and van Noord (2004)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and related work",
"sec_num": "7"
},
{
"text": "Other discriminative classifiers were applied to the disambiguation in HPSG parsing (Baldridge and Osborne, 2003; Toutanova et al., 2004) . The problem of exponential explosion is also inevitable for their methods. An approach similar to ours may be applied to them, following the study on the learning of a discriminative classifier for a packed representation (Taskar et al., 2004) .",
"cite_spans": [
{
"start": 84,
"end": 113,
"text": "(Baldridge and Osborne, 2003;",
"ref_id": "BIBREF1"
},
{
"start": 114,
"end": 137,
"text": "Toutanova et al., 2004)",
"ref_id": "BIBREF26"
},
{
"start": 362,
"end": 383,
"text": "(Taskar et al., 2004)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and related work",
"sec_num": "7"
},
{
"text": "As discussed in Section 6, exploration of other features is indispensable to further improvements. A possible direction is to encode larger contexts of parse trees, which were shown to improve the accuracy Toutanova et al., 2004) . Future work includes the investigation of such features, as well as the abstraction of lexical dependencies like semantic classes.",
"cite_spans": [
{
"start": 206,
"end": 229,
"text": "Toutanova et al., 2004)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and related work",
"sec_num": "7"
},
{
"text": "For simplicity, only binary trees are considered. Extension to unary and \u00d2-ary (\u00d2 \u00be) trees is trivial.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For the ease of explanation, the definition of root node is slightly different from the original.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The programs to make the grammar and the treebank from Penn Treebank are available at http://wwwtsujii.is.s.u-tokyo.ac.jp/enju/.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Stochastic attribute-value grammars",
"authors": [
{
"first": "S",
"middle": [
"P"
],
"last": "Abney",
"suffix": ""
}
],
"year": 1997,
"venue": "Computational Linguistics",
"volume": "",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. P. Abney. 1997. Stochastic attribute-value grammars. Computational Linguistics, 23(4).",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Active learning for HPSG parse selection",
"authors": [
{
"first": "J",
"middle": [],
"last": "Baldridge",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Osborne",
"suffix": ""
}
],
"year": 2003,
"venue": "CoNLL-03",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Baldridge and M. Osborne. 2003. Active learning for HPSG parse selection. In CoNLL-03.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A maximum-entropy-inspired parser",
"authors": [
{
"first": "E",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. NAACL-2000",
"volume": "",
"issue": "",
"pages": "132--139",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "E. Charniak. 2000. A maximum-entropy-inspired parser. In Proc. NAACL-2000, pages 132-139.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A Gaussian prior for smoothing maximum entropy models",
"authors": [
{
"first": "S",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Rosenfeld",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Chen and R. Rosenfeld. 1999. A Gaussian prior for smoothing maximum entropy models. Technical Re- port CMUCS-99-108, Carnegie Mellon University.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "The importance of supertagging for wide-coverage CCG parsing",
"authors": [
{
"first": "S",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "J",
"middle": [
"R"
],
"last": "Curran",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. COLING-04",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Clark and J. R. Curran. 2004a. The importance of su- pertagging for wide-coverage CCG parsing. In Proc. COLING-04.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Parsing the WSJ using CCG and log-linear models",
"authors": [
{
"first": "S",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "J",
"middle": [
"R"
],
"last": "Curran",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. 42th ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Clark and J. R. Curran. 2004b. Parsing the WSJ using CCG and log-linear models. In Proc. 42th ACL.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Empirical Methods for Artificial Intelligence",
"authors": [
{
"first": "P",
"middle": [
"R"
],
"last": "Cohen",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "P. R. Cohen. 1995. Empirical Methods for Artificial In- telligence. MIT Press.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Head-Driven Statistical Models for Natural Language Parsing",
"authors": [
{
"first": "M",
"middle": [],
"last": "Collins",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, Univ. of Pennsylvania.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Dynamic programming for parsing and estimation of stochastic unification-based grammars",
"authors": [
{
"first": "S",
"middle": [],
"last": "Geman",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. 40th ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Geman and M. Johnson. 2002. Dynamic pro- gramming for parsing and estimation of stochastic unification-based grammars. In Proc. 40th ACL.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Exploiting auxiliary distributions in stochastic unification-based grammars",
"authors": [
{
"first": "M",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. 1st NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Johnson and S. Riezler. 2000. Exploiting auxiliary distributions in stochastic unification-based grammars. In Proc. 1st NAACL.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Estimators for stochastic \"unification-based\" grammars",
"authors": [
{
"first": "M",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Geman",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Canon",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Chi",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. ACL'99",
"volume": "",
"issue": "",
"pages": "535--541",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Johnson, S. Geman, S. Canon, Z. Chi, and S. Riezler. 1999. Estimators for stochastic \"unification-based\" grammars. In Proc. ACL'99, pages 535-541.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Speed and accuracy in shallow and deep stochastic parsing",
"authors": [
{
"first": "R",
"middle": [
"M"
],
"last": "Kaplan",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
},
{
"first": "T",
"middle": [
"H"
],
"last": "King",
"suffix": ""
},
{
"first": "J",
"middle": [
"T"
],
"last": "Maxwell",
"suffix": ""
},
{
"first": "Iii",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Vasserman",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. HLT/NAACL'04",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. M. Kaplan, S. Riezler, T. H. King, J. T. Maxwell III, and A. Vasserman. 2004. Speed and accuracy in shallow and deep stochastic parsing. In Proc. HLT/NAACL'04.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Wide coverage parsing with stochastic attribute value grammars",
"authors": [
{
"first": "R",
"middle": [],
"last": "Malouf",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Van Noord",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. IJCNLP-04 Workshop \"Beyond Shallow Analyses",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Malouf and G. van Noord. 2004. Wide coverage pars- ing with stochastic attribute value grammars. In Proc. IJCNLP-04 Workshop \"Beyond Shallow Analyses\".",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A comparison of algorithms for maximum entropy parameter estimation",
"authors": [
{
"first": "R",
"middle": [],
"last": "Malouf",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. CoNLL-2002",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Malouf. 2002. A comparison of algorithms for maxi- mum entropy parameter estimation. In Proc. CoNLL- 2002.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "The Penn Treebank: Annotating predicate argument structure",
"authors": [
{
"first": "M",
"middle": [],
"last": "Marcus",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "M",
"middle": [
"A"
],
"last": "Marcinkiewicz",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Macintyre",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Bies",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Ferguson",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Katz",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Schasberger",
"suffix": ""
}
],
"year": 1994,
"venue": "ARPA Human Language Technology Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Marcus, G. Kim, M. A. Marcinkiewicz, R. MacIntyre, A. Bies, M. Ferguson, K. Katz, and B. Schasberger. 1994. The Penn Treebank: Annotating predicate argu- ment structure. In ARPA Human Language Technol- ogy Workshop.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Maximum entropy estimation for feature forests",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Miyao",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. HLT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Miyao and J. Tsujii. 2002. Maximum entropy estima- tion for feature forests. In Proc. HLT 2002.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Probabilistic modeling of argument structures including non-local dependencies",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Miyao",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Ninomiya",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2003,
"venue": "Proc. RANLP 2003",
"volume": "",
"issue": "",
"pages": "285--291",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Miyao, T. Ninomiya, and J. Tsujii. 2003. Probabilistic modeling of argument structures including non-local dependencies. In Proc. RANLP 2003, pages 285-291.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Corpusoriented grammar development for acquiring a Headdriven Phrase Structure Grammar from the Penn Treebank",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Miyao",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Ninomiya",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. IJCNLP-04",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Miyao, T. Ninomiya, and J. Tsujii. 2004. Corpus- oriented grammar development for acquiring a Head- driven Phrase Structure Grammar from the Penn Tree- bank. In Proc. IJCNLP-04.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Numerical Optimization",
"authors": [
{
"first": "J",
"middle": [],
"last": "Nocedal",
"suffix": ""
},
{
"first": "S",
"middle": [
"J"
],
"last": "Wright",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Nocedal and S. J. Wright. 1999. Numerical Optimiza- tion. Springer.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Collaborative Language Engineering: A Case Study in Efficient Grammar-Based Processing",
"authors": [
{
"first": "S",
"middle": [],
"last": "Oepen",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tsujii",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Oepen, D. Flickinger, J. Tsujii, and H. Uszkoreit, ed- itors. 2002a. Collaborative Language Engineering: A Case Study in Efficient Grammar-Based Processing. CSLI Publications.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "The LinGO, Redwoods treebank. motivation and preliminary applications",
"authors": [
{
"first": "S",
"middle": [],
"last": "Oepen",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Manning",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Brants",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Oepen, K. Toutanova, S. Shieber, C. Manning, D. Flickinger, and T. Brants. 2002b. The LinGO, Redwoods treebank. motivation and preliminary appli- cations. In Proc. COLING 2002.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Estimation of stochastic attributevalue grammar using an informative sample",
"authors": [
{
"first": "M",
"middle": [],
"last": "Osborne",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Osborne. 2000. Estimation of stochastic attribute- value grammar using an informative sample. In Proc. COLING 2000.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Head-Driven Phrase Structure Grammar",
"authors": [
{
"first": "C",
"middle": [],
"last": "Pollard",
"suffix": ""
},
{
"first": "I",
"middle": [
"A"
],
"last": "Sag",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. Pollard and I. A. Sag. 1994. Head-Driven Phrase Structure Grammar. University of Chicago Press.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques",
"authors": [
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
},
{
"first": "T",
"middle": [
"H"
],
"last": "King",
"suffix": ""
},
{
"first": "R",
"middle": [
"M"
],
"last": "Kaplan",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Crouch",
"suffix": ""
},
{
"first": "J",
"middle": [
"T"
],
"last": "Maxwell",
"suffix": ""
},
{
"first": "Iii",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. 40th ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Riezler, T. H. King, R. M. Kaplan, R. Crouch, J. T. Maxwell III, and M. Johnson. 2002. Pars- ing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques. In Proc. 40th ACL.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Max-margin parsing",
"authors": [
{
"first": "B",
"middle": [],
"last": "Taskar",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Collins",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Koller",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B. Taskar, D. Klein, M. Collins, D. Koller, and C. Man- ning. 2004. Max-margin parsing. In EMNLP 2004.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Feature selection for a rich HPSG grammar using decision trees",
"authors": [
{
"first": "K",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "C",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. CoNLL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Toutanova and C. D. Manning. 2002. Feature selec- tion for a rich HPSG grammar using decision trees. In Proc. CoNLL-2002.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection",
"authors": [
{
"first": "K",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Markova",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Toutanova, P. Markova, and C. Manning. 2004. The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection. In EMNLP 2004.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Chart for parsing \"he saw a girl with a telescope\"",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"text": "Packed representation of HPSG parse trees inFigure 1",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF2": {
"text": "Filtering of lexical entries for \"saw\"",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF3": {
"text": "RULEthe name of the applied schemaDIST the distance between the head words of the daughters COMMA whether a comma exists between daughters and/or inside of daughter phrases SPAN the number of words dominated by the phrase SYM the symbol of the phrasal category (e.g. NP, VP) WORD the surface form of the head word POS the part-of-speech of the head word LE the lexical entry assigned to the head word",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF4": {
"text": "Figure 4: Example features",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF5": {
"text": "Corpus size vs. accuracy essary to properly evaluate the performance of parsing real-world texts.",
"num": null,
"type_str": "figure",
"uris": null
},
"TABREF0": {
"html": null,
"num": null,
"text": "Templates of atomic features",
"type_str": "table",
"content": "<table/>"
},
"TABREF1": {
"html": null,
"num": null,
"text": "Feature templates for binary schema (left), unary schema (center), and root condition (right)",
"type_str": "table",
"content": "<table><tr><td/><td>Avg. length</td><td>LP</td><td>LR</td><td>UP</td><td>UR</td><td>F-score</td></tr><tr><td>Section 22 ( 40 words)</td><td>20.69</td><td colspan=\"4\">87.18 86.23 90.67 89.68</td><td>86.70</td></tr><tr><td>Section 22 ( 100 words)</td><td>22.43</td><td colspan=\"4\">86.99 84.32 90.45 87.67</td><td>85.63</td></tr><tr><td>Section 23 ( 40 words)</td><td>20.52</td><td colspan=\"4\">87.12 85.45 90.65 88.91</td><td>86.27</td></tr><tr><td>Section 23 ( 100 words)</td><td>22.23</td><td colspan=\"4\">86.81 84.64 90.29 88.03</td><td>85.71</td></tr></table>"
},
"TABREF2": {
"html": null,
"num": null,
"text": "",
"type_str": "table",
"content": "<table/>"
},
"TABREF4": {
"html": null,
"num": null,
"text": "Estimation method vs. accuracy and estimation time",
"type_str": "table",
"content": "<table><tr><td colspan=\"3\">\u00d2 \u00afF-score Estimation time (sec.)</td><td>Parsing time (sec.)</td><td>Memory usage (MB)</td></tr><tr><td>5, 0.80</td><td>84.31</td><td>161</td><td>7,827</td><td>2,377</td></tr><tr><td>5, 0.90</td><td>84.69</td><td>207</td><td>9,412</td><td>2,992</td></tr><tr><td>5, 0.95</td><td>84.70</td><td>240</td><td>12,027</td><td>3,648</td></tr><tr><td>5, 0.98</td><td>84.81</td><td>340</td><td>15,168</td><td>4,590</td></tr><tr><td>10, 0.80</td><td>84.79</td><td>164</td><td>8,858</td><td>2,658</td></tr><tr><td>10, 0.90</td><td>85.77</td><td>298</td><td>13,996</td><td>4,062</td></tr><tr><td>10, 0.95</td><td>86.27</td><td>654</td><td>25,308</td><td>6,324</td></tr><tr><td>10, 0.98</td><td>86.56</td><td>1,778</td><td>55,691</td><td>11,700</td></tr><tr><td>15, 0.80</td><td>84.68</td><td>180</td><td>9,337</td><td>2,676</td></tr><tr><td>15, 0.90</td><td>85.85</td><td>308</td><td>14,915</td><td>4,220</td></tr><tr><td>15, 0.95</td><td>86.68</td><td>854</td><td>32,757</td><td>7,766</td></tr></table>"
},
"TABREF5": {
"html": null,
"num": null,
"text": "Filtering threshold vs. accuracy and estimation time",
"type_str": "table",
"content": "<table/>"
},
"TABREF7": {
"html": null,
"num": null,
"text": "",
"type_str": "table",
"content": "<table/>"
}
}
}
} |