File size: 103,407 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 | {
"paper_id": "P89-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:14:40.309346Z"
},
"title": "DICTIONARIES, DICTIONARY GRAMMARS AND DICTIONARY ENTRY PARSING",
"authors": [
{
"first": "Mary",
"middle": [
"S"
],
"last": "Neff",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "IBM T. J. Watson Research Center",
"location": {
"postBox": "P. O. Box 704",
"postCode": "10598",
"settlement": "Yorktown Heights",
"region": "New York"
}
},
"email": ""
},
{
"first": "Branimir",
"middle": [
"K"
],
"last": "Boguraev",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Cambridge",
"location": {
"addrLine": "Yorktown Heights, New Museums Site",
"postBox": "P. O. Box 704",
"postCode": "10598, CB2 3QG",
"settlement": "Cambridge",
"region": "New York"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Computerist: ... But, great Scott, what about structure? You can't just bang that lot into a machine without structure. Half a gigabyte of sequential file ... Lexicographer: Oh, we know all about structure. Take this entry for example. You see here italics as the typical ambiguous structural element marker, being apparently used as an undefined phrase-entry lemrna, but in fact being the subordinate entry headword address preceding the small-cap cross-reference headword address which is nested within the gloss to a defined phrase entry, itself nested within a subordinate (bold lowercase letter) sense section in the second branch of a forked multiple part of speech main entry. Now that's typical of the kind of structural relationship that must be made crystal-clear in the eventual database.",
"pdf_parse": {
"paper_id": "P89-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "Computerist: ... But, great Scott, what about structure? You can't just bang that lot into a machine without structure. Half a gigabyte of sequential file ... Lexicographer: Oh, we know all about structure. Take this entry for example. You see here italics as the typical ambiguous structural element marker, being apparently used as an undefined phrase-entry lemrna, but in fact being the subordinate entry headword address preceding the small-cap cross-reference headword address which is nested within the gloss to a defined phrase entry, itself nested within a subordinate (bold lowercase letter) sense section in the second branch of a forked multiple part of speech main entry. Now that's typical of the kind of structural relationship that must be made crystal-clear in the eventual database.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "structure from the typographical markings which persist on the dictionary distribution tapes and embody the publishers' notational conventions; followed by making explicit all of the codified and ellided information packed into individual entries. We discuss notational conventions and tape formats, outline structural properties of dictionaries, observe a range of representational phenomena particularly relevant to dictionary parsing, and derive a set of minimal requirements for a dictionary grammar formalism. We present a general purpose dictionary entry parser which uses a formal notation designed to describe the structure of entries and performs a mapping from the flat character stream on the tape to a highly structured and fully instantiated representation of the dictionary. We demonstrate the power of the formalism by drawing examples from a range of dictionary sources which have been processedand converted into lexical databases.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Machine-readable dictionaries (MRD's) axe typi, tally ayailable in the form of publishers typesetting tapes, and consequently are represented by a fiat character stream where lexical data proper is heavily interspersed with special (control) characters. These map to the font changes and other notational conventions used in the printed form of the dictionary and designed to pack, and present in a codified compact visual format, as much lexical data as possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I. INI\"RODUCTION",
"sec_num": null
},
{
"text": "To make maximal use of MRD's, it is necessary to make their data, as well as structure, fully ex-~ licit, in a data base format that lends itself to exible querying. However, since none of the lexical data base (LDB) creation efforts to date fully addresses both of these issues, they fail to offer a general framework for processing the wide range of dictionary resources available in machine-readable form. As one extreme, the conversion of an MRD into an LDB may be carried out by a 'one-off\" program --such as, for example, used for the Longman Dictionary of Contemporary English (LDOCE) and described in Bogtbr_ aev and Briscoe, 1989. While the resuiting LDB is quite explicit and complete with respect to the data in the source, all knowledge of the dictionary structure is embodied in the conversion program. On the other hand, more modular architectures consisting of a parser and a _grammar --best exemplified by Kazman's (1986) analysis of the Oxford English Dictionary (OED) --do not deliver the structurally rich and explicit LDB ideally required for easy and unconstrained access to the source data. The majority of computational lexicography projects, in fact, fall in the first of the categories above, in that they typically concentrate on the conversion of a single dictlonarv into an LDB: examples here include the work l~y e.g. Ahlswede et al., 1986 , on The Webster's Seventh New Collegiate Dictionary; Fox et a/., 1988, on The Collins English Dictionary; Calzolari and Picchi, 1988, on H Nuovo Dizionario Italiano Garzanti; van der Steen, 1982, and Nakamura, 1988, on LDOCE. Even work based on multiple dictionaries (e.g. in bilingual context: see Calzolari and Picchi, 1986) appear to have used specialized programs for eac~ dictionary source. In addition, not an uncommon property of the LDB's cited above is their incompleteness with respect to the original source: there is a tendency_ to extract, in a pre-processing phase, only some fragments (e.g. part of speech information or definition fields) while ignoring others (e.g. etymology, pronunciation or usage notes). We have built a Dictionary Entry Parser (DEP) together with grammars for several different dictionaries. Our goal has been to create a general mechanism for converting to a common LDB format a wide range of MRD's demonstrating a wide range of phenomena. In contrast to the OED project, where the data in the dictionary is only tagged to indicate its structural characteristics, we identify ,two processes which are crucial for the 'unfolding, or making explicit, the structure of an MRD: identification of the structural markers, followed by their interpretation in context resulting in detailed parse trees for individual entries. Furthermore, unlike the tagging of the OED, carried out in several passes over the data and using different grammars (in order to cope with the highly complex, idiosyncratic and ambiguous nature of dictionary entries), we employ a parsing engine exploiting unification and backtracking, and using a single grammar consisting of three different sets of rules. The advantages of handling the structural complexities of MRD sources and deriving corresponding LDB s in one operation become clear below. While DEP has been described in general terms before (Byrd et al., 1987; Neff eta/., 1988) , this paper draws on our experience in parsing the Collins German-English / Collins English-German (CGE/CEG) and LDOCE dictionaries, which represent two very different types of machinereadable sources vis-~t-vis format of the typesetting tapes and notational conventions exploited by the lexicographers. We examine more closely some of the phenomena encountered in these dictionaries, trace their implications for MRD-to-LDB parsing, show how they motivate the design of the DEP grammar formalism, and discuss treatment of typical entry configurations.",
"cite_spans": [
{
"start": 922,
"end": 937,
"text": "Kazman's (1986)",
"ref_id": "BIBREF10"
},
{
"start": 1347,
"end": 1368,
"text": "Ahlswede et al., 1986",
"ref_id": null
},
{
"start": 1476,
"end": 1544,
"text": "Calzolari and Picchi, 1988, on H Nuovo Dizionario Italiano Garzanti;",
"ref_id": null
},
{
"start": 1545,
"end": 1569,
"text": "van der Steen, 1982, and",
"ref_id": "BIBREF13"
},
{
"start": 1570,
"end": 1595,
"text": "Nakamura, 1988, on LDOCE.",
"ref_id": null
},
{
"start": 1669,
"end": 1696,
"text": "Calzolari and Picchi, 1986)",
"ref_id": "BIBREF4"
},
{
"start": 3279,
"end": 3298,
"text": "(Byrd et al., 1987;",
"ref_id": null
},
{
"start": 3299,
"end": 3316,
"text": "Neff eta/., 1988)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I. INI\"RODUCTION",
"sec_num": null
},
{
"text": "The structure of dictionary entries is mostly implicit in the font codes and other special characters controlling the layout of an entry on the printed page; furthermore, data is typically compacted to save space in print, and it is common for different fields within an entry to employ radically different compaction schemes and abbreviatory devices. For example, the notation T5a, b,3 stands for the LDOCE grammar codes T5a;T5b;T3 (Boguraev and Briscoe, 1989 , present a detailed description of the grammar coding system in this dictionary), and many adverbs are stored as run-ons of the adjectives, using the abbreviatory convention ~ly (the same convention appliesto ce~a~o types of atfixation in general:",
"cite_spans": [
{
"start": 433,
"end": 460,
"text": "(Boguraev and Briscoe, 1989",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "STRUCTURAL PROPERTIES OF MRD'S",
"sec_num": "2."
},
{
"text": "er, less, hess, etc.). In CGE, German compounds with a common first element appear grouped together under it:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "STRUCTURAL PROPERTIES OF MRD'S",
"sec_num": "2."
},
{
"text": "Kinder-: .~.ehor m children's choir; --doe nt children's [ village; -ehe f child marriage.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "STRUCTURAL PROPERTIES OF MRD'S",
"sec_num": "2."
},
{
"text": "Dictionaries often factor out common substrings in data fields as in the following LDOCE and CEG entries: ia.cu.bLtor ... a machine for a keeping eggs warm until they HATCH b keeping alive babies that are too small to live and breathe in ordinary air Furthermore, a variety of conventions exists for making text fragments perfo.,rm more than one function (the capitalization of' HATCH above, for instance, signals a close conceptual link with the word being defined). Data of this sort is not very useful to an LDB user without explicit expansion and recovery of compacted headwords and fragments of entries. Parsing a dictionary to create an LDB that can be easily queried by a user or a program therefore implies not only tag-g~ag the data in the entry, but also recovering ellided information, both in form and content. There are two broad types of machine-readable source, each requiring a different strategy for recovery of implicit structure and content of dictionary entries. On the one hand tapes may consist of a character stream with no explicit structure markings (as OED and the Collins bilinguals exemplify); all of their structure is iml~li.ed in the font changes and the overall syntax ot the entry. On the other hand, sources may employ mixed r~presentation, incorporating both global record delhniters and local structure encoded in font change codes and/or special character sequences (LDOCE and Webster s Seventh).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "I",
"sec_num": null
},
{
"text": "Ideally, all MRD's should be mapped onto LDB structures of the same type, accessible with a sin-~le query language that preserves the user s intuition about tile structure of lexical data (Neff et a/., 1988; Tompa, 1986) , Dictionary entries can be naturally represented as shallov~ hierarchies with a variable number of instances of certain items at each level, e.g. multiple homographs within an entry or multiple senses within a homograph. The usual inlieritance mechanisms associated with a hierarchical orgardsation of data not only ensure compactness of representation, but also fit lexical intuitions. The figures overleaf show sample entries from CGE ,and LDOCE and their LDBforms with explicitly unfolded structure.",
"cite_spans": [
{
"start": 188,
"end": 207,
"text": "(Neff et a/., 1988;",
"ref_id": "BIBREF13"
},
{
"start": 208,
"end": 220,
"text": "Tompa, 1986)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "I",
"sec_num": null
},
{
"text": "Within the taxonomy of normal forms .(NF) defreed by relational data base theo~, dictionary entries are 'unnormalized relations in which attributes can contain other relations, rather than simple scalar values; LDB's, therefore, cannot be correctly viewed as relational data bases (see Neff et al., 1988) . et al., 1986) . Our LDB rmat and Lexical Query l_anguage (LQL) support the hierarchical model for dictionary data; the output of the .parser, similar to the examples in Figure 3 and Figure 4 , is compacted, encoded, and loaded into an LDB. ",
"cite_spans": [
{
"start": 286,
"end": 304,
"text": "Neff et al., 1988)",
"ref_id": "BIBREF13"
},
{
"start": 307,
"end": 320,
"text": "et al., 1986)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 476,
"end": 484,
"text": "Figure 3",
"ref_id": null
},
{
"start": 489,
"end": 497,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "I",
"sec_num": null
},
{
"text": "The choice of the hierarchical model for the representation of the LDB entries (and thus the output of DEP) has consequences for the parsing mechanism. For us, parsing involves determining the structure of all the data, retrieving implicit information to make it explicit, reconstructing ellided information, and filling a (recursive) template, without any data loss. This contrasts with a strategy that fills slots in predefmed (and finite) sets of records for a relational system, often discarding information that does not fit. In order to meet these needs, the formalism for dictionary entry grammars must meet at least three criteria, in addition to being simply a notational device capable of describing any particular dictionary format. Below we outline the basic requirements for such a formalism.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DEP GRAMMAR FORMALISM",
"sec_num": "3."
},
{
"text": "The graham,_ .~ formalism should be capable of handling mildly context sensitive' input streams, as structurally identical items may have widely differing functions depending on both local and global contexts. For example, parts of speech, field labels, paraphrases of cultural items, and many other dictionary fragments all appear in the CEG in italics, but their context defines their identity and, consequently, their interpretation. Thus, in the example entry in Figure 3 above, m, (also Sport), (of chapter), and (spec) acquire the very different labels of pos, do, in, us=g=_not=, and sty1.=. In addition, to distin-t~ish between domain labels, style labels, dialect els, and usage notes, the rules must be able to test candidate elements against a closed set of items. Situations like this, involving subsidiary application of auxiliary procedures (e.g. string matching, or dictionary lookup required for an example below), require that the rules be allowed to selectively invoke external functions. The assignment of labels discussed above is based on what we will refer to in the rest of this paper asglobal context. In procedural terms, this is defined as the expectations of a particular grammar fragment, reflected in the names of the assodated rides, which will be activated on a given pare through the grammar. Global context is a dynamic notion, best thought of as a 'snapshot' of the state of the parser at any_ point of processing an entry. In contrast, local context is defined by finite-length patterns of input tokens, ,arid has the effect of Identifying typographic 'clues to the structure of an entry. Finally, immediate context reflects v.ery loc~ character patte12as which tend t 9 drive the initial segmentatmn ot the 'raw' tape character stream and its fragmentation into structure-and information-carrying tokens. These three notions underlie our approach to structural analysis of dictionaries andare fundamental to the grammar formalism design.",
"cite_spans": [],
"ref_spans": [
{
"start": 467,
"end": 475,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effects of context",
"sec_num": "3.1"
},
{
"text": "The formalism should allow operations on the (partial) structures delivered during parsing, and not as.separate tree transtormations once processing is complete. This is needed, for instance, in order to handle a variety of scoping phenomena (discussed in section 5 below), factor out items common to more than one fragment within the same entry, and duplicate (sub-)trees as complete LDB representatmns ~ being fleshed out. Consider the CEG entry for abutment\":",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure manipulation",
"sec_num": "3.2"
},
{
"text": "I abutment [.,.] n (Archit) Fltigel-or Wangenmauer f. I",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure manipulation",
"sec_num": "3.2"
},
{
"text": "Here, as well as in \"title\" (Figure 3 ), a copy of the gender marker common to both translatmns needs to migrate back to the ftrst tram. In addition, a copy of the common second compound element -mauer also needs to migrate (note that identifying this needs a separate noun compound parser augmented with dictionary lookup). An example of structure duplication is illustrated by our treatment of (implicit) cross-references in LDOCE, where a link between two closely related words is indicated by having one of {hem typeset in small capitals embedded in, a definition of the other (e.g. \"PEST' and \"TIP' in the deftnitions of \"nuisance\" in Figure 4 ). The dual purpose such words serve requires them to appear on at least two different nodes in the final LDB structure: \u00a2~f_string and implicit_xrf. In order to perform the required transformations, the formalism must provide an explicit dle on partial structures, as they are being built by the parser, together with operations which can mariipulate them --both in terms of structure decomposition and node migration. In general, the formalism must be able to deal witli discontinuous constituents, a problem not dissimilar to the problems of discontinuous constituents in natural language parsing; however in dictionaries like the ones we discuss the phenomena seem less regular (if discontinuous constituents can be regarded as regular at all).",
"cite_spans": [],
"ref_spans": [
{
"start": 28,
"end": 37,
"text": "(Figure 3",
"ref_id": null
},
{
"start": 640,
"end": 648,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Structure manipulation",
"sec_num": "3.2"
},
{
"text": "The nature of the information contained in dictionaxies is such that certain fields within entries do not use any conventions or formal systems to present their data. For instance, the \"USAGE\" notes in LDOCE can be arbitrarily complex and unstructured. . fragments, .c\u00b0mbining straaght text with a vanety of notattonal devices (e.g. font changes, item highlighting and notes segmentation) in such a way that no principled structure may be imposed on them. Consider, for example, the annotation of \"loan\":",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graceful failure",
"sec_num": "3.3"
},
{
"text": "loan 2 v ........ esp.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graceful failure",
"sec_num": "3.3"
},
{
"text": "AmE to give (someone) the use of, lend ........ USAGE It is perfectly good AmE to use loan in the meamng of lend: He loaned me ten dollars. The word is often used m BrE, esp. in the meaning 'to lend formally for a long period':",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graceful failure",
"sec_num": "3.3"
},
{
"text": "He loaned h/s collection of pictures to the public GALLERY but many people do not like it to be used simply in the meaning of lend in BrE...",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graceful failure",
"sec_num": "3.3"
},
{
"text": "Notwithstanding its complexity, we would still like to be able to process the complete entry, recovering as much as we can from the regularly encoded information and only 'skipping' over its truly unparseable fragment(s). Consequently, the formalism and the underlying processing flame-work should incorporate a suitable mechanism for explicitly handling such data, systematically occumng in dictionaries. The notion of .graceful failure is, in fact, best regarded as 'seledive parsing'. Such a mechanism has the additional benefit of allowing the incremental development of dictionary grammars with (eventually) complete coverage, and arbit .r-~.ry depth of analysis, of the source data: a particular grammar might choose, for instance, to treat everything but the headword, part of speech, and pronunciation as 'junk', and concentrate on elaborate parsing of the pron.u:n, ciation fields, while still being able to accept all input without having to assign any structure to most of it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graceful failure",
"sec_num": "3.3"
},
{
"text": "DEP uses as input a collection of 'raw' typesetting images of entries from a dictionary 0.e. a typesetting .tape. with begin-end' boundaries of entries explicitly marked) and, by consulting an externally supplied .gr-qmmar s.p~.\" c for that particular dictionary, produces explicit structural representations for the individual entries, which are either displayed or loaded into an LDB. The system consists of a rule compiler, a parsing nDg~Be, a dictionary entry template generator, an loader, and various development facilities, all in a PROLOG shell. User-written PROLOG functions and primitives are easily added to the system. The fdrmalism and rule compiler use the Modular Logic Grammars of McCo/'d (1987) as a point of d~ure, but they have been substantially modified and extended to reflect the requirements of parsing dictionary entries. The compiler accepts three different kinds of rules corresponding to the three phases of dictionary entry analysis: tokenization, retokenization, and",
"cite_spans": [
{
"start": 697,
"end": 711,
"text": "McCo/'d (1987)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "OVERVIEW OF DEP",
"sec_num": "4."
},
{
"text": "proper. Below we present informally ghts of the grammar formalism.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OVERVIEW OF DEP",
"sec_num": "4."
},
{
"text": "Unlike in sentence parsing, where tokenization (or lexical analysis) is driven entirely by blanks and punctuation, the DEP grammar writer explicitly defines token delimiters and token substitutions. Tokenixation rules specify a one-to-one mapping from a character substring to a rewrite token; the mapping is applied whenever the specified substring is encountered in the original typesetting tape character stream, and is only sensitive to immediate context. Delimiters are usually font change codes and other special characters or symbols; substitutions axe atoms (e.g. or structured terms be.g. fmtl italic l, ~! \"1\" I).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": "Tokenization reaks the source character stream into a mixture of tokens and strings; the former embody the notational conventions employed by the printed dictionary, and are used by tlae parser to assign structure to an entry; the latter carry the textual (lexical) content of the dictionary. Some sample rules for the LDOCE machine-readable source, marking the beginning and end of font changes, or making explicit special print symbols, are shown below (to facilitate readability, (*AS) represents the hexadecimal symbol x'AS').",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": "dolim( \"(~i)\", font( i~alic } ). dolia( \"(UCA)\", font( beginl samll_caps ) I ). dolim(II{~mS) ii f~r~t ( end( small_caps ) ) ). dolim!\"(~)\", ital correction). delill( \"OqlO)\", hyl~in_mark ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": "Immediate context, as well as local string rewrite, \" can be specified by more elaborate tokenization rules, in which two additional arguments specify strings to be 'glued' to the strings on the left and right of the token delimiter, respectively. For CEG, for instance, we have dotiml\". >u4<\", f~t;~l;)>~).<\u00b0'). delim( \":>u~<\", delim( \">uS<\", font( roman ) ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": "Tokenization opeEates recursively on the string fragments formed by an active rule; thus, applicatton of the first two rules above to the stnng ,,mo~. :~a,: ~r~\" results in the following token list: \"xxx\" . lad . fontlbold)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": ", \"y~\u00a2\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokenization",
"sec_num": "4.1"
},
{
"text": "Longer_-range (but still local) context sensitivity~ is irfiplemented via retokenization, the effect ot which is the 'normalization' of the token list.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Retokenization rules conform to a general rewrite format --a pattern on the left-hand side defines a context as a sequence of (explicit or variable place holder) tokens, in which the token list should be adlusted as indicated by the right-hand side --and can be used to .perform a range of cleaning up tasks before parsing proper.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Streamlining the token list. Tokens without information-or structure-bearing content; such as associated with the codes for fialic correction or thin space, are removed:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "ital correction : ,Seg <:> \u00f7Seg.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Superfluous font control characters can be simply deleted, when they follow or precede certain data-can'ying tokens which also incorporate typesetting information (such as a homogra.ph superscript symbol or a pronunciation marker indicating the be~finning of the scope of a phonetic font):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "rk font! phonetic ) < \u2022 rk. supl N) < \u2022 R",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "(Re)adjusting the token list. New tokens can be introduced in place of certain token sequences:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "bra : fonttitalic) <=> beginlrestric~ion). f~'tt(r~m~'t) : ket < \u2022 ~wl(r~stricti~'b).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Reconstruction of string segments. Where the initial (blind) tokenization has produced spurious lragraentation, string sewnents can be suitably reconstructed. For instance, a hyphen-delimited sequence of syllables in place of the print form of a headword, created by tokeni~ation on ~,-rg), can be 'glued' back as follows: This rule demonstrates a characteristic property. of the DEP formalism, discussed in more detail later: arbitrary Prolog predicates can be invoked to e.g. constrain rule application or manipulate strings. Thus, the rule oialy applies to string tokens surrounding a hyphen character; it manufactures, by string concatenation, a new segment which replaces the triggering pattern.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Further segmentation. Often strings need to be split, with new tokens inserted between the pseces, to correct infelicities in the tapes, or to insert markers between recognizably distinct contiguous segments that appear in the same font. The rule below implements the CGE/CEG convention that a swung dash is an implicit switch to bold if the current font is not bold already. Dealing with irregular input. Rules that rearrange tokens are o~ten needed to correct errors in the tapes. In CEG/CGE, parentheses surrounding italic items often appear (erroneously) in a roman font. A suite ofiaxles detaches the stray parentheses from the surrounding tokens, moves them around the font marker, and glues them to the item to which they belong.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "+E : $strir~piE) : t\u00a2oncat(\") \"~E1,EI <=> t0 )n-: +El. /* detach */ font(F) : \")\" < \u2022",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "., ),o :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": ": retoKen( font( F ) ). /* move */ +E : Sstrirtgl=iE)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": ": \")\" : toc~:at(E,\")\"~E1} <:> \u00f7El. /~ gluo */ eot~um invokes retokenization recursively on the sublist beginning with fontt e) and including all tokens to its right. In p \"nneiple, the three rules can be subsumed by a single one; in practice, separate rules also 'catch' other types of erroneous or nots), input.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Although retokenization is conceptually a separate process, it is interleaved in practice with tokemzation, bringing imp .rovements in performance. Upon completion, the tape stream corresponding, for instance, to the LDOCE entry non-trivial manipulation of (partial) trees, as implicit and/or ellided information packed in the bntries is being recovered and reor-gaxxized. Parsing is a top-down depth-first operation, and only the first successful parse is used. This strategy, augmented by a 'junk collection' mechanism (discussed below) to recover from parsing failures, turns out to be adequate for handling all of the phenomena encountered while assigning structural descriptions to dictionary entries. Dictionary grammars follow the basic notational conventions of logic grammars; .however, we use additional operators tailored to the structure manipulation requirements of dictionary parsing. In pLrticular, the right-hand side of grammar rules admits the use of-four different types ot operators, designed to deal with token list consumption, token list manipulation, structure assignment, and (local) tree transformations. These operators suitably modify the expansions of grammar rules; ultimately, all rules are compiled into Prolog.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Token consumption. Tokens axe removed from the token list by the + andoperators; + also assigns them as terminal nodes under the head of the invoking rule. Typically, delimiters introduced by tokenization (and retokenization) are removed once they serve their primary function of identifying local context; string segments of the token list are assigned labels and migrate to appropriate places in the final structural represeniation ot an entry. A simple rule for the part of speech fields in CEG (Figure 3 ) would be:",
"cite_spans": [],
"ref_spans": [
{
"start": 498,
"end": 507,
"text": "(Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "los ::>-fzntl italic) = +Sag.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "A structured term stpos, \"n\".nil) is built as a result of the rule consuming, for instance, the token \"n\", Rule names are associated with attributes in the LDB representation for a dictionary entry; structures built by rules are pairs of the",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "form sire, Vii=l,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "where velt~ is a list of one or more elements (strings or further structures 'returned' by reeunively invoked rules). \"autistic\" \"au-tis-tic\" \"C : \"tlstlk\" -adp 0 \"0000\" \"suffering from\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "\"a~ut i~a#' \"amtisti\u00a2 ahild/be~viour\" \"01\" Token list manipulation. Adjustment of the token list may be required in, for instance, simple cases of recovering ellided information or reordering tokens in the input stream. This is achieved by the tm and ir~x operators, which respectively insert single, or sequences of, tokens into the token list at the current position; and the ++ operator, which inserts tokens (or arbitrary tree fragments) directly into the structure under construction. Assuming a global variable, .rod, bound to the headword of the current entry, and the ability to invoke a Prolog string concatenation tunction trom within a rule (~a the * operator; see below), abbreviated morphological derivations stored as run-ons might be recovered ~l~ e ltlqc~r in~doriv |",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": ". \"autisti(ally\" by: ! doriv ) . fld_sep . \"adv\" Parsing proper makes use of unification and backtrracking to handle identification of segments (i tin is separately defined to test for membership by context, and is heavily augmented with some of a closed class of suffixes.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Structure assignment. The ++ operator can only assign arbitrary structures directly to the node in the tree which is currently under construction. A more general mechanism for retaining structures for future use is provided by allowing variables to be (optionally) associated with grammar rules: in this way the grammar writer can obtain an explicit handle on tree fragments, in contrast to tlae default situation where each rule implicitly 'returns' the structure it constructs to its caller. The following rule, for example, provides a skeleton treatment to the situation exemplified in Figure 4 , where a definition-initial substring is common to more than one sub-definition: The defs rule removes the defmition-irtitial string segment and passes: it on to the repeatedly invoked ~s. This manufactures the complete definition string by concatenating the common initial segment, available as an argument instantiated two levels higher, with the continuation string specific to any given sub-definition.",
"cite_spans": [],
"ref_spans": [
{
"start": 589,
"end": 597,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "dofs = \u2022 (Sag) : s stjxkafs(X) ==> subdof(X) : opt(subdofs(X)). subdof(X) ==>-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Tree transformations. The ability to refer, by name, to fragments of the tree being constructed by an active grammar rule, allows arbitrary tree transformations using the complementary operators -z. and +~.. They can only be applied to non-terminal grammar rules, and require the explicit specification of a place-holder variable as a rule argument; this is bound to the structure constructed by the rule. The effect of these operators on the tree fragments constructed by the rules they modify is to prevent their incorporation into the local tree (in the case of -z), to explicitly splice it in (in the case of \u00f7z), or simply to capture it (z). The use of this mechanism in conjunction with the structure naming facility allows both permanent deletion of nodes, as well as their practically unconstrained migration between, and within, different levels of grammar (thus implementing node raising and reordering). It is also possible to write a rule which builds no structure (the utility of such rules, in particular for controlling token consumption and junk collection, is discussed in section 5). Node-raising is illustrated by the grammar fragment below, which might be used to deal with certain collocation phenomena. Sometimes dictionaries choose to explain a word in the course of defining .another related word by arbitrarily insetting mm~-entnes in their defmitmns: lach.ry.mal 'l~kfimal adj [Wa51 of or concerning tears of the organ (lach~mai gland/'_ ./) of the body that produces them",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "The potentially complex structure associated with the embedded entry specification does not belong to the definition string, and should be factored out as a separate node moved to a higher level of the tree, or even used to create a new tree entirely. The rule for parsi.n.g the definition fields of an entry makes a provmon for embedded entries; the structure built as an ~ entry is bound to the str,ac argument in the aofn rule. The -z operator prevents the ~_entry node from being incorporated as a daughter to ae~n: however, by finification, it beghas its ,mi',gr, ation 'upwards' through the tree, till it is 'caught by the entry rule several levels ~gher and inserted (via \u2022 x) in its logically appropnate place. Capturing generalizations / execution control.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "The expressive power of the system is further enhanced by allowing optionality (via the opt operator), alternations (I) and conditional constructs in the gra'--:nar rules; the latter are useful both for more co~:::,.,ct rule specification and to control backtracking while parsing. Rule application may be constrained by arbitrary tests (revoked, as Prolog predicates, via a t operator), and a string operator is available for sampling local context. The mechanism of escaping to Prolog, the motivation for which we discuss below, can also be invoked when arbitrary manipulation of lexical data --ranging from e.g. simple string processing to complex morphological analysis --Is required during parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Tree structures. Additional control over the shape of dictionary\" entry trees is provided by having two types of non-terminal nodes: weak and strong ones. The difference is in the explicit presence or absence of nodes, corresponding to the rule names, in the final tree: a structure fragment manufactu~d by a weak non-terminal is effectively spliced into the higher level structure, without an intermediate level of naming. One common use of such a device is the 'flattening' of branching constructions, typically built by recursive rules: the declaration str~;,-,~_nonterminals ( clefs . subde\u00a2 . nil 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "when applied to the sub-definitions fragment above, would lead to the creation of a group of sister ~f nodes, immediately dominated bv a aefs node. Another use of the distinction bewcteen weak and strong non-terminals is the efive mapping from typographically identical entry segments to appropriately named structure fragments, with global context driving the name assignment. Thus, assuming a weak label rule which captures the label string for further testing, analysis of the example labels discussed in 3.1 could be achieved as follows (also see Figure 3 ): ",
"cite_spans": [],
"ref_spans": [
{
"start": 551,
"end": 559,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "~o~en ==> labeltX} i ,i,,X, ~_!ab). ==> label(X } Sisal X, lab]. dial = \u2022 labellX} $isalX, dial-lab). usagenote ==> labellX).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Such a mechanism captures g~aeralities in typograp~tc conventions employed across any",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "given dictionary, and yet preserves the distinct, name spaces required for a meaningful unfolding of a dictionary entry structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retokenization",
"sec_num": "4.2"
},
{
"text": "Below we describe some typical phenomena encountered in the dictionaries we have parsed and discuss their treatment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "RANGE OF PHENOMENA TO HANDLE",
"sec_num": "5."
},
{
"text": "The unsystematic encoding of font changes before, as well as after, punctuation marks (commas, semicolons, parentheses) causes blind tokenization to remove punctuation marks from the data to which they are visually and conceptually attached. As already discussed (see 4.2), most errors of this nature can be corrected by retokenization. Similarly, the confusing effects of another pervasive error, namely the occurrence of consecuti, e font changes, can be avoided by having a retokenization rule simply remove all but the last one. In general, context sensitivity is handled by (re)adjusting the token list; retokenization, however, is only sensitive to local context. Since global context cannot be determined unequivob.ally till parsing, the grammar writer is given complete control over the consumption and addition of tokens as parsing proceeds from left to right --this allows for motivated recovery of ellisions, as well as discarding of tokens in local transformations. For instance, spurious occurrences of a font marker before a print symbol such as an opening parenthesis, which is not affected by a font dec-' laration, clearly cannot be removed by a retokenization rule font! roman] : bra <=> bra.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Messy token lists: controlling token consumption",
"sec_num": "5.1"
},
{
"text": "(The marker may be genuinely closing a font segment prior to a different entry fragment which commences with, e.g., a left parenthesis). Instead, a grammar rule anticipating a br~ token within its scope can readiust the token list using either of: (The $*ri-e operator tests for a token list with br~ as its first element.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Messy token lists: controlling token consumption",
"sec_num": "5.1"
},
{
"text": "The Peter-1 principle: scoping phenomena Consider the entry for \"Bankrott\" in Figure 2 . Translations sharing the label (fig) (\"breakdown, collapse ') are grOUl>ed together ~6ith commas and separated from other lists with semicolons. The restnctlon (context or label) precedes the llst and can be said to scope 'right' to the next semicolon. We place the righ-t-scoping labels or context under the (semicolon-delimited) t~,n_group as sister nodes to the multiple (comma-delimited) tr--~ nodes (see also the representation of \"title\" in Figure 3 ). Two principles ate at work here: meiintaining implicit e~dence of synonymy among terms in the target langtmge responds to the \"do not discard anything\" philosophy; placing common data items as high as possible in the tree (the 'Peter-minus-1 princaple') is in the spirit of Flickinger et al. (1985) , and implements the notion of placing a t~al node at the hi~. est position hi tlae tree wlaere its value is valid in combination with the values at or below its sister nodes. The latter principle also motivates sets of rules like ~rm~ ==> \"'\" pr~n ... : homograph ....",
"cite_spans": [
{
"start": 822,
"end": 846,
"text": "Flickinger et al. (1985)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [
{
"start": 78,
"end": 86,
"text": "Figure 2",
"ref_id": null
},
{
"start": 536,
"end": 544,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "5.2",
"sec_num": null
},
{
"text": "used to account for entries in English where the pronunciation differs for different homographs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "==> pratt",
"sec_num": null
},
{
"text": "Some compaction or notational conventions in dictionaries require a mechanism for a rule to re,member (part of) its ancestry or know its sister s descendants. Consider the l~roblem of determining the scope of gender or labels immediately following variants of the headword:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tribal memory: rule variables",
"sec_num": "5.3"
},
{
"text": "Advolmturbfiro nt (Sw), Advokaturskanzlei f ( Aus) lawyer's offize. Tippfr~ein nt ( lnf), ~ppse f -, -n ( pej ) typist. Alchemic ( esp Aus) , Akhimief alchemy.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tribal memory: rule variables",
"sec_num": "5.3"
},
{
"text": "The first two entries show forms differing, respectively, in dialect and gender, and register and gender. The third illustrates other combinations. The rule accounting for labels after a variant must know whether items of like type have already been found after the hcadword, since items before the variant belong to the headword, different items of identical type following both belong in.-dividuaUy, and all the rest are common to botla. This 'tribal' memory is implemented using rule variables: In addition to enforcing rule constraints via unification, rule arguments also act as 'channels' for node raising and as a mcchanisrn for controlling rule behaviour depending on invocation context. This latter need stems from a pervasive phenomenon in dictionaries: the notational conventions for a logical unit within an entry persist across different contexts, and the sub-grammar for such a unit should be aware of the environment it is activated in. Implicit cross-references in LDOCE are consistently introduced by fontl stall csos ], independent of whether the runnin 8 text is a defmiuon (roman font), example (italic), or an era-bedded phrase or idiom (bold); by enforcing the return to the font active before the invocation of iaq)iioit=xrf, we allow the analysis of crossreferences to be shared: ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tribal memory: rule variables",
"sec_num": "5.3"
},
{
"text": "implicit xrft X) ==> -",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tribal memory: rule variables",
"sec_num": "5.3"
},
{
"text": "The whole range of phenomena requiring explicit manipulation of entry fragment trees is handled by the mechanisms for node raising, reordering, and deletion. Our analysis of implicit crossreferences in LDOCE factors them out as separate structural units participatingin the make-up of a word sense definition, as well as reconstructs a 'text image' of the definition text, with just the orthography of the cross-reference item 'spliced in' (see Figure 4 ). The rules build a definition string from any sequence of substrings or lexical items used as cross-references: by invoking the appropriate de\u00a2_nusmat rule, the simple segments are retained only for splicing the complete definition text; cross-reference pointers are extracted from the structural representation of an implicit erossreference; and itmlicit._xef nodes are propagated up to a sister position to the dab_string. The string image is built incrementally (by string concatenation, as the individual a-\u00a2_nutmts are parsed); ultim, ately the ~\u00a2_strir~ rule simply incorporates tt into the structure for ae~. Declaring darn, def string and implicit_xrf to be strong non-terminals ultimately results in a dean structure similar to the one illustrated in Figure 4 . Copying and lateral migration of common gender labels in CEG translations, exemplified by title' (Figure 3 ) and \"abutment\" (section 3.2), makes a differ r-ent use of the \u00a2z operator. To capture the leftward scope of gender labels, in contrast to common (right-scoping) context labels, we create, for each noun translatton (tran), a gender node with an empty value. The comma-delimited *ran nodes are collected by a recursive weak nonterminal *fans rule. The (conditional) removal of gander\" in the second rule followed by (obligatory) insertion of a ~ne~r node captures the gender if present and 'digs a hole' for it if absent. Unification on the last iteration of tear~ fills the holes. Noun compound fragments, as in \"abutment\" can be copied and migrated forward or backward using the same mechknism. Since we have not implemented the noun compound parsing mechamsm required for identification of segments to be copied, we have temporized by naming the fragments needing partners alt_.=\u00a2x or alt_sex.",
"cite_spans": [],
"ref_spans": [
{
"start": 445,
"end": 453,
"text": "Figure 4",
"ref_id": null
},
{
"start": 1216,
"end": 1224,
"text": "Figure 4",
"ref_id": null
},
{
"start": 1324,
"end": 1333,
"text": "(Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Unpacking, duplication and movement of structures: node migration",
"sec_num": "5.4"
},
{
"text": "unpacking We have implemented a mechanism to allow creation of additional entries out of a single one, for example from orthographic, dialect, or morphological variants of the original headword. Some CGE examples were given in sections 2 and 5.3 above. To handle these, the rules build the second entry inside the main one and manufacture cross reference information for both main form and variant, in anticipation of the implementation of a splitting mechanism. Examples of other types appear in both CGE and CEG: The conventions for morphological vari,'ants, used heavily in e.g. LDOCE and Webster s Seventh, are different and would require a different mechanism. We have not yet developed a generalized rule mechanism for ordering any kind of split; indeed we do not know if it ts possible, given the wide variation ~, seemingly aa hoc conventions for 'sneaking in logically separate entries into related headword definitions: the case of \"lachrymal gland\" in 4.3 is iust one instance of this phenomena; below we list some more conceptually similar, but notationally different, examples, demonstrating the embedding of homographs in the variant, run-on, word-sense and example fields of LDOCE. 5.6 Notational promiscuity: selective tokenization Often distinctly different data items appear contiguous in the same font: the grammar codes of LDOCE (section 2) are just one example. Such run-together segments clearly need their own tokenization rules, which can only be applied when they are located during parsing. Thus, commas and parentheses take on special meaning in the string \"X(to be)l,7\", indicating, respectively, ellision of data and optionality of p~ase. This is a different interpretation from e.g. alternation (consider the meaning of \"adj, noun\")or the enclosing of italic labels m parentheses (Figure 3) . Submission of a string token to further tokemzation is best done by revoking a special purpose pattern matching module; thus we avoid global (and blind) tokenization on common (and ambiguous) characters such as punctuation marks. The functionality required for selective tokenization is provided'by a ~e primitive; below we demonstrate the construction of a list of sister synca* nodes from a segment like \"n, v, adj\", repetitively invoking oa)-~a) to break a string into two substrings separated by a comma: ",
"cite_spans": [],
"ref_spans": [
{
"start": 1810,
"end": 1820,
"text": "(Figure 3)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Conflated lexical entries: homograph",
"sec_num": "5.5"
},
{
"text": "The systematic irregularity of dictionary data (see section 3.3) is only one problem when parsing dictionary entries. Parsing failures in general are common during .gr-,~maar development; more specifically, they tmght arise due to the format of an entry segment being beyond (easy) capturing within the grammar formalism, or requiring nontrivial external functionality (such as compound word parsing or noun/verb phrase analysis). Typically, external procedures o~. rate on a newly constructed string token which represents a 'packed' unruly token list. AlternaUvely, if no format need be assigned to the input, the graxn.mar should be able to 'skip over' the tokens m the list, collecting them under a 'junk' node. If data loss is not an issue for a specific application, there is no need even to collect tokens from irregular token lists; a simple rule to skip over USAGE fields might be wntten as usacje ==> -usage nmrk : use field. use field ==> -U ToKen : Snotiee~d ufield} : opt( use_f ield ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parsing failures: junk collection",
"sec_num": "5.7"
},
{
"text": "-(Rules like these, building no structure, are especially convenient when extensive reorganizatmn of tile token list is required --typically in cases of grammar-driven token reordering or token deletion without token consumption.) In order to achieve skipping over unparseable input without data loss, we have implemented a ootleztive rule class. The structure built by such rules the (transitive) concatenation of all the character strings in daughter segments. Coping with gross irregularities is achieved by picking up any number of tokens and 'packing' them to-ther. This strategy is illustrated by a grammar phrases conjoined with italic 'or' in example sentences and/or their translations (see Figure 3) . The italic conjunction is surrounded by slashes in the resulting collected string as an audit trail. The extra argument to e~n$ ehforces, following the strategy outlined in section 5.3, rule application only m the correct font context. 4,\"Or\" ~ ++\"/ \" -font I X ) +Seg.",
"cite_spans": [],
"ref_spans": [
{
"start": 700,
"end": 709,
"text": "Figure 3)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Parsing failures: junk collection",
"sec_num": "5.7"
},
{
"text": "Finally, for the most complex cases of truly irregular input, a mechanism exists for constraining juiak collection to operate only as a last resort and only at the point at which parsing can go no further.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parsing failures: junk collection",
"sec_num": "5.7"
},
{
"text": "5.8 Augmenting the power of the formalism: escape to Prolog Several of the mechanisms described above, such as contextual control of token consumption (section 5.1), explicit structure handling (5.4), or selective toke/fization (5.6), are implemented as \u2022 separate Prolo~z modules. Invoking such extemai functionality from the grammar rules allows the natural integration of the form-and contentrecovery procedures into the top-down process of dictionary entry analysis. The utility of this device should be clear from the examples so far. Such escape to the underlying implementation language goes against the grain of recent developments of declarative gran3m_ ar formalisms. (the procedural ramifications of, for instance, being able to call arbitrary LISP functions from the arcs of an ATN grammar have been discussed at length: see, for instance, the opening chapters in Whitelock et al., 1987) . However, we feel justified in augmenting, the ..... formalism in such a way, as we are dealing with input which Is different m nature from, and on occasions possibly more complex than, straight natural language. Unhomogeneous mixtures of heavily formal notations and annotations in totally free format, interspersed with (occasionally incomplete) fragments of natural language phrases, can easily defeat any attempts at 'cleafi' parsing. Since the DEP system is designed to deal with an open-ended set of dictionaries, it must be able to corffront a similarly open-ended set of notational conventions and abbreviatory devices. Furthermore. dealing in full with some of these notations requires access to mechanisms and theories well beyond the power of any grammar formalism: consider, for stance, what is involved in analyzing pronunciation fields in a dictionary, where alternative pronunciation patterns are marked only for syllable(s) which differ from the primar3 ~ pronuncaation (as in arch.bish.op: /,a:tfbiDp II ,at-/); where the pronunciation string itself ts not marked for syllable structure; and where the assignment of syllable boundaries is far from trivial (as in fas.cist: /'f=ej'a,st/)! 6. CURRENT STATUS The run-time environment of DEP includes gr .ammar debugging utilities, and a number of opttons. All facilities have been implemented, except where noted. We have very detailed grammars for CGE (parsing 98% of the entries), CEG (95%), and LDOCE (93%); less detailed grammars for Webster s Seventh (98%), and both laalves of the Collins French Dictionary (approximately 90%). The Dictionary Entry Parser is an integra.1, part of a larger system designed to recover dictionary structure to an arbitrary depth of detail, convert the resulting trees into LDB records, and make the data av/tilable to end users via a flexible and powerful lexical query language (LQL). Indeed, we have built LDB's for all dictionaries we have parsed; further development of LQL and the exploitation of the LDB's via query for a number of lexical studies are separate projects. Finally, we note that, in the light of recent efforts to develop an interchange standard for (English mono-lingual) dictionaries (Amsler and Tompa, 1988) , DEP acquires additional relevance, since it can be used, given a suitable annotation of the grammar rules for the machine-readable source, to transduce a typesetting tape into an interchangeable dictionary source, available to a larger user commumty.",
"cite_spans": [
{
"start": 876,
"end": 899,
"text": "Whitelock et al., 1987)",
"ref_id": null
},
{
"start": 3108,
"end": 3132,
"text": "(Amsler and Tompa, 1988)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parsing failures: junk collection",
"sec_num": "5.7"
},
{
"text": ".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ACILNOWLEDGEMENTS",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Roy Byrd, Judith Klavans and Beth Levin for many discussions concerning the Dictionary Entry Parser system in general, and this paper in particular. Any remaining errors are ours, and ours only.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "acknowledgement",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Building a Lexical Database by Parsing ebster's Seventh New Collegiate Dictionary '~, Advances in Lexicology, Second Annual Conference of the UW Centre for the New Oxford English Dictionary",
"authors": [
{
"first": "T",
"middle": [],
"last": "Ahlswede",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Evens",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Rossi",
"suffix": ""
},
{
"first": "W1986",
"middle": [],
"last": "Markowitz",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "65--78",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ahlswede, T, M Evens, K Rossi and J Markowitz W1986) \"Building a Lexical Database by Parsing ebster's Seventh New Collegiate Dictionary '~, Advances in Lexicology, Second Annual Confer- ence of the UW Centre for the New Oxford English Dictionary, 65-78.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "An SGML-Based Standard for English Monolingual Dictionaries",
"authors": [
{
"first": "R",
"middle": [],
"last": "Amsler",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Tompa",
"suffix": ""
}
],
"year": 1988,
"venue": "Fourth Annual Conference of the L'W Centre for the New Oxford English Dictionary",
"volume": "",
"issue": "",
"pages": "61--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Amsler, R and F Tompa (1988) \"An SGML-Based Standard for English Monolingual Dictionaries\", Information in Text, Fourth An- nual Conference of the L'W Centre for the New Oxford English Dictionary, 61-79.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Computational Lexicography for Natural Language Processing",
"authors": [
{
"first": "B",
"middle": [],
"last": "Boguraev",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Briscoe",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Boguraev, B, and E Briscoe (Eds) (1989) Com- putational Lexicography for Natural Language Processing, Longman, Harlow.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Tools and Methods for Computational Lexicology",
"authors": [
{
"first": "R",
"middle": [],
"last": "~yrd",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Calzolari",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Chodorow",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Klavans",
"suffix": ""
},
{
"first": "O",
"middle": [],
"last": "Neff",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rizk",
"suffix": ""
}
],
"year": 1987,
"venue": "Computational Linguistics",
"volume": "13",
"issue": "3 -4",
"pages": "219--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "~yrd, R, N Calzolari, M Chodorow, J Klavans, Neff and O Rizk (1987) \"Tools and Methods for Computational Lexicology\", Computational Linguistics, vol. 13(3 -4), 219 -240.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A Project for a Bilingual Lexical Database System",
"authors": [
{
"first": "N",
"middle": [],
"last": "Calzolari~",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Picchi",
"suffix": ""
}
],
"year": 1986,
"venue": "Advances in Lexicology, Second ~ual Conference of the L.'W Centre for the New Oxford English Dictionary",
"volume": "",
"issue": "",
"pages": "79--92",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Calzolari~ N and E Picchi (1986) \"A Project for a Bilingual Lexical Database System\", Advances in Lexicology, Second ~ual Conference of the L.'W Centre for the New Oxford English Dic- tionary, 79-92.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Acquisition of Semantic Information from an On-Line Dictionary",
"authors": [
{
"first": "N",
"middle": [],
"last": "Calzolari",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Picchi",
"suffix": ""
}
],
"year": 1988,
"venue": "Proceedings of the 12th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "87--92",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Calzolari, N and E Picchi (1988) \"Acquisition of Semantic Information from an On-Line Dictionary.\", Proceedings of the 12th Interna- tional Conference on Computational Linguistics, 87-92.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A DBMS Prototype to Support Extended NF2 Relations: An ~tegrated View on Flat Tables and Hierarchies",
"authors": [
{
"first": "; Ii Nuovo Dizionario Italiano",
"middle": [],
"last": "Gaxzanti",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Garzanti",
"suffix": ""
},
{
"first": "Milano",
"middle": [],
"last": "Garzanti",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Longman ; London",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Dadam",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kuespert",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Andersen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Blanken",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Erbe",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Guenauer",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Lure",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Pistor",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Walsh",
"suffix": ""
}
],
"year": 1978,
"venue": "Proceedings of A CM SIGMOD'86: International Conference on Management of Data",
"volume": "",
"issue": "",
"pages": "356--367",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gaxzanti (1984) II Nuovo Dizionario Italiano Garzanti, Garzanti, Milano. Longman (1978) Longman Dictionary of Con- temporary English, Longman Group, London. Dadam, P, K Kuespert, F Andersen, H Blanken, R Erbe, J Guenauer, V Lure, P Pistor and G Walsh (1986) \"A DBMS Prototype to Support Extended NF2 Relations: An ~tegrated View on Flat Tables and Hierarchies, Proceedings of A CM SIGMOD'86: International Conference on Management of Data, 356-367.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Structure Sharing in Lexical Representation",
"authors": [
{
"first": "D",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Pollard",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wasow",
"suffix": ""
}
],
"year": 1985,
"venue": "Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "262--267",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Flickinger, D, C Pollard, T Wasow (1985) \"Structure Sharing in Lexical Representation\", Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, 262-267.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Building a Large Thesaurus for Information Retrieval",
"authors": [
{
"first": "E",
"middle": [],
"last": "Fox",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Nutter",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Alhswede",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Evens",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Markowitz",
"suffix": ""
}
],
"year": 1988,
"venue": "Proceedings of the Second Conference on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "101--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fox, E, T Nutter, T Alhswede, M Evens and J Markowitz (1988) \"Building a Large Thesaurus for Information Retrieval\", Proceedings of the Second Conference on Applied Natural Language Processing, 101 -108.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Structuring the Text of the Oxford Engl!s,h Dictionary through Finite State Transduction",
"authors": [
{
"first": "R",
"middle": [],
"last": "Kazman",
"suffix": ""
}
],
"year": 1986,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kazman, R (1986) \"Structuring the Text of the Oxford Engl!s,h Dictionary through Finite State Transduction , University of Waterloo Technical Report No. TR -86-20.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Natural Language Processing and Prolog",
"authors": [
{
"first": "M",
"middle": [],
"last": "Mccord",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Walker",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Mmccord",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Sowa",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wilson",
"suffix": ""
}
],
"year": 1987,
"venue": "",
"volume": "",
"issue": "",
"pages": "291--402",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "McCord, M (1987} \"Natural Language Process- ing and Prolog\", m A Walker, MMcCord, J Sowa and W Wilson (Eds) Knowledge Systems and ' Prolog, Addison-Wesley, Waltham, Massachusetts, 291 -402.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Extraction of Semantic Information from an Ordinary English Dictionary and Its Evaluation",
"authors": [
{
"first": "J",
"middle": [],
"last": "Nakamura",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Makoto",
"suffix": ""
}
],
"year": 1988,
"venue": "Proceedings of the 12th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "459--464",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nakamura, J and Makoto N (1988) \"Extraction of Semantic Information from an Ordinary Eng- lish Dictionary and Its Evaluation\", Proceedings of the 12th International Conference on Computa- tional Linguistics, 459 -464.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Creat~g and Querying Hierarchical Lexical Data Bases",
"authors": [
{
"first": "M",
"middle": [],
"last": "Neff",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Byrd",
"suffix": ""
},
{
"first": "O",
"middle": [],
"last": "Rizk ; Van Der Steen",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1982,
"venue": "Proceedings df the Second Conference on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "49--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Neff, M, R Byrd and O Rizk (1988) \"Creat~g and Querying Hierarchical Lexical Data Bases , Proceedings df the Second Conference on Applied Natural Language Processing, 84-93. van der Steen, G J (1982) \"A Treatment of Que- ries in Large Text Corpora\", in S Johansson (Ed) Computer Corpora in English Language Research, Norwegian Computing Centre for the Humanities, Bergen, 49 -63\".",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Database Design for a Dictionary of the Future",
"authors": [
{
"first": "F",
"middle": [],
"last": "Tompa",
"suffix": ""
}
],
"year": 1967,
"venue": "Linguistic Theory and Computer Applications",
"volume": "7",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tompa, F (1986) \"'Database Design for a Dic- tionary of the Future', University of Waterloo, unpublished. W7 (1967) Webster's Seventh New Collegiate Dictionary, C.&C. Merriam Company, Springfield, Massachussetts. Whitelock, P, M Wood, H Somers, R Johnson and P Bennett (Eds) (1987) Linguistic Theory and Computer Applications, Academic Press, New York.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "(e)6, -e bankruptcy; (fig) breakdown, collapse; (moralisch) bankruptcy. ~ machen to become or go bankrupt; den -anmelden or ansagen or erld~ren to declare oneself bankrupt."
},
"FIGREF1": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "Figure 2. Definition-final common fragment"
},
"FIGREF2": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "Figure 4. LDB for an LDOCE entry"
},
"FIGREF4": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "1 ) : $s~r~ngp( S\u00a51 2 ) <=> w~oin(Seg, S~1_1.' .... .$yl_2.n:l\"I t~."
},
"FIGREF6": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "'l:te,m,:l, x, Oerivl ++Ooriv."
},
"FIGREF7": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "+Sag ~ estringp(Seg)."
},
"FIGREF12": {
"uris": null,
"num": null,
"type_str": "figure",
"text": ":=> ... word ... : opt( -Zoenektr! G ) ) : *7.gendor( G )."
},
"FIGREF13": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "vampire [...] n (lit) Vampir, Blutsauger (old~ m; (fig) Vampir m. -hat Vampir, Blutsauger (old) m. wader [...] n (a) (Orn) Watvogel m. (b) ~s pl (boots) Watstiefel pl. house in cpd~ HaLts-; ~ arrest n Hausarrest m; ~ boat n Hausboot n~ -baund adj ans Haus gefesselt; .... house:. --hunt vi auf Haussuche sein; they have started --hunting sic haben angefangen, nach einem Haus zu suchen; -hunting n Haussuche n; ...."
},
"FIGREF14": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "daddy long.legs .da~i lot~jz also (/'m/) crane fly --n ... a type of flying insect with long legs ac.rLmo.ny ... n bitterness, as of manner or language ---nious ~,kri'maunias/ adj: an acrimonious quarrel ---niously adv crash I ... v ... 6 infml also gatecrash --to join (a party) without having been invited ... folk et.y.mol.o.gy ,,..'--~ n the changing of straage or foreign words so that they become like quite common ones: some people say ~parrowgrass instead of ASPARAGUS: that ia an example of folk etymology"
},
"TABREF1": {
"text": "",
"html": null,
"num": null,
"type_str": "table",
"content": "<table><tr><td colspan=\"4\">annoys or causes trouble, PEST:</td><td>Don't make a</td></tr><tr><td colspan=\"4\">nuisance of yourself.\" sit down and be quiet! 2 an action</td></tr><tr><td colspan=\"4\">or state of affairs which causes trouble, offence, or</td></tr><tr><td colspan=\"4\">unpleasantness: What a nuisance! I've forgotten my</td></tr><tr><td colspan=\"4\">ticket 3 Commit no nuisance (as a notice in a public</td></tr><tr><td colspan=\"4\">place) Do not use this place as a a lavatory b aTIP ~</td></tr><tr><td>entry</td><td/><td/></tr><tr><td colspan=\"3\">\u2022 -I'wJb#: nuisance</td></tr><tr><td colspan=\"2\">I +-SUlmPhom</td><td/></tr><tr><td colspan=\"4\">\u00f7-print foist1: nui.sance</td></tr><tr><td colspan=\"3\">I +-primaw</td></tr><tr><td>I</td><td colspan=\"3\">\u00f7-peon strir~j: \"nju:sFns II \"nu:-</td></tr><tr><td colspan=\"3\">+-syncat: n</td></tr><tr><td colspan=\"3\">I +-sensa_def</td></tr><tr><td colspan=\"3\">+-sense_no: 1 \u2022-darn</td></tr><tr><td colspan=\"3\">I \u2022-implicit_xrf</td></tr><tr><td colspan=\"4\">I I +-to: pest I \u00f7-def stril~: a person or animal that</td></tr><tr><td>|</td><td/><td/><td>annoys or causes trouble:</td></tr><tr><td colspan=\"3\">I \u00f7-example</td><td>pest</td></tr><tr><td/><td colspan=\"2\">\u00f7-eX stril~:</td><td>Don't make a nuisance of</td></tr><tr><td/><td/><td/><td>yourself: sit down an\u00a2</td></tr><tr><td/><td/><td/><td>be quiet/</td></tr><tr><td colspan=\"3\">\u2022-sense_def</td></tr><tr><td colspan=\"3\">\u2022 -slmse .no: 2 +.-defn</td></tr><tr><td colspan=\"4\">I \u00f7-def_string: an action or state of affairs</td></tr><tr><td>[</td><td/><td/><td>which causes trouble, offence.</td></tr><tr><td>I</td><td/><td/><td>or unpleasantness</td></tr><tr><td colspan=\"3\">+-example</td></tr><tr><td/><td colspan=\"2\">\u2022 -ex_strirlg:</td><td>What a nuisancel</td></tr><tr><td/><td/><td/><td>i've forgotten my ticket</td></tr><tr><td colspan=\"3\">+-sense_def</td></tr><tr><td colspan=\"3\">\u00f7-sense no: 3 \u00f7-de~ -</td></tr><tr><td/><td colspan=\"3\">\u00f7-h\u00a2~ j~rase: Commit no nuisance</td></tr><tr><td/><td colspan=\"2\">+-quail \u00a7let:</td><td>as a notice in a public place</td></tr><tr><td/><td colspan=\"2\">+-sub defn</td></tr><tr><td/><td>I</td><td/><td>a</td></tr><tr><td/><td>I</td><td colspan=\"2\">+-def_stril~:</td><td>Do not use this place</td></tr><tr><td/><td colspan=\"3\">I \u00f7-~.~b_dlfn +-seq_no: b \u00f7--defn</td><td>as a lavatory</td></tr><tr><td/><td/><td colspan=\"2\">*-i.~li\u00a2it_xrf</td></tr><tr><td/><td/><td colspan=\"2\">I *-to: tip</td></tr><tr><td/><td/><td colspan=\"2\">I \u00f7-h\u00a2~ no: 4</td></tr><tr><td/><td/><td colspan=\"2\">\u00f7-dQf s]ril~J~: Do not use this place</td></tr><tr><td/><td/><td/><td>as a tip</td></tr></table>"
},
"TABREF3": {
"text": "au.tit.fi\u00a2 ;\u00a2\u00a2'tistik, adj suffering from AUTISMI: I autistic chlld/behaviour",
"html": null,
"num": null,
"type_str": "table",
"content": "<table><tr><td/><td/><td/><td>I</td></tr><tr><td colspan=\"2\">F<wtistic<F<>wO~O}</td><td colspan=\"2\">titC*80}~icP<C:</td><td>\"fist</td></tr><tr><td colspan=\"4\">Z kH<adj<S<OOOO<O<suf qer ing from{~CA)autis</td></tr><tr><td colspan=\"3\">m\u00a2~B){*SA) : \u00a3u~6}autistic</td><td>childrm~behavi</td></tr><tr><td>our(~)</td><td colspan=\"3\">R<OZ<R<-nmlZy<R<><adv<N~<</td></tr><tr><td colspan=\"4\">is converted into the following token list:</td></tr><tr><td colspan=\"2\">maHtar . p@ maHter pro~_wmrker fld ~ -~sd_--rker</td><td>.</td></tr><tr><td colspan=\"3\">do~ marker font.T~, inl mll ~t ..1-1 . bagin~e~m) caps ) }. .</td></tr></table>"
},
"TABREF7": {
"text": "stron~nonterminals(source . targ . hill.",
"html": null,
"num": null,
"type_str": "table",
"content": "<table><tr><td colspan=\"2\">colle~ives</td><td>!conj</td><td>. nil ).</td></tr><tr><td>r~</td><td colspan=\"2\">==> (:~rl..11 rOlllilr~ J. -IX) ::> -TOrt~|X) +~ 44'* /\"</td><td>-fort~(i~l</td><td>1} :</td></tr></table>"
}
}
}
} |