File size: 81,970 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 | {
"paper_id": "P01-1022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:29:27.702005Z"
},
"title": "Practical Issues in Compiling Typed Unification Grammars for Speech Recognition",
"authors": [
{
"first": "John",
"middle": [],
"last": "Dowding",
"suffix": "",
"affiliation": {
"laboratory": "RIACS RIALIST Group",
"institution": "NASA Ames Research Center Moffett Field",
"location": {
"postCode": "94035",
"region": "CA"
}
},
"email": "jdowding@riacs.edu"
},
{
"first": "Beth",
"middle": [
"Ann"
],
"last": "Hockey",
"suffix": "",
"affiliation": {
"laboratory": "RIACS RIALIST Group",
"institution": "NASA Ames Research Center Moffett Field",
"location": {
"postCode": "94035",
"region": "CA"
}
},
"email": "bahockey@riacs.edu"
},
{
"first": "Jean",
"middle": [
"Mark"
],
"last": "Gawron",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "San Diego State University",
"location": {
"settlement": "San Diego",
"region": "CA"
}
},
"email": "gawron@mail.sdsu.edu"
},
{
"first": "Christopher",
"middle": [],
"last": "Culy",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "SRI International",
"location": {
"addrLine": "333 Ravenswood Avenue Menlo Park",
"postCode": "94025",
"region": "CA"
}
},
"email": "culy@ai.sri.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are difficult to build and maintain. One way to address the problems of the grammar-based approach is to compile recognition grammars from grammars written in a more expressive formalism. While theoretically straightforward , the compilation process can exceed memory and time bounds, and might not always result in accurate and efficient speech recognition. We will describe and evaluate two approaches to this compilation problem. We will also describe and evaluate additional techniques to reduce the structural ambiguity of the language model.",
"pdf_parse": {
"paper_id": "P01-1022",
"_pdf_hash": "",
"abstract": [
{
"text": "Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are difficult to build and maintain. One way to address the problems of the grammar-based approach is to compile recognition grammars from grammars written in a more expressive formalism. While theoretically straightforward , the compilation process can exceed memory and time bounds, and might not always result in accurate and efficient speech recognition. We will describe and evaluate two approaches to this compilation problem. We will also describe and evaluate additional techniques to reduce the structural ambiguity of the language model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Language models to constrain speech recognition are a crucial component of interactive spoken language systems. The more varied the language that must be recognized, the more critical good language modeling becomes. Research in language modeling has heavily favored statistical approaches (Cohen 1995 , Ward 1995 , Hu et al. 1996 , Iyer and Ostendorf 1997 , Bellegarda 1999 , Stolcke and Shriberg 1996 while handcoded finite-state or context-free language models dominate the commercial sector (Nuance 2001 , SpeechWorks 2001 , TellMe 2001 , BeVocal 2001 , HeyAnita 2001 , W3C 2001 . The difference revolves around the availability of data. Research systems can achieve impressive performance using statistical language models trained on large amounts of domain-targeted data, but for many domains sufficient data is not available. Data may be unavailable because the domain has not been explored before, the relevant data may be confidential, or the system may be designed to do new functions for which there is no human-human analog interaction. The statistical approach is unworkable in such cases for both the commercial developers and for some research systems (Moore et al. 1997 , Rayner et al. 2000 , Lemon et al. 2001 , Gauthron and Colineau 1999 . Even in cases for which there is no impediment to collecting data, the expense and time required to collect a corpus can be prohibitive. The existence of the ATIS database (Dahl et al. 1994) is no doubt a factor in the popularity of the travel domain among the research community for exactly this reason.",
"cite_spans": [
{
"start": 289,
"end": 300,
"text": "(Cohen 1995",
"ref_id": "BIBREF4"
},
{
"start": 301,
"end": 312,
"text": ", Ward 1995",
"ref_id": "BIBREF28"
},
{
"start": 313,
"end": 329,
"text": ", Hu et al. 1996",
"ref_id": "BIBREF9"
},
{
"start": 330,
"end": 355,
"text": ", Iyer and Ostendorf 1997",
"ref_id": "BIBREF11"
},
{
"start": 356,
"end": 373,
"text": ", Bellegarda 1999",
"ref_id": "BIBREF0"
},
{
"start": 374,
"end": 401,
"text": ", Stolcke and Shriberg 1996",
"ref_id": "BIBREF25"
},
{
"start": 494,
"end": 506,
"text": "(Nuance 2001",
"ref_id": null
},
{
"start": 507,
"end": 525,
"text": ", SpeechWorks 2001",
"ref_id": null
},
{
"start": 526,
"end": 539,
"text": ", TellMe 2001",
"ref_id": null
},
{
"start": 540,
"end": 554,
"text": ", BeVocal 2001",
"ref_id": null
},
{
"start": 555,
"end": 570,
"text": ", HeyAnita 2001",
"ref_id": null
},
{
"start": 571,
"end": 581,
"text": ", W3C 2001",
"ref_id": null
},
{
"start": 1166,
"end": 1184,
"text": "(Moore et al. 1997",
"ref_id": "BIBREF15"
},
{
"start": 1185,
"end": 1205,
"text": ", Rayner et al. 2000",
"ref_id": "BIBREF21"
},
{
"start": 1206,
"end": 1225,
"text": ", Lemon et al. 2001",
"ref_id": "BIBREF14"
},
{
"start": 1226,
"end": 1254,
"text": ", Gauthron and Colineau 1999",
"ref_id": "BIBREF7"
},
{
"start": 1429,
"end": 1447,
"text": "(Dahl et al. 1994)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "A major problem with grammar-based finitestate or context-free language models is that they can be tedious to build and difficult to maintain, as they can become quite large very quickly as the scope of the grammar increases. One way to address this problem is to write the grammar in a more expressive formalism and generate an approximation of this grammar in the format needed by the recognizer. This approach has been used in several systems, CommandTalk (Moore et al. 1997) , RIALIST PSA simulator (Rayner et al. 2000) , WITAS (Lemon et al. 2001) , and SETHIVoice (Gauthron and Colineau 1999) . While theoretically straight-forward, this approach is more demanding in practice, as each of the compilation stages contains the potential for a combinatorial explosion that will exceed memory and time bounds. There is also no guarantee that the resulting language model will lead to accurate and efficient speech recognition. We will be interested in this paper in sound approximations (Pereira and Wright 1991) in which the language accepted by the approximation is a superset of language accepted by the original grammar. While we conceed that alternative techniques that are not sound (Black 1989 , (Johnson 1998 , Rayner and Carter 1996 may still be useful for many purposes, we prefer sound approximations because there is no chance that the correct hypothesis will be eliminated. Thus, further processing techniques (for instance, N-best search) will still have an opportunity to find the optimal solution.",
"cite_spans": [
{
"start": 459,
"end": 478,
"text": "(Moore et al. 1997)",
"ref_id": "BIBREF15"
},
{
"start": 503,
"end": 523,
"text": "(Rayner et al. 2000)",
"ref_id": "BIBREF21"
},
{
"start": 532,
"end": 551,
"text": "(Lemon et al. 2001)",
"ref_id": "BIBREF14"
},
{
"start": 569,
"end": 597,
"text": "(Gauthron and Colineau 1999)",
"ref_id": "BIBREF7"
},
{
"start": 988,
"end": 1013,
"text": "(Pereira and Wright 1991)",
"ref_id": "BIBREF19"
},
{
"start": 1190,
"end": 1201,
"text": "(Black 1989",
"ref_id": "BIBREF2"
},
{
"start": 1202,
"end": 1217,
"text": ", (Johnson 1998",
"ref_id": "BIBREF12"
},
{
"start": 1218,
"end": 1242,
"text": ", Rayner and Carter 1996",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We will describe and evaluate two compilation approaches to approximating a typed unification grammar with a context-free grammar. We will also describe and evaluate additional techniques to reduce the size and structural ambiguity of the language model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Typed Unification Grammars (TUG), like HPSG (Pollard and Sag 1994) and Gemini (Dowding et al. 1993 ) are a more expressive formalism in which to write formal grammars 1 . As opposed to atomic nonterminal symbols in a CFG, each nonterminal in a TUG is a complex feature structure (Shieber 1986) where features with values can be attached. For example, the rule:",
"cite_spans": [
{
"start": 44,
"end": 66,
"text": "(Pollard and Sag 1994)",
"ref_id": "BIBREF18"
},
{
"start": 78,
"end": 98,
"text": "(Dowding et al. 1993",
"ref_id": "BIBREF6"
},
{
"start": 279,
"end": 293,
"text": "(Shieber 1986)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "s[] np:[num=N] vp:[num=N]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "can be considered a shorthand for 2 context free rules (assuming just two values for number): s np singular vp singular s np plural vp plural This expressiveness allows us to write grammars with a small number of rules (from dozens to a few hundred) that correspond to grammars with large numbers of CF rules. Note that the approximation need not incorporate all of the features from the original grammar in order to provide a sound approximation. In particular, in order to derive a finite CF grammar, we will need to consider only those features that have a finite number of possible values, or at least consider only finitely many of the possible values for infinitely valued features. We can use the technique of restriction (Shieber 1985) to remove these features from our feature structures. Removing these features may give us a more permissive language model, but it will still be a sound approximation.",
"cite_spans": [
{
"start": 729,
"end": 743,
"text": "(Shieber 1985)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "The experimental results reported in this paper are based on a grammar under development at RIACS for a spoken dialogue interface to a semi-autonomous robot, the Personal Satellite Assistant (PSA). We consider this grammar to be medium-sized, with 61 grammar rules and 424 lexical entries. While this may sound small, if the grammar were expanded by instantiating variables in all legal permutations, it would contain over",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "\u00a1 \u00a3 \u00a2 \u00a5 \u00a4 \u00a7 \u00a6 \u00a9",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "context-free rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Typed Unification Grammars",
"sec_num": "2"
},
{
"text": "We will be studying the compilation process to convert typed unification grammars expressed in Gemini notation into language models for use with the Nuance speech recognizer (Nuance, 2001) . We are using Nuance in part because it supports context-free language models, which is not yet industry standard. 2 Figure 1 illustrates the stages of processing: a typed unification grammar is first compiled to a context-free grammar. This is in turn converted into a grammar in Nuance's Grammar Specification Language (GSL), which is a form of context-free grammar in a BNF-like notation, with one rule defining each nonterminal, and allowing alternation and Kleene closure on the right-hand-side. Critically, the GSL must not contain any left-recursion, which must be eliminated before the GSL representation is produced. The GSL representation is then compiled into a Nuance package with the nuance compiler. This package is the input to the speech recognizer. In our experience, each of the compilation stages, as well as speech recognition itself, has the potential to lead to a combinatorial explosion that exceeds practical memory or time bounds. We will now describe implementations of the first stage, generating a context-free grammar from a typed unification grammar, by two different algorithms, one defined by Kiefer and Krieger (2000) and one by Moore and Gawron, described in Moore (1998) The critical difficulty for both of these approaches is how to select the set of derived nonterminals that will appear in the final CFG.",
"cite_spans": [
{
"start": 174,
"end": 188,
"text": "(Nuance, 2001)",
"ref_id": null
},
{
"start": 1315,
"end": 1340,
"text": "Kiefer and Krieger (2000)",
"ref_id": "BIBREF13"
},
{
"start": 1383,
"end": 1395,
"text": "Moore (1998)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 307,
"end": 315,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Compilation Process",
"sec_num": "3"
},
{
"text": "The algorithm of Kiefer&Krieger (K&K) divides this compilation step into two phases: first, the set of context-free nonterminals is determined by iterating a bottom-up search until a least fixedpoint is reached; second, this least fixed-point is used to instantiate the set of context-free produc-\u00a3 ! \" Kiefer and Krieger (2000) for proof that this terminates, and finds the appropriate fixed-point.",
"cite_spans": [
{
"start": 303,
"end": 328,
"text": "Kiefer and Krieger (2000)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "for each l # % $ & l ( ' 0 ) l1 ! 2 3 5 4 7 6 9 8 l@ ! A B C E D G F I H Q P \u00a9 R S F I H \u00a3 ) U T % V X W Y V \u00e0 c b 1 ! \u00a1 D G F I H d P e R S F I H \u00a3 ) U T f V X W Y V \u00e0 h g 1 i local q p s r u t d ! \u00a4 p s r u t 3 p ! v for each r # T d w for each t # y x 5 U R \u00a7 \u00a7 a F I H d P ) P \u00a3 V \u00e0 g 1 S t ) t1 ! \" p s r u t 3 p r u t 4 6 8 t@ ! & if q p d 3 p r u t 2 then return p A else return D G F I H d P e R S F I H \u00a3 ) U T f V X W Y V \u00e0 g r c e 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "Having computed the least fixed-point , the next step is to compute the set of corresponding CF productions. For each r in T , of the form The preprocessing stage rewrites the grammar to eliminate singleton variables. This step effective replaces singleton variables with a new unique atomic symbol 'ANY'. The feature structure for each lexical item and grammar rule is rewritten such that singleton variables are unified with a special value 'ANY', and every nonsingleton variable expression is embedded in a val() term. After this transformation, singleton variables will not unify with non-singleton variable expressions, only with other singletons. Additional rules are then introduced to deal with the singleton variable cases. For each daughter in a grammar rule in which a singleton variable appears, new lexical items and grammar rules are introduced which unify with that daughter in the original grammar. As an example, consider the 3 There is a minor bug in K&K where they state that the result t will always be in u and t c v w t",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "f f t \u00a2 d \u00a2 d \u00a2 X f h g ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "x y e y e y z t | {",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "will be a CF production in the approximation, but this may not be true if Here, the np object of vp is underspecified for num (as English does not generally require number agreement between the verb and its object), so it will be a singleton variable. So, the following rules will be generated: After preprocessing, any variables remaining in the bodies of grammar rules will be shared variables. Singleton variable elimination by itself is very effective at shrinking the size of the CF grammar space, reducing the size of the rule space for the PSA grammar from",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "vp:[num=val(N)] v",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "\u00a1 \u00a3 \u00a2 \u00a5 \u00a4 d w \u00a6 \u00a9 rules to 2 \u00a2 \" d w t I",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "rules. The bottom-up stage starts from this grammar, and derives a new grammar by propagating feature values up from the lexicon. The process acts like a chart parser, except that indicies are not kept. When a rule transitions from an active edge to an inactive edge, a new rule with those feature instantiations is recorded. As a side-effect of this compilation, -productions are eliminated. Top-down processing fires last, and performs a recursive-descent walk of the grammar starting atthe start symbol , generating a new grammar that propagates features downward through the grammar. A side-effect of this computation is that useless-productions (rules not reachable from ) are removed. It might still be possible that after top-down propagation there would still be variables present in the grammar. For example, if the grammar allows sentences like \"the deer walked\", which are ambiguous for number, then there will be a rule in the grammar that contains a shared variable for the number feature. To address this, as top-down propagation is progressing, all remaining variables are identified and unified with a special value 'ALL'. Since each nonterminal is now ground, it is trivial to assign each nonterminal a unique atomic symbol, and rewrite the grammar as a CFG. Table 2 contains a summary of some key statistics generated using both techniques. The recognition results were obtained on a test set of 250 utterances. Recognition accuracy is measured in word error rate, and recognition speed is measured in multiples of real time (RT), the length of the utterance compared with the length of the CPU time required for the recognition result 4 . The size of the resulting language model is measured in terms of the number of nonterminals in the grammar, and the size of the Nuance node array, a binary representation of the recursive transition network it uses to search the grammar. Ambiguity counts the average number of parses per sentence that were allowed by the CF grammar. As can be readily seen, the compilation time for the K&K algorithm is dramatically lower than the M&G algorithm, while producing a similarly lower recognition performance, measured in both word error rate and recognition speed.",
"cite_spans": [],
"ref_spans": [
{
"start": 1276,
"end": 1283,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Kiefer&Krieger's Algorithm",
"sec_num": "3.1"
},
{
"text": "Given that the two techniques generate grammars of roughly similar sizes, the difference in performance is striking. We believe that the use of the",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison",
"sec_num": "3.3"
},
{
"text": "in K&K is partially responsible. Consider a grammar that contains a lexical item like \"deer\" that is underspecified for number, and will contain a singleton variable. This will lead to a nonterminal feature structure for noun phrase that is also underspecified for number, which will be more general than any noun phrase feature structures that are marked for number. The",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "6",
"sec_num": "4"
},
{
"text": "operator will remove those noun phrases as being less general, effectively removing the number agreement constraint between subject and verb from the contextfree approximation. The use of",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "6",
"sec_num": "4"
},
{
"text": "allows a single grammar rule or lexical item to have non-local effects on the approximation. As seen in Table 2 , the grammar derived from the K&K algorithm is much more ambiguous than the grammar derived the M&G algorithm, and, as is further elaborated in Section 4, we believe that the amount of ambiguity can be a significant factor in recognition performance.",
"cite_spans": [],
"ref_spans": [
{
"start": 104,
"end": 111,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "7 6",
"sec_num": "4"
},
{
"text": "On the other hand, attention must be paid to the amount of time and memory required by the Moore algorithm. On a medium-sized grammar, this compilation step took over 3 hours, and was close to exceeding the memory capacity of our computer, with a process size of over 1GB. The approximation is only valuable if we can succeed in computing it. Finally, it should also be noted that M&G's algorithm removes -productions and useless-productions, while we had to add a separate postprocessing stage to K&K's algorithm to get comparable results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7 6",
"sec_num": "4"
},
{
"text": "For future work we plan to explore possible integrations of these two algorithms. One possibility is to include the singleton-elimination process as an early stage in the K&K algorithm. This is a relatively fast step, but may lead to a significant increase in the size of the grammar. Another possibility is to embed a variant of the K&K algorithm, and its clean separation of generating nonterminals from generating CF productions, in place of the bottom-up processing stage in M&G's algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "7 6",
"sec_num": "4"
},
{
"text": "It has been observed (Bratt and Stolcke 1999 ) that a potential difficulty with using linguisticallymotivated grammars as language models is that ambiguity in the grammar will lead to multiple paths in the language model for the same recognition hypothesis. In a standard beam-search architecture, depending on the level of ambiguity, this may tend to fill the beam with multiple hypotheses for the same word sequence, and force other good hypotheses out of the beam, poten-tially increasing word error rate. This observation appears to be supported in practice. The original form of the PSA grammar allows an average of 1.4 parses per sentence, and while both the K&K and M&G algorigthm increase the level of ambiguity, the K&K algorithm increases much more dramatically.",
"cite_spans": [
{
"start": 21,
"end": 44,
"text": "(Bratt and Stolcke 1999",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Reducing Structural Ambiguity",
"sec_num": "4"
},
{
"text": "We are investigating techniques to transform a CFG into one weakly equivalent but with less ambiguity. While it is not possible in general to remove all ambiguity (Hopcroft and Ullman 1979) we hope that reducing the amount of ambiguity in the resulting grammar will result in improved recognition performance.",
"cite_spans": [
{
"start": 163,
"end": 189,
"text": "(Hopcroft and Ullman 1979)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Reducing Structural Ambiguity",
"sec_num": "4"
},
{
"text": "The first technique is actually a combination of three related transformations:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "Duplicate Nonterminal Elimination -If two nonterminals A and B have exactly the same set of productions",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "t \u00a2 d \u00a2 d \u00a2 g t \u00a2 d \u00a2 d \u00a2 g",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "then remove the productions for B, and rewrite B as A everywhere it occurs in the grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "Unit Rule Elimination -If there is only one production for a nonterminal A, and it has a single daughter on its right-hand side V r then remove the production for A, and rewrite A as everywhere it occurs in the grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "Duplicate Production Elimination -If a nonterminal A has two productions that are identical",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "t \u00a2 d \u00a2 d \u00a2 g V p a V \u00a9 0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "then remove the production for p . These transformations are applied repeatedly until they can no longer be applied. Each of these transformations may introduce opportunities for the others to apply, so the process needs to be order insensitive. This technique can be applied after the traditional reduction techniques of elimination, cycle-elimination, and left-recursion elimination, since they don't introduce any new -productions or any new left-recursion.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "Although these transformations seem rather specialized, they were surprisingly effective at reducing the size of the grammar. For the K&K algorithm, the number of grammar rules was reduced from 3,246 to 2,893, a reduction of 9.2%, and for the M&G algorithm, the number of rules was reduced from 4,758 to 1,837, a reduction of 61%. While these transforms do reduce the size of the grammar, and modestly reduce the level of ambiguity from 1.96 to 1.92, they did not initially appear to improve recognition performance. However, that was with the nuance parameter -node array optimization level set to the default value FULL. When set to the value MIN, the compacted grammar was approximately 60% faster, and about 9% reduction in the word error rate, suggesting that the nuance compiler is performing a similar form of compaction during node array optimization.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Grammar Compactor",
"sec_num": "4.1"
},
{
"text": "Another technique to reduce ambiguity was motivated by a desire to reduce the amount of prepositional phrase attachment ambiguity in our grammar. This technique detects when a Kleene closure will be introduced into the final form of the grammar, and takes advantage of this to remove ambiguity. Consider this grammar fragment:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "NP NP PP VP V NP PP",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "The first rule tells us that an NP can be followed by an arbitrary number of PPs, and that the PP following the NP in the second rule will be ambiguous. In addition, any nonterminal that has an NP as its rightmost daughter can also be followed by an arbitrary number of PPs, so we can detect ambiguity following those nonterminals as well. We define a predicate follows as: A follows B iff B B A or B C and A follows C Now, the follows relation can be used to reduce ambiguity by modifying other productions where a B is followed by an A:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "t \u00a2 d \u00a2 d \u00a2 p p s r u t \u00a2 d \u00a2 d \u00a2 g where p s r u t follows p",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "and t can be rewritten as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "t \u00a2 d \u00a2 d \u00a2 p p r \u00a6 \u00a2 d \u00a2 d \u00a2 g",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "There is an exactly analogous transformation involving immediate right-recursion and a similar predicate preceeds. These transformation produce almost the same language, but can modify it by possibly allowing constructions that were not allowed in the original grammar. In our case, the initial grammar fragment above would require that at least one PP be generated within the scope of the VP, but after the transformation that is no longer required. So, while these transformations are not exact, they are still sound aproximations, as the resulting language is a superset of the original language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "Unfortunately, we have had mixed results with applying these transformations. In earlier versions of our implementation, applying these transformations succeeded in improving the recognition speed up to 20%, while having some modest improvements in word error rate. But, as we improved other aspects of the compilation process, notably the grammar compaction techniques and the left-recursion elimination technique, those improvements disappeared, and the transformations actually made things worse. The problem appears to be that both transformations can introduce cycles, and the right-recursive case can introduce left-recursion even in cases where cycles are not introduced. When the introduced cycles and left-recursions are later removed, the size of the grammar is increased, which can lead to poorer recognition performance. In the earlier implementations, cycles were fortuitously avoided, probably due to the fact that there were more unique nonterminals overall. We expect that these transformations may be effective for some grammars, but not others. We plan to continue to explore refinements to these techiques to prevent them from applying in cases where cycles or leftrecursion may be introduced.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Immediate Recursion Detection",
"sec_num": "4.2"
},
{
"text": "We have used two left-recursion elimination techniques, the traditional one based on Paull's algorithm, as reported by Hopcroft and Ullman (1979) , and one described by Moore (2000) 5 , based on a technique described by Johnson (1998) . Our experience concurs with Moore that the left-corner transform he describes produces a more compact left-recursion free grammar than that of Paull's algorithm. For the K&K approximation, we were unable to get any grammar to compile through to a working language model using Paull's algorithm (the models built with Paull's algorithm caused the recognizer to exceed memory bounds), and only succeeded with Moore's left-recursion elimination technique.",
"cite_spans": [
{
"start": 119,
"end": 145,
"text": "Hopcroft and Ullman (1979)",
"ref_id": "BIBREF10"
},
{
"start": 169,
"end": 181,
"text": "Moore (2000)",
"ref_id": "BIBREF17"
},
{
"start": 220,
"end": 234,
"text": "Johnson (1998)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Left Recursion Elimination",
"sec_num": "5"
},
{
"text": "We have presented descriptions of two algorithms for approximating typed unification grammars with context-free grammars, and evaluated their performance during speech recognition. Initial results show that high levels of ambiguity coorelate with poor recognition performance, and that size of the resuling language model does not appear to directly coorelate with recognition performance. We have developed new techniques for further reducing the size and amount of ambiguity in these context-free grammars, but have so far met with mixed results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "This paper specifically concerns grammars written in the Gemini formalism. However, the basic issues involved in compiling typed unification grammars to context-free grammars remain the same across formalisms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The standard is moving in the direction of contextfree language models, as can be seen in the draft standard for Speech Recognition Grammars being developed by the World Wide Web Consortium (W3C 2001).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "All timing results presented in this paper were executed on a Sun Ultra 60 workstation, running at 330MHz with 1.5 GB physical memory and an additional 1GB swap.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "There is a minor bug in the description of Moore's algorithm that occurs in his paper, that the set of \"retained nonterminals\" needs to be extended to include any nonterminals that occur either in the non-initial daughter of a left-recursive nonterminal, or in any daughter of a non-left-recursive nonterminal. Thanks to Robert Moore for providing the solution to this bug. This bug applies only to the description of his algorithm, not to the implementation on which the empirical results reported is based. Please seeMoore (2000) for more details.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Context scope selection in multi-span statistical language modeling",
"authors": [
{
"first": "J",
"middle": [],
"last": "Bellegarda",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 6th European Conference on Speech Communication and Technology (EuroSpeech99)",
"volume": "",
"issue": "",
"pages": "2163--2166",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Bellegarda. Context scope selection in multi-span statistical language modeling. In Proceedings of the 6th European Conference on Speech Communica- tion and Technology (EuroSpeech99), pages 2163- 2166, 1999.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Finite state machines from feature grammars",
"authors": [
{
"first": "A",
"middle": [],
"last": "Black",
"suffix": ""
}
],
"year": 1989,
"venue": "International Workshop on Parsing Technologies",
"volume": "",
"issue": "",
"pages": "277--285",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Black. Finite state machines from feature gram- mars. In International Workshop on Parsing Tech- nologies, pages 277-285, 1989.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Speech recognition in the ATIS domain using multiple knowledge sources",
"authors": [
{
"first": "M",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Rivlin",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Bratt",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of the Spoken Language Systems Technology Workshop",
"volume": "",
"issue": "",
"pages": "257--260",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Cohen, Z. Rivlin, and H. Bratt. Speech recog- nition in the ATIS domain using multiple knowl- edge sources. In Proceedings of the Spoken Lan- guage Systems Technology Workshop, pages 257- 260, 1995.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Expanding the scope of the atis task: The atis-3 corpus",
"authors": [
{
"first": "D",
"middle": [],
"last": "Dahl",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Bates",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Hunicke-Smith",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Pallet",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Pao",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Rudnicky",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Shriberg",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the ARPA Human Language Technology Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Dahl, M. Bates, M. Brown, K. Hunicke-Smith, D. Pallet, C. Pao, A. Rudnicky, and E. Shriberg. Expanding the scope of the atis task: The atis-3 cor- pus. In Proceedings of the ARPA Human Language Technology Workshop, Princeton, NJ, March 1994.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Gemini: A natural language system for spoken language understanding",
"authors": [
{
"first": "J",
"middle": [],
"last": "Dowding",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Gawron",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Appelt",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Cherny",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Moore",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Moran",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the Thirty-First Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Dowding, M. Gawron, D. Appelt, L. Cherny, R. Moore, and D. Moran. Gemini: A natural lan- guage system for spoken language understanding. In Proceedings of the Thirty-First Annual Meeting of the Association for Computational Linguistics, 1993.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "SETHIVoice: Cgf control by speech-recognition/interpretation",
"authors": [
{
"first": "O",
"middle": [],
"last": "Gauthron",
"suffix": ""
},
{
"first": "N",
"middle": [],
"last": "Colineau",
"suffix": ""
}
],
"year": 1999,
"venue": "I/ITSEC '99 (Interservice/Industry Training, Simulation and Education Conference), Synthetic Solutions for the 21st Century",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "O. Gauthron and N. Colineau. SETHIVoice: Cgf control by speech-recognition/interpretation. In I/ITSEC '99 (Interservice/Industry Training, Simu- lation and Education Conference), Synthetic Solu- tions for the 21st Century, Orlando, FL, 1999.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "HeyAnita",
"authors": [],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "HeyAnita. http://www.heyanita.com, 2001. As of 31 January 2001.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Language modeling with stochastic automata",
"authors": [
{
"first": "J",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Turin",
"suffix": ""
},
{
"first": "M",
"middle": [
"K"
],
"last": "Brown",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the Fourth International Conference on Spoken Language Processing (ICSLP)",
"volume": "",
"issue": "",
"pages": "406--413",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Hu, W. Turin, and M.K. Brown. Language model- ing with stochastic automata. In Proceedings of the Fourth International Conference on Spoken Lan- guage Processing (ICSLP), pages 406-413, 1996.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Introduction to Automata Theory, Languages, and Computation",
"authors": [
{
"first": "J",
"middle": [],
"last": "Hopcroft",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Ullman",
"suffix": ""
}
],
"year": 1979,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison- Wesley, Reading, MA, 1979.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Transforming out-ofdomain estimates to improve in-domain language models",
"authors": [
{
"first": "R",
"middle": [],
"last": "Iyer",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Ostendorf",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the 5th European Conference on Speech Communication and Technology (EuroSpeech97)",
"volume": "",
"issue": "",
"pages": "1975--1978",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Iyer and M. Ostendorf. Transforming out-of- domain estimates to improve in-domain language models. In Proceedings of the 5th European Con- ference on Speech Communication and Technology (EuroSpeech97), pages 1975-1978, 1997.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Finite-state approximation of constraintbased grammars using left-corner grammar transforms",
"authors": [
{
"first": "M",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "619--623",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Johnson. Finite-state approximation of constraint- based grammars using left-corner grammar trans- forms. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics, pages 619-623, 1998.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A context-free approximation of head-driven phrase structure grammar",
"authors": [
{
"first": "B",
"middle": [],
"last": "Kiefer",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Krieger",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 6th International Workshop on Parsing Technologies",
"volume": "",
"issue": "",
"pages": "135--146",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "B. Kiefer and H. Krieger. A context-free approxima- tion of head-driven phrase structure grammar. In Proceedings of the 6th International Workshop on Parsing Technologies, pages 135-146, 2000.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "A multi-modal dialogue system for human-robot conversation",
"authors": [
{
"first": "Oliver",
"middle": [],
"last": "Lemon",
"suffix": ""
},
{
"first": "Anne",
"middle": [],
"last": "Bracy",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Gruenstein",
"suffix": ""
},
{
"first": "Stanley",
"middle": [],
"last": "Peters",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of North American Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oliver Lemon, Anne Bracy, Alexander Gruenstein, and Stanley Peters. A multi-modal dialogue sys- tem for human-robot conversation. In Proceedings of North American Association for Computational Linguistics (NAACL 2001), 2001.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "CommandTalk: A spoken-language interface for battlefield simulations",
"authors": [
{
"first": "R",
"middle": [],
"last": "Moore",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Dowding",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Bratt",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Gawron",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Gorfu",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Cheyer",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the Fifth Conference on Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1--7",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Moore, J. Dowding, H. Bratt, J. Gawron, Y. Gorfu, and A. Cheyer. CommandTalk: A spoken-language interface for battlefield simulations. In Proceedings of the Fifth Conference on Applied Natural Lan- guage Processing, pages 1-7, 1997.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Using natural language knowledge sources in speech recognition",
"authors": [
{
"first": "R",
"middle": [],
"last": "Moore",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the NATO Advanced Studies Institute",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Moore. Using natural language knowledge sources in speech recognition. In Proceedings of the NATO Advanced Studies Institute, 1998.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Removing left-recusion from context-free grammars",
"authors": [
{
"first": "R",
"middle": [],
"last": "Moore",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of 1st Meeting of the North Americal Chapter of the Associations for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "249--255",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. Moore. Removing left-recusion from context-free grammars. In Proceedings of 1st Meeting of the North Americal Chapter of the Associations for Computational Linguistics, pages 249-255, 2000.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Head-Driven Phrase Structure Grammar",
"authors": [
{
"first": "C",
"middle": [],
"last": "Pollard",
"suffix": ""
},
{
"first": "I",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. Pollard and I. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, 1994.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Finite-state approximation of phrase structure grammars",
"authors": [
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Wright",
"suffix": ""
}
],
"year": 1991,
"venue": "Proceedings of the 29th Annual Meeting of the Assocations for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "246--255",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "F. Pereira and R. Wright. Finite-state approximation of phrase structure grammars. In Proceedings of the 29th Annual Meeting of the Assocations for Compu- tational Linguistics, pages 246-255, 1991.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Fast parsing using pruning and grammar specialization",
"authors": [
{
"first": "M",
"middle": [],
"last": "Rayner",
"suffix": ""
},
{
"first": "D",
"middle": [
"M"
],
"last": "Carter",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the Thirty-Fourth Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "223--230",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Rayner and D.M. Carter. Fast parsing using prun- ing and grammar specialization. In Proceedings of the Thirty-Fourth Annual Meeting of the Associa- tion for Computational Linguistics, pages 223-230, Santa Cruz, California, 1996.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A compact architecture for dialogue management based on scripts and meta-outputs",
"authors": [
{
"first": "M",
"middle": [],
"last": "Rayner",
"suffix": ""
},
{
"first": "B",
"middle": [
"A"
],
"last": "Hockey",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "James",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of Applied Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Rayner, B.A. Hockey, and F. James. A com- pact architecture for dialogue management based on scripts and meta-outputs. In Proceedings of Applied Natural Language Processing (ANLP), 2000.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Using restriction to extend parsing algorithms for complex-feature-based formalisms",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1985,
"venue": "Proceedings of the 23rd Annual Meeting of the Assocations for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "145--152",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Shieber. Using restriction to extend parsing algo- rithms for complex-feature-based formalisms. In Proceedings of the 23rd Annual Meeting of the Assocations for Computational Linguistics, pages 145-152, 1985.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "An Introduction to Unification-based Approaches to Grammar",
"authors": [
{
"first": "S",
"middle": [],
"last": "Shieber",
"suffix": ""
}
],
"year": 1986,
"venue": "CLSI Lecture Notes",
"volume": "",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Shieber. An Introduction to Unification-based Ap- proaches to Grammar. CLSI Lecture Notes no. 4. Center for the Study of Language and Information, 1986. (distributed by the University of Chicago Press).",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "SpeechWorks",
"authors": [],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "SpeechWorks. http://www.speechworks.com, 2001. As of 31 January 2001.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Statistical language modeling for speech disfluencies",
"authors": [
{
"first": "A",
"middle": [],
"last": "Stolcke",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Shriberg",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing",
"volume": "",
"issue": "",
"pages": "405--408",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Stolcke and E. Shriberg. Statistical language modeling for speech disfluencies. In Proceedings of the IEEE International Conference on Acous- tics, Speech and Signal Processing, pages 405-408, 1996.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "As of 31",
"authors": [],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "TellMe. http://www.tellme.com, 2001. As of 31 Jan- uary 2001.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Speech Recognition Grammar Specification for the W3C Speech Interface Framework",
"authors": [],
"year": 2001,
"venue": "World Wide Web Consortium (W3C)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "World Wide Web Consortium (W3C). Speech Recognition Grammar Specification for the W3C Speech Interface Framework. http://www.w3.org/TR/speech-grammar, 2001. As of 3 January 2001.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "The cmu atis system",
"authors": [
{
"first": "W",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Issar",
"suffix": ""
}
],
"year": 1995,
"venue": "Spoken Language System Technology Workshop",
"volume": "",
"issue": "",
"pages": "249--251",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "W. Ward and S. Issar. The cmu atis system. In Spo- ken Language System Technology Workshop, pages 249-251, 1995.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"uris": null,
"num": null,
"text": "Figure 1: Compilation Process"
},
"FIGREF1": {
"type_str": "figure",
"uris": null,
"num": null,
"text": "Instead, the subsuming nonterminal t should be the new mother."
},
"TABREF1": {
"type_str": "table",
"html": null,
"num": null,
"content": "<table><tr><td/><td/><td/><td>: Construction of the fixed-point</td></tr><tr><td colspan=\"2\">tions.</td><td/></tr><tr><td colspan=\"4\">The computation of the fixed-point</td><td>, de-</td></tr><tr><td colspan=\"4\">scribed in Table 1, proceeds as follows. First,</td></tr><tr><td colspan=\"4\">is constructed by finding the most-general set of</td></tr><tr><td colspan=\"4\">feature structures that occur in the lexicon 1-4). Each feature structure has the lexical restric-(lines $</td></tr><tr><td colspan=\"4\">tor L applied to it before being added to</td><td>(line 3)</td></tr><tr><td colspan=\"2\">with the</td><td colspan=\"2\">4 6</td></tr><tr><td colspan=\"4\">Each call to Iterate generates a new set</td><td>q p s r u t , in-</td></tr><tr><td colspan=\"2\">cluding</td><td>q p</td><td>as its base (line 8). It then adds new</td></tr><tr><td colspan=\"4\">feature structures to</td><td>p s r u t</td><td>by instantiating every</td></tr><tr><td colspan=\"4\">grammar rule r in</td><td>T</td><td>, the set of grammar rules.</td></tr><tr><td colspan=\"4\">The first step in the instantiation is to unify every</td></tr><tr><td colspan=\"4\">combination of daughters with all possible feature</td></tr><tr><td colspan=\"4\">structures from</td><td>p</td><td>(FillDaughters, line 10). The</td></tr><tr><td colspan=\"4\">rule restrictor is applied to each resulting feature</td></tr><tr><td colspan=\"4\">structure (line 11) before it is added to</td><td>p s r u t using</td></tr><tr><td>the</td><td colspan=\"3\">4 6 operator (line 12), similar to the lexical</td></tr><tr><td colspan=\"4\">case. If after checking all rule applications bottom</td></tr><tr><td colspan=\"4\">up, no new feature structures have been added to</td></tr><tr><td colspan=\"2\">p s r u t</td><td/></tr></table>",
"text": "operator. This operator maintains the set of most-general feature structures. A new feature structure is added to the set only when it is not subsumed by any current members of the set, and any current members that are subsumed by the new member are removed as the new element is added. The computation of proceeds with the call to Iterate (line 6), which adds new feature structures that can be derived bottom-up.(line 13), then the least fixed-point had been found, and the process terminates. Otherwise, It-erate is called recursively. See"
}
}
}
} |