File size: 74,592 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 |
{
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T01:06:44.225953Z"
},
"title": "Neural Transduction of Letter Position Dyslexia using an Anagram Matrix Representation",
"authors": [
{
"first": "Avi",
"middle": [],
"last": "Bleiweiss",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "BShalem Research Sunnyvale",
"location": {
"region": "CA",
"country": "USA"
}
},
"email": "avibleiweiss@bshalem.onmicrosoft.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Research on analyzing reading patterns of dyslectic children has mainly been driven by classifying dyslexia types offline. We contend that a framework to remedy reading errors inline is more far-reaching and will help to further advance our understanding of this impairment. In this paper, we propose a simple and intuitive neural model to reinstate migrating words that transpire in letter position dyslexia, a visual analysis deficit to the encoding of character order within a word. Introduced by the anagram matrix representation of an input verse, the novelty of our work lies in the expansion from one to a two dimensional context window for training. This warrants words that only differ in the disposition of letters to remain interpreted semantically similar in the embedding space. Subject to the apparent constraints of the self-attention transformer architecture, our model achieved a unigram BLEU score of 40.6 on our reconstructed dataset of the Shakespeare sonnets.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "Research on analyzing reading patterns of dyslectic children has mainly been driven by classifying dyslexia types offline. We contend that a framework to remedy reading errors inline is more far-reaching and will help to further advance our understanding of this impairment. In this paper, we propose a simple and intuitive neural model to reinstate migrating words that transpire in letter position dyslexia, a visual analysis deficit to the encoding of character order within a word. Introduced by the anagram matrix representation of an input verse, the novelty of our work lies in the expansion from one to a two dimensional context window for training. This warrants words that only differ in the disposition of letters to remain interpreted semantically similar in the embedding space. Subject to the apparent constraints of the self-attention transformer architecture, our model achieved a unigram BLEU score of 40.6 on our reconstructed dataset of the Shakespeare sonnets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Dyslexia is a reading disorder that is perhaps the most studied of learning disabilities, with an estimated prevalence rate of 5 to 17 percentage points of school-age children in the US (Shaywitz and Shaywitz, 2005; Made by Dyslexia, 2019) . Counter to popular belief, dyslexia is not only tied to the visual analysis system of the brain, but also presents a linguistic problem and hence its relevance to natural language processing (NLP). Dyslexia manifests itself in several forms as this work centers on Letter Position Dyslexia (LPD), a selective deficit to encoding the position of a letter within a word while sustaining both letter identification and character binding to words (Friedmann and Gvion, 2001) .",
"cite_spans": [
{
"start": 186,
"end": 215,
"text": "(Shaywitz and Shaywitz, 2005;",
"ref_id": "BIBREF20"
},
{
"start": 216,
"end": 239,
"text": "Made by Dyslexia, 2019)",
"ref_id": null
},
{
"start": 685,
"end": 712,
"text": "(Friedmann and Gvion, 2001)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "A growing body of research advocates heterogeneity of dyslexia causes to poor non-word and irregular-word reading (McArthur et al., 2013) .",
"cite_spans": [
{
"start": 114,
"end": 137,
"text": "(McArthur et al., 2013)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Along the same lines Kezilas et al. (2014) suggest that character transposition effects in LPD are most likely caused by a deficit specific to coding the letter position and is evidenced by an interaction between the orthographic and visual analysis stages of reading. To this end, more recently Marcet et al. (2019) managed to significantly reduce migration errors by either altering letter contrast or presenting letters to the young adult sequentially.",
"cite_spans": [
{
"start": 21,
"end": 42,
"text": "Kezilas et al. (2014)",
"ref_id": "BIBREF7"
},
{
"start": 296,
"end": 316,
"text": "Marcet et al. (2019)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To dyslectic children not all letter positions are equally impaired as medial letters in a word are by far more vulnerable to reading errors compared to the first and last characters of the word (Friedmann and Gvion, 2001) . Children with LPD have high migration errors where the transposition of letters in the middle of the word leads to another word, for example, slime-smile or cloud-could. On the other hand, not all reading errors in cases of selective LPD are migratable and are evidenced by words read without a lexical sense e.g., slime-silme. Intriguingly, increasing the word length does not elevate the error rate, and moreover, shorter words that have lexical anagrams are prone to a larger proportion of migration errors compared to longer words that possess no-anagram words. A key observation for LPD is that although words read may share all letters in most of the positions, they still remain semantically unrelated.",
"cite_spans": [
{
"start": 195,
"end": 222,
"text": "(Friedmann and Gvion, 2001)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Machine learning tools to classify dyslexia use a large corpus of reading errors for training and mainly aim to automate and substitute diagnostic procedures expensively managed by human experts. Lakretz et al. (2015) used both LDA and Naive Bayes models and showed an area under curve (AUC) performance of about 0.8 that exceeded the quality of clinician-rendered labels. In their study, Rello and Ballesteros (2015) proposed a statistical model that predicts dyslectic readers using eye tracking measures. Employing an SVM-based binary classifier, they achieved about 80% accuracy.",
"cite_spans": [
{
"start": 196,
"end": 217,
"text": "Lakretz et al. (2015)",
"ref_id": "BIBREF9"
},
{
"start": 389,
"end": 417,
"text": "Rello and Ballesteros (2015)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Instead, our approach applies deep learning to the task of restoring LPD inline that we further formulate as a sequence transduction problem. Thus, given an input verse that contains shuffled-letter words identified as transpositional errors, the objective of our neural model is to predict the originating unshuffled words. We use language similarity between predicted verses and ground-truth target text-sequences to quantitatively evaluate our model. Our main contribution is a concise representation of the input verse that scales up to moderate an exhaustive set of LPD permutable data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Using a colon notation, we denote an input verse to our model as a text sequence w 1:n = (w 1 , . . . , w n ) of n words interchangeably with n collections of letters",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "l 1:n = (l (1) 1:|w 1 | , . . . , l (n) 1:|wn| ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "We generate migrated word patterns synthetically by anchoring the first and last character of each word and randomly permuting the position of the inner letters (l",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "(1) 2:|w 1 |\u22121 , . . . , l (n) 2:|wn|\u22121 ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "Thus given a word with a character length |l (i) |, the number of possible unique transpositions for each word follows t 1:n = (|l (1) |!, . . . , |l (n) |!). Next, we extract a migration amplification factor k = argmax n i=1 t i that we apply to each word in an input verse independently and form the sequence m 1:k = (m 1 , . . . , m k ). Word length commonly used in experiments of previous LPD studies averages five letters and ranges from four to seven letters long, hence migrating to feasible 2, 6, 24, and 120 letter substitutions, respectively. We note that words with 1, 2, or 3 letters are held intact and are not migratable.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "when forty winters shall besiege thy brow wehn fotry wenitrs sahll bseeige thy borw when froty winrtes slhal begseie thy borw wehn fotry wrenits slahl begisee thy borw when forty wtenirs shall begeise thy brow when froty wtneirs shall bigeese thy brow when ftory weinrts sahll bgiesee thy borw wehn frtoy wirtens slhal bisgeee thy borw wehn froty wterins slahl beeisge thy brow when froty wtiners shlal beesgie thy borw wehn frtoy wnetris shall beisege thy borw Table 1 : A snapshot of letter-position migration patterns in the form of an anagram matrix. The unedited version of the text sequence is highlighted on top.",
"cite_spans": [],
"ref_spans": [
{
"start": 462,
"end": 469,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "To address the inherent semantic unrelatedness between transpositioned words, we define a twodimensional migration-verse array in the form of an",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "anagram matrix A = [m (1) 1:k ; , . . . , ; m (n) 1:k ] \u2208 R k\u00d7n , where m (i) are column vectors, [\u2022; \u2022]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "is columnbound matrix concatenation, and k and n are the transposition and input verse dimensions, respectively. In Table 1 , we render a subset of an anagram matrix drawn from a target verse with a maximal word length of seven letters. The anagram matrix founds an effective context structure for a two-pass embedding training, and our training dataset thus reconstructs on the basis of a collection of anagram matrices with varying dimensions.",
"cite_spans": [],
"ref_spans": [
{
"start": 116,
"end": 123,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Anagram Matrix",
"sec_num": "2"
},
{
"text": "Models for learning word vectors train locally on a one-dimensional context window by scanning the entire corpus (Mikolov et al., 2013) . Through evaluation on a word analogy task, these models capture linguistic regularities as linear relationships between word embeddings. Mikolov et al. (2013) proposed the skip-gram and continuous-bag-of-words (CBOW) neural architectures with the objective to predict the context of the target word and the target word given its context, respectively. Notably LPD migrating words tend mostly outside the English vocabulary and thus pretrained word embeddings on large corpora are of limited use in our system. 1",
"cite_spans": [
{
"start": 113,
"end": 135,
"text": "(Mikolov et al., 2013)",
"ref_id": "BIBREF13"
},
{
"start": 275,
"end": 296,
"text": "Mikolov et al. (2013)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "LPD Embeddings",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": ", ,",
"eq_num": ", , , , , , , , , , , , , , , , , , , , , , , Figure 1"
}
],
"section": "LPD Embeddings",
"sec_num": "3"
},
{
"text": ": A two-dimensional context window of size two drawn from outside context cells of an anagram matrix. The center words are shown in gray for both the normal by-row {w t,t\u22122 , . . . , w t,t+2 } and transposed column-wise {w t\u22122,t , . . . , w t+2,t } forms of feeding our neural network.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "LPD Embeddings",
"sec_num": "3"
},
{
"text": "While the essence of our task is formalized as verse simplification, mending LPD relies on robust discovery of word similarities along both the migration and verse axes of the anagram matrix. To this extent, we reshape the context window to train word embeddings from one to a two-dimensional array. In Figure 1 , we show a bi-dimensional con-text window of size two that is a visible subset drawn from outside context cells of an anagram matrix. Learning word vectors for LPD is a two-pass process in our model. First, the context window W feeds our neural network row-by-row for each transpositioned verse, and then follows by iterating migration vectors m (i) in W T as inputs.",
"cite_spans": [],
"ref_spans": [
{
"start": 303,
"end": 311,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "LPD Embeddings",
"sec_num": "3"
},
{
"text": "Our task is inspired by recent advances in neural machine translation (NMT). NMT architectures have shown state-of-the-art results in both the form of a powerful sequence model (Sutskever et al., 2014; Bahdanau et al., 2015) and more recently, the cross-attention ConvS2S (Elbayad et al., 2018) and the self-attention based transformer (Vaswani et al., 2017) networks. Given an unintelligible diction of shuffled-letter words, our model aims to output a verse that preserves the semantics of the input, and uses the transformer that outperforms both recurrent and convolutional configurations on many language translation tasks. Stacked with several network layers, the transformer architecture only relies on attention mechanisms and entirely dispensing with recurrence (Hochreiter and Schmidhuber, 1997; Chung et al., 2014) . In Figure 2 , we show a synoptic rendition of the transformer. Its inputs consist of a source verse with potentially letter-transpositioned words x i , and a ground-truth target verse of words with unshuffled letters y i . The transformer encoder and decoder modules largely operate in parallel and provide for a source-to-target attention communication, and a softmax layer operates on the decoder hidden-state outputs to produce predicted words\u0177 i . In LPD, source and target verses are consistently of the same word count n, however, copying tokens from the source over to predictions is inconsequen-tial to the quality of repairing reading errors due to extensive out-of-vocabulary non-migrating words.",
"cite_spans": [
{
"start": 177,
"end": 201,
"text": "(Sutskever et al., 2014;",
"ref_id": "BIBREF21"
},
{
"start": 202,
"end": 224,
"text": "Bahdanau et al., 2015)",
"ref_id": "BIBREF0"
},
{
"start": 272,
"end": 294,
"text": "(Elbayad et al., 2018)",
"ref_id": "BIBREF4"
},
{
"start": 336,
"end": 358,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF22"
},
{
"start": 771,
"end": 805,
"text": "(Hochreiter and Schmidhuber, 1997;",
"ref_id": "BIBREF6"
},
{
"start": 806,
"end": 825,
"text": "Chung et al., 2014)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 831,
"end": 839,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Model",
"sec_num": "4"
},
{
"text": "To quantitatively evaluate our LPD transduction approach, we chose to mainly report n-gram BLEU precision (Papineni et al., 2002) that defines the language similarity between a predicted text sequence and the ground-truth reference verse. In the BLEU metric, higher scores indicate better performance.",
"cite_spans": [
{
"start": 106,
"end": 129,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "5"
},
{
"text": "Rather than clinical reading tests, we used the Sonnets by William Shakespeare (Shakespeare, 1997) . This is motivated by the apostrophe-rich data that forces left-out letters. The raw dataset comprises 2,154 verses that range from four to fifteen word sequences. In Figure 3 , we show the distribution of word length across the dataset, as 18,858 unique tokens are of up to seven-letter long inclusive and take about 62 percentage points of the entire corpus words. To conform to preceding LPD research, we conducted a cleanup step that removes all words of eight letters or more from the dataset. We hypothesize that evaluating LPD on a single word basis lets us perform this step without loss of generality. We then transform each verse of the Sonnets to an anagram matrix representation A. The verse word with the maximal letters has a set of distinct traspositions while words of lesser letters are shuffled with repetition (Table 1) . In Figure 4 , we show the distribution of anagram matrices across the entire Shakespeare Sonnets dataset, with a migration amplification factor k \u2208 {1, 2, 6, 24, 120} and a cleaned up verse that spans two to thirteen words. Evidently most prominent tiles are of words with seven letters and consist of verse sizes between seven to nine words. Concatenating the rows of all the anagram matrices presents a sixtyfold extended shape of our LPD training dataset that has 130,021 text sequences, along with source and target vocabularies of 173,575 and 3,147 tokens, respectively. ",
"cite_spans": [
{
"start": 79,
"end": 98,
"text": "(Shakespeare, 1997)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 267,
"end": 275,
"text": "Figure 3",
"ref_id": "FIGREF1"
},
{
"start": 929,
"end": 938,
"text": "(Table 1)",
"ref_id": null
},
{
"start": 944,
"end": 952,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Corpus",
"sec_num": "5.1"
},
{
"text": "We used PyTorch (Paszke et al., 2017 ) version 1.0 as our deep learning platform for training and inference. PyTorch supports the building of effective neural architectures for NLP task development. We incorporated in our framework the annotated PyTorch implementation of the transformer (Rush, 2018) and modified it to accommodate our LPD dataset. Multi-head attention was configured with h = 8 layers and a model size d model = 512, and the query, key, and value vectors were set uniformly to d model /h = 64. The inner layer of the encoder and the decoder had dimensionality d f f = 2, 048. In Figure 5 , we show permuted embeddings retaining input semantics by using our anagram matrix concept. The presence of replicated words in vector space owes to the transformer built-in learned positions of input embeddings. We chose the Adam optimizer (Kingma and Ba, 2014) with a varied learning rate and a fixed model dropout of 0.1, using cross-entropy loss and label smoothing for regularization. Figure 6 reviews epoch-loss progression in training and validating our model. ",
"cite_spans": [
{
"start": 16,
"end": 36,
"text": "(Paszke et al., 2017",
"ref_id": "BIBREF15"
},
{
"start": 288,
"end": 300,
"text": "(Rush, 2018)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 597,
"end": 605,
"text": "Figure 5",
"ref_id": "FIGREF4"
},
{
"start": 997,
"end": 1005,
"text": "Figure 6",
"ref_id": "FIGREF5"
}
],
"eq_spans": [],
"section": "Training",
"sec_num": "5.2"
},
{
"text": "We ran our model inference on a split test set that comprises randomly selected rows sampled from the entire collection of anagram matrices and further excluded from the train set. We postulate that the use of matrix columns along the migration axis are only beneficial for embedding training.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "6"
},
{
"text": "Context Window BLEU-1 BLEU-2 BLEU-3 BLEU-4 one-dimensional 36.8 20.9 13.0 8.3 two-dimensional 40.6 23.7 14.7 8.9 Table 2 : Model performance using n-gram BLEU measures at a corpus level on our augmented Sonnets testset for repairing letter transpositions. Scores shown are contrasted between the use of one and two dimensional context window for training word embeddings.",
"cite_spans": [],
"ref_spans": [
{
"start": 113,
"end": 120,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6"
},
{
"text": "In Table 2 , we report corpus-level n-gram BLEU scores of our transformer-based model for inline transduction of LPD reading patterns. Uniformly a two-dimensional context window for training embeddings boosts our performance by about ten percentage points on average compared to the onedimensional window. As expected, BLEU scores decline exponentially when we increase n-gram, from 40.6 for BLEU-1 down to 8.9 for BLEU-4.",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6"
},
{
"text": "While BLEU scores the output by counting ngram matches with the reference, we also evaluated our model using SARI (Xu et al., 2016) , a novel metric that correlates with human judgments and designed to specifically analyze text simplification models. SARI principally compares system output against both the reference and input verse and returns an arithmetic average of n-gram precisions and recalls of addition, copy, and delete rewrite operations. 2 Table 3 summarizes SARI and average BLEU measures of our model. Scores appear fairly correlated with a slight edge in favor of SARI that correctly rewards models like ours which make changes that simplify input verses. The transformer is known to be bound by a fixedlength context and thus tends to split a long context to segments that often ignore semantic boundaries. This led to the conjecture that context fragmentation may impact our model performance adversely. The novel transformer-xl network (Dai et al., 2019) that learns dependencies across subsequences using recurrence, might be the more effective architecture to perform our task.",
"cite_spans": [
{
"start": 114,
"end": 131,
"text": "(Xu et al., 2016)",
"ref_id": "BIBREF23"
},
{
"start": 955,
"end": 973,
"text": "(Dai et al., 2019)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [
{
"start": 451,
"end": 460,
"text": "2 Table 3",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6"
},
{
"text": "To conduct a baseline evaluation of our model, we hand curated a corpus made of LPD screening tests. Targeted screeners are brief performance measures intended to classify at-risk individuals. To the extent of our knowledge, Lakretz et al. (2015) used for their experiments the largest known screener dataset to date that consisted of 196 loose target words in Hebrew. Correspondingly, we assembled a screening corpus of 196 English words that are prone to erroneous reading. In our system, these words are recast into a set of anagram matrices, each however reduced to a vector \u2208 R k\u00d71 . Further downstream, we represented context-less words as one-hot vectors. As expected, on the task of reinstating screener data our sequence model achieved a fairly low 1-gram BLEU score of 9.2. Counter to nearly 4.4X improvement on the Sonnets dataset, when trained using a 2D context window.",
"cite_spans": [
{
"start": 225,
"end": 246,
"text": "Lakretz et al. (2015)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "7"
},
{
"text": "2 https://github.com/cocoxu/simplification Compared to almost two orders of magnitude larger Sonnets dataset, the screening corpus was too small and thus overfitting our transformerbased neural model. In addition, to effectively exploit our proposed anagram matrix representation, rather than disjoint words we require to train our sequence model on a dataset comprised of verses or sentences that provides essential context for learning embeddings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "7"
},
{
"text": "In a practical application framework, our proposed model is rated on successful recovery from LPD reading errors that transpire in a text sequence. We envision our model already pretrained on multiple corpora, each extended to a collection of anagram matrices. Every editing instance follows with a dyslectic individual who reads and utters a verse at a time from a text document. Fed to the network, the verse is then inferred by our model that returns an amended text sequence the user can compare side-by-side on his display. It is key for the system we presented to perform responsively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "7"
},
{
"text": "In this paper, we presented word-level neural sentence simplification to aid letter-position dyslectic children. We modeled the task after a monolingual machine translation and showed the representation effectiveness of a two-dimensional context window to boost our model performance. Future avenues of research include using our model in real-world restoration scenarios of LPD, and exploring the efficacy of the transformer-xl architecture to a non language modeling task like ours. We look forward to leverage the exceptional ability of transformer-xl to perform character-level language modeling and improve mending LPD.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "8"
},
{
"text": "https://nlp.stanford.edu/projects/glove/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank the anonymous reviewers for their insightful suggestions and feedback.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Neural machine translation by jointly learning to align and translate",
"authors": [
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2015,
"venue": "International Conference on Learning Representations, (ICLR)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2015. Neural machine translation by jointly learning to align and translate. In International Con- ference on Learning Representations, (ICLR), San Diego, California.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Learning phrase representations using RNN encoder-decoder for statistical machine translation",
"authors": [
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Bart",
"middle": [],
"last": "Van Merrienboer",
"suffix": ""
},
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Fethi",
"middle": [],
"last": "Bougares",
"suffix": ""
},
{
"first": "Holger",
"middle": [],
"last": "Schwenk",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1724--1734",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kyunghyun Cho, Bart van Merrienboer, Caglar Gul- cehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using RNN encoder-decoder for statistical machine translation. In Empirical Methods in Natural Language Processing (EMNLP), pages 1724-1734, Doha, Qatar.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Empirical evaluation of gated recurrent neural networks on sequence modeling",
"authors": [
{
"first": "Junyoung",
"middle": [],
"last": "Chung",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Aglar G\u00fcl\u00e7ehre",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Junyoung Chung, \u00c7 aglar G\u00fcl\u00e7ehre, KyungHyun Cho, and Yoshua Bengio. 2014. Empirical evaluation of gated recurrent neural networks on sequence modeling. CoRR, abs/1412.3555. Http://arxiv.org/abs/1412.3555.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Transformer-XL: Attentive language models beyond a fixed-length context",
"authors": [
{
"first": "Zihang",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Zhilin",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Yiming",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Jaime",
"middle": [],
"last": "Carbonell",
"suffix": ""
},
{
"first": "Quoc",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
}
],
"year": 2019,
"venue": "Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "2978--2988",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zihang Dai, Zhilin Yang, Yiming Yang, Jaime Car- bonell, Quoc Le, and Ruslan Salakhutdinov. 2019. Transformer-XL: Attentive language models beyond a fixed-length context. In Annual Meeting of the Association for Computational Linguistics (ACL), pages 2978-2988, Florence, Italy.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Pervasive attention: {2D} convolutional neural networks for sequence-to-sequence prediction",
"authors": [
{
"first": "Maha",
"middle": [],
"last": "Elbayad",
"suffix": ""
},
{
"first": "Laurent",
"middle": [],
"last": "Besacier",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Verbeek",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 22nd Conference on Computational Natural Language Learning (CONLL)",
"volume": "",
"issue": "",
"pages": "97--107",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maha Elbayad, Laurent Besacier, and Jakob Verbeek. 2018. Pervasive attention: {2D} convolutional neu- ral networks for sequence-to-sequence prediction. In Proceedings of the 22nd Conference on Computa- tional Natural Language Learning (CONLL), pages 97-107, Brussels, Belgium.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Letter position dyslexia",
"authors": [
{
"first": "Naama",
"middle": [],
"last": "Friedmann",
"suffix": ""
},
{
"first": "Aviah",
"middle": [],
"last": "Gvion",
"suffix": ""
}
],
"year": 2001,
"venue": "Journal of Cognitive Neuropsychology",
"volume": "18",
"issue": "8",
"pages": "673--696",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Naama Friedmann and Aviah Gvion. 2001. Letter po- sition dyslexia. Journal of Cognitive Neuropsychol- ogy, 18(8):673-696.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Long short-term memory",
"authors": [
{
"first": "Sepp",
"middle": [],
"last": "Hochreiter",
"suffix": ""
},
{
"first": "J\u00fcrgen",
"middle": [],
"last": "Schmidhuber",
"suffix": ""
}
],
"year": 1997,
"venue": "Neural Computation",
"volume": "9",
"issue": "8",
"pages": "1735--1780",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural Computation, 9(8):1735-1780.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The locus of impairment in english developmental letter position dyslexia. Frontiers in human neuroscience",
"authors": [
{
"first": "Yvette",
"middle": [],
"last": "Kezilas",
"suffix": ""
},
{
"first": "Saskia",
"middle": [],
"last": "Kohnen",
"suffix": ""
},
{
"first": "Meredith",
"middle": [],
"last": "Mckague",
"suffix": ""
},
{
"first": "Anne",
"middle": [],
"last": "Castles",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "8",
"issue": "",
"pages": "1--14",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yvette Kezilas, Saskia Kohnen, Meredith Mckague, and Anne Castles. 2014. The locus of impairment in english developmental letter position dyslexia. Fron- tiers in human neuroscience, 8:1-14.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "P",
"middle": [],
"last": "Diederik",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2014,
"venue": "CoRR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. CoRR, abs/1412.6980. http://arxiv.org/abs/1412.6980.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Probabilistic graphical models of dyslexia",
"authors": [
{
"first": "Yair",
"middle": [],
"last": "Lakretz",
"suffix": ""
},
{
"first": "Gal",
"middle": [],
"last": "Chechik",
"suffix": ""
},
{
"first": "Naama",
"middle": [],
"last": "Friedmann",
"suffix": ""
},
{
"first": "Michal",
"middle": [],
"last": "Rosen-Zvi",
"suffix": ""
}
],
"year": 2015,
"venue": "Knowledge Discovery and Data Mining (KDD)",
"volume": "",
"issue": "",
"pages": "1919--1928",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yair Lakretz, Gal Chechik, Naama Friedmann, and Michal Rosen-Zvi. 2015. Probabilistic graphical models of dyslexia. In Knowledge Discovery and Data Mining (KDD), pages 1919-1928, Sydney, Australia.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Made by Dyslexia",
"authors": [],
"year": 2019,
"venue": "Dyslexia in schools: A survey",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Made by Dyslexia. 2019. Dyslexia in schools: A sur- vey. http://madebydyslexia.org/assets/downloads/ Dyslexia In Schools 2019.pdf (2019/9/8).",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Can letter position encoding be modified by visual perceptual elements?",
"authors": [
{
"first": "Ana",
"middle": [],
"last": "Marcet",
"suffix": ""
},
{
"first": "Manuel",
"middle": [],
"last": "Perea",
"suffix": ""
},
{
"first": "Ana",
"middle": [],
"last": "Baciero",
"suffix": ""
},
{
"first": "Pablo",
"middle": [],
"last": "G\u00f3mez",
"suffix": ""
}
],
"year": 2019,
"venue": "Quarterly Journal of Experimental Psychology",
"volume": "72",
"issue": "6",
"pages": "1344--1353",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ana Marcet, Manuel Perea, Ana Baciero, and Pablo G\u00f3mez. 2019. Can letter position encoding be mod- ified by visual perceptual elements? Quarterly Jour- nal of Experimental Psychology, 72(6):1344-1353.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Getting to grips with the heterogeneity of developmental dyslexia",
"authors": [
{
"first": "Genevieve",
"middle": [],
"last": "Mcarthur",
"suffix": ""
},
{
"first": "Saskia",
"middle": [],
"last": "Kohnen",
"suffix": ""
},
{
"first": "Linda",
"middle": [],
"last": "Larsen",
"suffix": ""
},
{
"first": "Kristy",
"middle": [],
"last": "Jones",
"suffix": ""
}
],
"year": 2013,
"venue": "Cognitive neuropsychology",
"volume": "30",
"issue": "",
"pages": "1--24",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Genevieve McArthur, Saskia Kohnen, Linda Larsen, Kristy Jones, Thushara Anandakumar, Erin Banales, and Anne Castles. 2013. Getting to grips with the heterogeneity of developmental dyslexia. Cognitive neuropsychology, 30:1-24.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Distributed representations of words and phrases and their compositionality",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [
"S"
],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeff",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "Advances in Neural Information Processing Systems (NIPS)",
"volume": "",
"issue": "",
"pages": "3111--3119",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Cor- rado, and Jeff Dean. 2013. Distributed representa- tions of words and phrases and their composition- ality. In C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Q. Weinberger, editors, Ad- vances in Neural Information Processing Systems (NIPS), pages 3111-3119. Curran Associates, Inc.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "BLEU: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "Kishore",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "Todd",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "Wei-Jing",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "311--318",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei- Jing Zhu. 2002. BLEU: a method for automatic evaluation of machine translation. In Annual Meet- ing of the Association for Computational Linguistics (ACL), pages 311-318, Philadelphia, Pennsylvania.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Automatic differentiation in pytorch",
"authors": [
{
"first": "Adam",
"middle": [],
"last": "Paszke",
"suffix": ""
},
{
"first": "Sam",
"middle": [],
"last": "Gross",
"suffix": ""
},
{
"first": "Soumith",
"middle": [],
"last": "Chintala",
"suffix": ""
},
{
"first": "Gregory",
"middle": [],
"last": "Chanan",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Zachary",
"middle": [],
"last": "Devito",
"suffix": ""
},
{
"first": "Zeming",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Alban",
"middle": [],
"last": "Desmaison",
"suffix": ""
},
{
"first": "Luca",
"middle": [],
"last": "Antiga",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Lerer",
"suffix": ""
}
],
"year": 2017,
"venue": "Workshop on Autodiff, Advances in Neural Information Processing Systems (NIPS) )",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in pytorch. In Workshop on Autodiff, Advances in Neural Infor- mation Processing Systems (NIPS) ), Long Beach, California.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing",
"authors": [
{
"first": "",
"middle": [],
"last": "R Core Team",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R Core Team. 2013. R: A Language and Environment for Statistical Computing. R Foundation for Statis- tical Computing, Vienna, Austria. http://www.R- project.org/.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Detecting readers with dyslexia using machine learning with eye tracking measures",
"authors": [
{
"first": "Luz",
"middle": [],
"last": "Rello",
"suffix": ""
},
{
"first": "Miguel",
"middle": [],
"last": "Ballesteros",
"suffix": ""
}
],
"year": 2015,
"venue": "Web for All Conference",
"volume": "16",
"issue": "",
"pages": "1--16",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Luz Rello and Miguel Ballesteros. 2015. Detecting readers with dyslexia using machine learning with eye tracking measures. In Web for All Conference, pages 16:1-16:8, Florence, Italy.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "The annotated transformer",
"authors": [
{
"first": "Alexander",
"middle": [],
"last": "Rush",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of Workshop for NLP Open Source Software (NLP-OSS)",
"volume": "",
"issue": "",
"pages": "52--60",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexander Rush. 2018. The annotated transformer. In Proceedings of Workshop for NLP Open Source Software (NLP-OSS), pages 52-60, Melbourne, Aus- tralia.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Shakespeare's sonnets",
"authors": [
{
"first": "William",
"middle": [],
"last": "Shakespeare",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William Shakespeare. 1997. Shakespeare's son- nets. http://www.gutenberg.org/ebooks/1041 (2019/10/24).",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Dyslexia (specific reading disability)",
"authors": [
{
"first": "Sally",
"middle": [
"E"
],
"last": "Shaywitz",
"suffix": ""
},
{
"first": "Bennett",
"middle": [
"A"
],
"last": "Shaywitz",
"suffix": ""
}
],
"year": 2005,
"venue": "Biological Psychiatry",
"volume": "57",
"issue": "11",
"pages": "1301--1309",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sally E. Shaywitz and Bennett A. Shaywitz. 2005. Dyslexia (specific reading disability). Biological Psychiatry, 57(11):1301-1309.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Sequence to sequence learning with neural networks",
"authors": [
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Quoc",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2014,
"venue": "Advances in Neural Information Processing Systems (NIPS)",
"volume": "",
"issue": "",
"pages": "3104--3112",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ilya Sutskever, Oriol Vinyals, and Quoc V. Le. 2014. Sequence to sequence learning with neural networks. In Advances in Neural Information Processing Sys- tems (NIPS), pages 3104-3112. Curran Associates, Inc., Red Hook, NY.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Attention is all you need",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Niki",
"middle": [],
"last": "Parmar",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Llion",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Aidan",
"middle": [
"N"
],
"last": "Gomez",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Polosukhin",
"suffix": ""
}
],
"year": 2017,
"venue": "Advances in Neural Information Processing Systems (NIPS)",
"volume": "",
"issue": "",
"pages": "5998--6008",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141 ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in Neural Information Pro- cessing Systems (NIPS), pages 5998-6008. Curran Associates, Inc., Red Hook, NY.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Optimizing statistical machine translation for text simplification",
"authors": [
{
"first": "Wei",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Courtney",
"middle": [],
"last": "Napoles",
"suffix": ""
},
{
"first": "Ellie",
"middle": [],
"last": "Pavlick",
"suffix": ""
},
{
"first": "Quanze",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Callison-Burch",
"suffix": ""
}
],
"year": 2016,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "4",
"issue": "",
"pages": "401--415",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wei Xu, Courtney Napoles, Ellie Pavlick, Quanze Chen, and Chris Callison-Burch. 2016. Optimizing statistical machine translation for text simplification. Transactions of the Association for Computational Linguistics, 4:401-415.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Transformer architecture overview (encoder path shown in blue, decoder in brown).",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF1": {
"text": "Distribution of word letter count across unique tokens of the Shakespeare Sonnets dataset.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF2": {
"text": "Distribution of anagram matrices across the verse collection of the Shakespeare Sonnets dataset.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF4": {
"text": "Aided by using our anagram matrix approach, migrated and non-migrated embeddings shown to preserve unedited input similarity. Presented in seven clusters produced by k-means (R Core Team, 2013).",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF5": {
"text": "Epoch-loss progression in training and validation. Loss descent subsides near the seventh epoch.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF1": {
"content": "<table><tr><td>: Model performance using automatic evalua-</td></tr><tr><td>tion measures of SARI and BLEU at a corpus level on</td></tr><tr><td>our augmented Sonnets test-set. Scores are contrasted</td></tr><tr><td>between the use of one and two dimensional context</td></tr><tr><td>window for training word embeddings.</td></tr></table>",
"num": null,
"text": "",
"type_str": "table",
"html": null
}
}
}
} |