File size: 107,665 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 | {
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:57:59.992697Z"
},
"title": "Merge and Recognize: A Geometry and 2D Context Aware Graph Model for Named Entity Recognition from Visual Documents",
"authors": [
{
"first": "Chuwei",
"middle": [],
"last": "Luo",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": "chuwei.lcw@alibaba-inc.com"
},
{
"first": "Yongpan",
"middle": [],
"last": "Wang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": ""
},
{
"first": "Qi",
"middle": [],
"last": "Zheng",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": ""
},
{
"first": "Liangcheng",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": "liangchengli@zju.edu.cn"
},
{
"first": "Feiyu",
"middle": [],
"last": "Gao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": ""
},
{
"first": "Shiyu",
"middle": [],
"last": "Zhang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": ""
},
{
"first": "Alibaba",
"middle": [],
"last": "Group",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Zhejiang University",
"location": {
"addrLine": "No.38",
"country": "Zheda Road"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Named entity recognition (NER) from visual documents, such as invoices, receipts or business cards, is a critical task for visual document understanding. Most classical approaches use a sequence-based model (typically BiLSTM-CRF framework) without considering document structure. Recent work on graph-based model using graph convolutional networks to encode visual and textual features have achieved promising performance on the task. However, few attempts take geometry information of text segments (text in bounding box) in visual documents into account. Meanwhile, existing methods do not consider that related text segments which need to be merged to form a complete entity in many real-world situations. In this paper, we present GraphNEMR, a graph-based model that uses graph convolutional networks to jointly merge text segments and recognize named entities. By incorporating geometry information from visual documents into our model, richer 2D context information is generated to improve document representations. To merge text segments, we introduce a novel mechanism that captures both geometry information as well as semantic information based on pre-trained language model. Experimental results show that the proposed GraphNEMR model outperforms both sequence-based and graph-based SOTA methods significantly.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "Named entity recognition (NER) from visual documents, such as invoices, receipts or business cards, is a critical task for visual document understanding. Most classical approaches use a sequence-based model (typically BiLSTM-CRF framework) without considering document structure. Recent work on graph-based model using graph convolutional networks to encode visual and textual features have achieved promising performance on the task. However, few attempts take geometry information of text segments (text in bounding box) in visual documents into account. Meanwhile, existing methods do not consider that related text segments which need to be merged to form a complete entity in many real-world situations. In this paper, we present GraphNEMR, a graph-based model that uses graph convolutional networks to jointly merge text segments and recognize named entities. By incorporating geometry information from visual documents into our model, richer 2D context information is generated to improve document representations. To merge text segments, we introduce a novel mechanism that captures both geometry information as well as semantic information based on pre-trained language model. Experimental results show that the proposed GraphNEMR model outperforms both sequence-based and graph-based SOTA methods significantly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "With the rapid progresses in natural language processing and computer vision, visual documents become a mainstream media for expressing abundant information. Extracting the named entities from these visual documents is a critical step for further understanding. In the perspective of traditional natural language processing, the layout and the format information of documents is discarded. Only plain text that simply consists of sequential words do the researchers focus on and are necessary to be extracted entities. However, visual documents consist of many discrete text segments with a large variety of layouts and formats as Figure 1 shows. The combination of different text segments with different positions may represent different semantic information. Without the layout structure and the 2D semantic context information in it, the named entity recognition in visual documents could be much harder.",
"cite_spans": [],
"ref_spans": [
{
"start": 631,
"end": 639,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although the named entity recognition in visual documents is a newly proposed under-researched task. Recently, in the attempt to make use of the structure information of visual documents, many works (Palm et al., 2017; Yang et al., 2017; Katti et al., 2018; Liu et al., 2018; Qian et al., 2019; Denk and Reisswig, 2019; Zhao et al., 2019) have designed NLP/CV/NLPCV based methods for visual-documents-related tasks. These approaches mostly focus on the coordinate of text segments to make features or learn embeddings. However, most of these methods do not consider the two problems:",
"cite_spans": [
{
"start": 199,
"end": 218,
"text": "(Palm et al., 2017;",
"ref_id": "BIBREF17"
},
{
"start": 219,
"end": 237,
"text": "Yang et al., 2017;",
"ref_id": "BIBREF24"
},
{
"start": 238,
"end": 257,
"text": "Katti et al., 2018;",
"ref_id": "BIBREF8"
},
{
"start": 258,
"end": 275,
"text": "Liu et al., 2018;",
"ref_id": "BIBREF14"
},
{
"start": 276,
"end": 294,
"text": "Qian et al., 2019;",
"ref_id": "BIBREF19"
},
{
"start": 295,
"end": 319,
"text": "Denk and Reisswig, 2019;",
"ref_id": "BIBREF1"
},
{
"start": 320,
"end": 338,
"text": "Zhao et al., 2019)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. Existing models often ignore the geometric information between text segments which is crucial for constructing 2D context for visual documents to extract named entities. It is hard to analyze the semantic meaning only through the plain text inside the bounding box and its coordinates. 2. Because of the layout design, a complete named entity may be separated into several segments and cannot represent its full meaning. Meanwhile, some of text segments may lose the semantic information of their prefix ones and get incorrect tagging results. It is necessary and important to merge text segments into a complete named entity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Specifically, for the first problem, as illustrated in Figure 1 , it is hard to tell whether \"\u4f1a\u9526\"(\"HuiJin\") in text segment 1 is a named entity only according to its own plain text. While according to some of the nearest text segments, \"\u79d8\u4e66\u957f\"(\"Secretary General\") in text segment 2 and \"\u521b\u59cb\u4eba\"(\"The Founder\") in text segment 3, human can help infer that text segment 1 is a person entity.",
"cite_spans": [],
"ref_spans": [
{
"start": 55,
"end": 63,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "For the second, as Figure 1 shows, neither text segment 4 nor text segment 6 is a complete named entity. However, the two segments (segment 4 and segment 6) together represent a complete location entity that is 6/F, Middle Block, Huijin World Trade Center, at the intersection of Fengqi Road and Yan'an Road, Xihu District, Hangzhou, Zhejiang, China. Apparently, the ability to merge text segments into a complete entity is important for NER from visual document.",
"cite_spans": [],
"ref_spans": [
{
"start": 19,
"end": 27,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To solve the above two problems, in this paper, we propose GraphNEMR, a graph neural end-to-end joint model for named entity recognition and merging tokens into named entities from visual documents. GraphNEMR incorporates the geometric information with the semantics to automatically extract nonsequential context-aware hidden features for each text segments in the visual documents. Specifically, We regard a visual document as a graph structure and all text segments in it are the graph nodes. The geometric information is represented by the adjacency matrix of the graph. In each text segment, a BiLSTM structure is used to sequentially encode tokens to represent semantic features. Then the graph convolutional network (GCN) (Kipf and Welling, 2017) encoder integrates information between neighbor nodes to learn the final representation of each text segment. Then the representations are used as the inputs of the merge module we proposed to decide the relation between text segments. After GCN encoder and the merge module, a LSTM+CRF decoder is used to get the named entity tagging. Our main contributions of this paper are as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 To address the visual text merge problem, we propose a general method that captures the geometry information and semantics information. To the best of our knowledge, our approach is the first work to merge tokens in different text segments into complete named entity in visual documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose the 8-geometry neighbors relation for each text bounding boxes in visual documents to represent geometry information in merge layer. Meanwhile, we design a geometry-distance-related adjacency matrix for graph representation with GCN.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose a loss called Loss nsp/sop for semantically supervising merging text segments. Furthermore, we can obtain the right prefix semantic information for each text segments via merging results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Extensive experiments show that our model outperforms both the strong sequence-based baseline model (BiLSTM-CRF) and the SOTA graph-based model (GraphIE) in visual document named entity recognition task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our model builds on recent research of information extraction in visual documents and nested named entity recognition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Recently, there is a lot interest in the task of information extraction in visual documents. Most of these works combined approaches from NLP, CV and document analysis. Lample et al. (2016) propose model BiLSTM-CRF that is a strong and a wildly used baseline for NER. Many researchers apply BiLSTM-CRF directly in visual information extraction without structure information consideration. Palm et al. (2017) use the sequential recurrent neural network (RNN) to extract key-value information from invoices. Their work shows the ability of neural network approach for extracting information in visual documents. However, their RNN model also treats documents as sequential text. Yang et al. (2017) consider document information extraction as a pixel-wise segmentation task and applied a end-to-end multimodal network to in visual documents. Their experiments showed that the textual features help layout segmentation. Katti et al. (2018) try to preserves visual documents' 2D layout by incorporating coordinate of characters for information extraction from invoices. Zhao et al. (2019) also found that in documents key information extraction, spatial information plays intrinsic roles. Denk and Reisswig (2019) extended the work of (Katti et al., 2018) to incorporate contextualized embedding by BERT language model and Xu et al. (2019) propose a pre-trained LayoutLM with the text and coordinates of text segments as inputs. They showed the effectiveness of using a pre-trained language model to invoice information extraction. Based on graph convolution network (GCN), Qian et al. (2019) and Liu et al. (2018) introduced the graph-based model that integrate textual and position attribute (i.e., coordinate, font size) to do visual information extraction task. They show that graph-based model outperforms the sequence-based baseline BiLSTM-CRF and confirms the benefits of using layout structure in visual information extraction.",
"cite_spans": [
{
"start": 169,
"end": 189,
"text": "Lample et al. (2016)",
"ref_id": "BIBREF11"
},
{
"start": 677,
"end": 695,
"text": "Yang et al. (2017)",
"ref_id": "BIBREF24"
},
{
"start": 1065,
"end": 1083,
"text": "Zhao et al. (2019)",
"ref_id": "BIBREF25"
},
{
"start": 1318,
"end": 1334,
"text": "Xu et al. (2019)",
"ref_id": "BIBREF23"
},
{
"start": 1569,
"end": 1587,
"text": "Qian et al. (2019)",
"ref_id": "BIBREF19"
},
{
"start": 1592,
"end": 1609,
"text": "Liu et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The task of nested NER (Finkel and Manning, 2009) focuses on recognizing entities that can be nested within each other. This can be considered as related problems to ours on how to merge text segments in visual document. Recently, a number of approaches have been proposed for nested NER (Ju et al., 2018; Wang and Lu, 2018; Fisher and Vlachos, 2019) . Specifically, Fisher and Vlachos (2019) decomposes nested NER into two stages, that first merge tokens into entities and then do recognition. But compared with our merging tokens problems, their approaches applied on serialized 1-D text instead of visual documents.",
"cite_spans": [
{
"start": 23,
"end": 49,
"text": "(Finkel and Manning, 2009)",
"ref_id": "BIBREF3"
},
{
"start": 288,
"end": 305,
"text": "(Ju et al., 2018;",
"ref_id": "BIBREF7"
},
{
"start": 306,
"end": 324,
"text": "Wang and Lu, 2018;",
"ref_id": "BIBREF21"
},
{
"start": 325,
"end": 350,
"text": "Fisher and Vlachos, 2019)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "As we can see, 2D layout documents features is crucial for most existing work on visual documents information extraction. These models however simply equipped position features (i.e., absolute/relative coordinate) but ignore the geometry of neighbourhood and geometry distance information. Inevitably, simply combining position features with neural models may help little with 2D semantic context, as the layout of the different document varies a lot. And in many cases, text segments should be merged to represent a complete named entity. Thus we are thus motivated to look into the relative geometry of neighbourhood, exploring how to integrate geometry distance to build better 2D semantic context of each text segments and researching on how to merge text segments into complete named entity in visual documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "3 Proposed Model",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Text segments (characters in text segments and the bounding box position coordinates of the text segments) of a visual document are acquired by an OCR engine. Mathematically, let a visual document be D = (t 0 , t 1 , ..., t n ), where t i stands for a text segments and n is the number of text segments in the visual document D. An overview of our proposed model is illustrated in Figure 2 . Firstly, we model a visual document D as a weighted fully connected graph by a graph convolution network encoder into ge-ometry&2D context aware hidden representations, where each text segments t i is the node of the graph. Secondly, given these hidden representations, a merge layer is applied to infer text segments merge decision. Lastly, we combine the graph hidden representations with merge information to reconstruct the ",
"cite_spans": [],
"ref_spans": [
{
"start": 381,
"end": 389,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Overview",
"sec_num": "3.1"
},
{
"text": "Given a text segment t i , let the text in t i be S",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "t i = (w i 1 , w i 2 , ..., w i k i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where k i stands for the length of S t i and w i j is the j-th character in sequence S t i .We first use Bi-LSTM to calculate sequential text embeddings:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h (t i ) 1:k i = BiLST M (S t i )",
"eq_num": "(1)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where h",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "(t i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "1:k i denotes the hidden states. We then use the last hidden states h",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "(t i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "k i to represent the text sequence. To encode basic 2D information, relative coordinates and relative text segment size are concatenated to text embeddings. So the hidden representation node t i is defined as follows,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "e (t i ) = [h (t i ) k i , x (t i ) \u2212 x min s , y (t i ) \u2212 y min s , w (t i ) s , h (t i ) s ]",
"eq_num": "(2)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where x (t i ) and y (t i ) are x-coordinate and y-coordinate of text segments respectively, x min and y min are the circumscribed square's minimum xy-coordinates of all text segments' bounding boxes, s is the side length of the circumscribed square. Then, a graph convolution is applied to capture 2D context and geometry features from input embeddings that contain text and position information. Intuitively, from the perspective of 2D context, the closer the distance between text segments, the stronger the relevant information they represents. Different from exist gcn-based methods that use mean/max aggregation, to better build a 2D context with geometry information considered, we utilize the distance between text segments as a weighted aggregation information. For node t i , our model retrieves new node features as follows,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "g l+1 t i = ReLU ( t j \u2208D \u03b1 ij (W l+1 g l t j + b l+1 ))",
"eq_num": "(3)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where g l t j \u2208 R f denotes the hidden feature of node t j at layer l, W l+1 and b l+1 are learnable weights. Our model aggregates information from the neighbors of each node by the weight \u03b1 ij that is denoted as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u03b1 ij = (s \u2212 d ij ) s",
"eq_num": "(4)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where the d ij = |t i , t j | is the geometry distance between t i and t j . Intuitively, the closer the distance between t i and t j , the greater the value of \u03b1 ij . Thus, by using this weighted aggregation, closer relevant information between text segments can be encoded.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "Since our GCN layer propagates information between nodes by every connected nodes with distancebased weight to construct 2D context. And the node embedding consist of semantics and geometry information. After we do graph convolution by L layers, each node t i can capture both 2D context and geometry information. So, given document D, after getting each node hidden representations by our encoder, we get tensor D g of shape",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "[n, f ], D g = [g L t 0 , g L t 1 , ..., g L tn ]",
"eq_num": "(5)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "3.3 Merge Layer Figure 3 : 8-geometry neighbors relation from Text segment",
"cite_spans": [],
"ref_spans": [
{
"start": 16,
"end": 24,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "i (t i ) to Text segment i (t j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "The merge layer is responsible for merging text segments into a complete entity. Intuitively, one text segment can only be merged with its nearest text segments of 8-geometry neighborhoods. We obtain relative position between two text segments by 8-geometry neighbors. Given a text segment t i with its bounding box area p t i , its 8-geometry neighbors areas are defined as a set P",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "t i = {p t i lef t\u2212up , p t i up , p t i right\u2212up , p t i right , p t i right\u2212down , p t i down , p t i lef t\u2212down , p t i lef t }",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where represent the left-up, up, right-up, right, right-down, down, left-down and left area of t i respectively in visual document D. Given another text segment t j with its bounding box area p t j , then the geometry position relation p t i :t j can be denoted by a 9-dim-one-hot vector where the first eight dimensions stand for 8-geometry neighbors and the last dimension represent the self-area of given text segments. Notice that p t j may intersect with more than one area in P t i , we choose the area which has the largest intersection with p t j . For example in Figure 3 , the size of the intersecting area between text segments t j and p t i down is larger than the others, the relation from t i to t j is down. Following encoder, by tiling and expanding dim on D g with p t i :t j being added, we have",
"cite_spans": [],
"ref_spans": [
{
"start": 572,
"end": 580,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "D M = \uf8ee \uf8ef \uf8ef \uf8ef \uf8f0 [m 00 ] [m 01 ] \u2022 \u2022 \u2022 [m 0n ] [m 10 ] [m 11 ] \u2022 \u2022 \u2022 [m 1n ] . . . . . . . . . . . . [m n0 ] [m n1 ] \u2022 \u2022 \u2022 [m nn ] \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fb = [[m ij ]]",
"eq_num": "(6)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "m ij = [g L t i , p t i :t j , g L t j ]",
"eq_num": "(7)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "D M \u2208 R n\u00d7n\u00d7(2f +9) denotes all nodes pair features, m ij \u2208 R 2f +9 is the concatenation of g L t i , p t i :t j and g L t j .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "Then, a fully-connected network with sigmoid activation function is applied to learn a merge matrix M f as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "M f = F C(D M )",
"eq_num": "(8)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where M f \u2208 R n\u00d7n represents whether two text segments should be merged and which text segment is the front segment. Here, the merge decisions are trained using cross entropy (CE) loss:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Loss m = CE(M f \u2022 M k , M f label )",
"eq_num": "(9)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where M f label is the label of M f with binary value of 0 or 1. M k is also a binary matrix where M k [i, j] == 1 means that t j is one of the top k nearest text segments from one of t i 's 8-geometry neighbors. By doing \u2022 (dot product operation) between M f and M k , only the top k nearest text segments in each 8-geometry neighbors can be merged. During inference, for example, if M f [i, j] == 1, it means that text segment t i should be merged with t j and t i is in front of t j . M f [i, j] == 0 means t i and t j should not be merged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "To leverage sequential language semantics, inspired by the next sentence prediction (NSP) training in BERT (Devlin et al., 2019) and sentence-order prediction (SOP) training in ALBERT (Lan et al., 2019) , we propose a loss called Loss nsp/sop for semantically supervising merging text segments as follows,",
"cite_spans": [
{
"start": 107,
"end": 128,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF2"
},
{
"start": 184,
"end": 202,
"text": "(Lan et al., 2019)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Loss nsp/sop = \u2212LM nsp/sop (D \u00d7 M f )",
"eq_num": "(10)"
}
],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "where LM nsp/sop is the pre-trained language model that use NSP or SOP training. \u00d7 represents matrix multiplication. The language model's parameters are fixed during training. By doing matrix multiplication between D and M f , we can get the pair that our model hope to be merged in equation 8. The BERT model then get the pairwise input and by maximizing Loss nsp/sop , the parameters of our model will be upgraded to make the merge decision in language model's perspective.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Geometry&2D Context Feature Encoder",
"sec_num": "3.2"
},
{
"text": "The last NER Decoder is for named entity tagging. The structure is a standard LSTM+CRF. But different from previous works that use LSTM+CRF for tagging, we utilize the front text segment information that we get from Merge Layer as an initial state Init (t i ) for LSTM+CRF, for every node in D,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h t i lstm = LST M (u (t i ) 1:k i , Init (t i ) )",
"eq_num": "(11)"
}
],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "u (t i ) 1:k i = [h t i 1 |g L t i , h t i 2 |g L t i , ..., h t i k i |g L t i ]",
"eq_num": "(12)"
}
],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "where h t i lstm is the hidden state of LSTM.| is the concatenate operation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "Init (t i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "is the initial state for the LSTM that is denoted as follows,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Init (t i ) = \uf8f1 \uf8f2 \uf8f3 g L t j if(M f [i, j] == 1) 0 otherwise,",
"eq_num": "(13)"
}
],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "where we can easily get the front text segment by doing matrix multiplication between D g and M f to get",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "Init (t i ) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "Then, a conditional random fields (CRF) is applied to perform entity tagging,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Loss crf = CRF (h t i lstm )",
"eq_num": "(14)"
}
],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "Finally, the objective function to be optimized is as follows,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "Loss = Loss m + Loss nsp/sop + Loss crf",
"eq_num": "(15)"
}
],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "In this way, the geometry information and 2D context is encoded into to our model's hidden layer, and with the Merge Layer and the last decoder, our model perform merge and recognize in visual documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NER Decoder",
"sec_num": "3.4"
},
{
"text": "We first introduce the datasets for evaluating our proposed model. Then we describe baselines we compared with, the evaluation metrics and briefly explain our implementation details. Next, we show the results for two datasets. Finally, we demonstrate the improved effect of our model via ablation study.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "The aim of ICDAR 2019 SROIE task3 1 is to extract different kinds of text of several keys which are company, address, date and total from given receipts. The SROIE dataset consists of 1,000 scanned receipt images. Since the annotation of this task is incomplete and not well applied to our problem, we relabeled all the named entities in this dataset and get the text and corresponding bounding boxes according to the ground truth OCR annotations of SROIE. We build the dataset as SROIE-VNER. Our goal is to extract all the named entities (location, organization, date) in SROIE's receipt images. For our relabeled SROIE-VNER dataset, we split the dataset in 70% for training, 30% for testing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Dataset",
"sec_num": "4.1"
},
{
"text": "The BCD dataset consists of 13,498 real-world business card images that is much larger than SROIE-VNER dataset. The collection is provided by user-uploading. We get the text and corresponding bounding boxes with Alibaba's OCR API 2 . Each character in text is manually labelled with B/I/E named entity tagging. Our goal is to extract all named entities (person, organization, location) in business card images. Business card styles of different companies are usually different and they are in large layout variability. So the layout of the images in the BCD dataset is more diverse than the SROIE-VNER dataset. 80% images in BCD dataset are used as training data. The left 20% images in BCD dataset are used for testing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Dataset",
"sec_num": "4.1"
},
{
"text": "We implement BiLSTM-CRF as a sequential tagger baseline as many researchers do in invoice/receipt images information extraction. According to (Palm et al., 2017) and (Liu et al., 2018) , text segments in a document are concatenated from left to right and from top to bottom. And then they apply BiLSTM-CRF model to the concatenated document. We also compared our model to a graph-based tagging model GraphIE (Qian et al., 2019) which is probably the SOTA graph-based model in visual information extraction.",
"cite_spans": [
{
"start": 142,
"end": 161,
"text": "(Palm et al., 2017)",
"ref_id": "BIBREF17"
},
{
"start": 166,
"end": 184,
"text": "(Liu et al., 2018)",
"ref_id": "BIBREF14"
},
{
"start": 408,
"end": 427,
"text": "(Qian et al., 2019)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Baselines and Evaluation Metrics",
"sec_num": "4.2"
},
{
"text": "The evaluation metrics are the standard named entity recognition precision, recall and F1 score. However, even if the tags of each text segments are completely correct, it cannot achieve extracting the complete entity correctly due to the order of the text segments. The traditional NER CoNLL evaluation method can not cover this problem. For example in Figure 4 , assuming that entity tags in text segments 1-4 are correct. It is difficult for humans to determine whether the order (1,2,3,4) or the order (1,3,2,4) is right. And without the right order, we can not extract the right complete named entity. To address this problem, we evaluate the precision, recall and F1 score on complete entities recognition.",
"cite_spans": [],
"ref_spans": [
{
"start": 354,
"end": 362,
"text": "Figure 4",
"ref_id": null
},
{
"start": 483,
"end": 492,
"text": "(1,2,3,4)",
"ref_id": "FIGREF0"
},
{
"start": 506,
"end": 515,
"text": "(1,3,2,4)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Figure 4: Example text segments in a visual document",
"sec_num": null
},
{
"text": "We calculate the distance between text segments and determine whether the two regions intersect by the Shapely Python package 3 . For LSTM in our model, the dimension of hidden state is 256. The 300dimensional pre-trained fasttext English word embeddings are used in SROIE-VNER experiments and 300-dimensional pre-trained fasttext Chinese character embeddings are used in BCD experiments. We use an one-layer GCN that is the same with GraphIE and the hidden size is 256. For language model for supervision, we utilize the sentence-order prediction (SOP) of ALBERT. Table 1 shows the precision, recall, and F1 score of the tagging results in SROIE-VNER dataset and BCD dataset for BiLSTM-CRF, GraphIE, and GraphNEMR. In SROIE-VNER dataset, both graph-based model GraphIE and our GraphNEMR have over 5.7% improvement compared to the sequential-based BiLSTM-CRF model. But from named entity character tagging results, GraphNEMR * dose not have significant improvement over GraphIE. In BCD dataset, which has a large diversity of layouts, GraphNEMR further surpasses GraphIE by 5.34% and yields 10.60% improvement over BiLSTM-CRF. Table 2 : Visual documents NER results, evaluating on complete entities recognition. Table 2 presents the comparisons of our model with the sequence-based model and the graph-based model on complete named entities recognition. Intuitively, this is a more suitable evaluation method for visual documents related tasks. Since GraphIE model doesn't have the ability to merge text segments, on this evaluating method, the LOC result of GraphIE has dropped significantly in SROIE-VNER dataset. Sequence-based model BiLSTM-CRF merges the text from left-to-right and from up-to-down and our model GraphNEMR * learns to merge. GraphNEMR * significantly outperforms the sequencebased model BiLSTM-CRF by 6.02% and the graph-based model GraphIE by 21.52% separately. In BCD dataset, GraphNEMR also obtains significant improvements over BiLSTM-CRF by 9.94% and GraphIE by 8.91%.",
"cite_spans": [],
"ref_spans": [
{
"start": 565,
"end": 572,
"text": "Table 1",
"ref_id": null
},
{
"start": 1127,
"end": 1134,
"text": "Table 2",
"ref_id": null
},
{
"start": 1212,
"end": 1219,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Implementation Details",
"sec_num": "4.3"
},
{
"text": "From the dataset perspective, the layout of SROIE-VNER dataset is relatively simple. But many text segments need to be merged. The BCD dataset is quite different from SROIE-VNER. Since the style of each business card image is quite different, the BCD dataset has large layout varieties and also many text segments that need to be merged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Analysis",
"sec_num": "4.5"
},
{
"text": "Since the sequence-based BiLSTM-CRF concatenate text segments in a document based on a common order which many layouts follow in real-world situations. So in SROIE-VNER dataset that is in a relatively simple layout, no matter what evaluation methods, the sequence-based BiLSTM-CRF can achieve relatively stable and comparable results. But the order that is from left-to-right and from top-to-bottom may not be guaranteed. The sequence order of entities like location and organization that often appear as multiple lines or multiple text segments are broken by such concatenations. So in BCD dataset that is in large varieties layouts, the performance of the sequence-based model suffers from significant performance degradation. Entities that usually have a short text length and in most cases are in left-to-right order in single text segment, i.e. person, are not influenced by concatenations and can keep a relatively stable performance in different layout varieties. Table 4 : Ablation study (\"-\" means removing the sub-component from GraphNEMR.",
"cite_spans": [],
"ref_spans": [
{
"start": 971,
"end": 978,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Analysis",
"sec_num": "4.5"
},
{
"text": "In BCD dataset, visual documents have diverse layouts and many text segments need to be merged. Because graph-based models take the visual layout into account, both GraphIE and GraphNEMR * achieve better results on visual documents with diverse layout changes than sequence-based model BiLSTM-CRF. So under these circumstances, the gap between our proposed GraphNEMR * and GraphIE mainly comes from the geometry features. While the visual documents in SROIE-VNER have simple layouts and a lot of text segments need to be merged, both GraphNEMR * and GraphIE have a better performance than BiLSTM-CRF in character tagging results. Since GraphIE doesn't have the ability of mergence and BiLSTM-CRF uses a naive merging strategy, GraphNEMR * performs much better than other models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Analysis",
"sec_num": "4.5"
},
{
"text": "We also evaluate the impact of different numbers of k nearest text segments from 8-geometry neighbors. In theory, a text segment wouldn't be merged with a long-distance text segment. And a text segment will not only be merged with its nearest neighbors. Table 3 presents the results of using different k nearest text segments from 8-geometry neighbors. As we can see, using all text segments as candidates do not help the merging task and only setting the nearest neighbors as merging candidates will hurt the model performance.",
"cite_spans": [],
"ref_spans": [
{
"start": 254,
"end": 261,
"text": "Table 3",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Analysis",
"sec_num": "4.5"
},
{
"text": "To better understand the contributions of each sub-component of GraphNEMR, we perform ablation studies in BCD dataset. Table 4 presents the results. In each study, we exclude the relative location, geometry information in merge layer and the use of the pre-trained ALBERT language model as Loss nsp/sop to supervise sentence order respectively. As we can see that the geometry information plays a more important role than others. The semantic Loss nsp/sop is also very helpful for recognize complete named entities. Intuitively, with the 8-geometry neighbors information considered, a richer 2D context and layout information is provided to better merge and recognize named entities.",
"cite_spans": [],
"ref_spans": [
{
"start": 119,
"end": 126,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Ablation Study",
"sec_num": "4.6"
},
{
"text": "In this paper, we propose GraphNEMR, a graph-based model that uses graph convolutional networks to jointly merge text segments and recognize named entities from visual documents. We model the visual document as a graph and incorporate geometry information into graph convolution network to build richer 2D context. To address the problem that text segments need to be merged into a complete entity, we combine geometry features with semantic features for learning to merge and recognize named entities. We evaluate our model on relabeled SROIE-VNER dataset and a real-world BCD dataset. Results show that our model outperforms sequence-based model (BiLSTM-CRF) and graph-based model (GraphIE) for named entity recognition from visual documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "https://rrc.cvc.uab.es/?ch=13&com=evaluation&task=3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://duguang.aliyun.com/ 3 https://shapely.readthedocs.io/en/stable/manual.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Enriching word vectors with subword information",
"authors": [
{
"first": "Piotr",
"middle": [],
"last": "Bojanowski",
"suffix": ""
},
{
"first": "Edouard",
"middle": [],
"last": "Grave",
"suffix": ""
},
{
"first": "Armand",
"middle": [],
"last": "Joulin",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2017,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "5",
"issue": "",
"pages": "135--146",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching word vectors with subword information. Transactions of the Association for Computational Linguistics, 5:135-146.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Bertgrid: Contextualized embedding for 2d document representation and understanding",
"authors": [
{
"first": "I",
"middle": [],
"last": "Timo",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Denk",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Reisswig",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Timo I Denk and Christian Reisswig. 2019. Bertgrid: Contextualized embedding for 2d document representation and understanding.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Bert: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. Bert: Pre-training of deep bidirec- tional transformers for language understanding. In NAACL.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Nested named entity recognition",
"authors": [
{
"first": "Jenny",
"middle": [
"Rose"
],
"last": "Finkel",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "141--150",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jenny Rose Finkel and Christopher D Manning. 2009. Nested named entity recognition. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1-Volume 1, pages 141-150. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Merge and label: A novel neural network architecture for nested ner",
"authors": [
{
"first": "Joseph",
"middle": [],
"last": "Fisher",
"suffix": ""
},
{
"first": "Andreas",
"middle": [],
"last": "Vlachos",
"suffix": ""
}
],
"year": 2019,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joseph Fisher and Andreas Vlachos. 2019. Merge and label: A novel neural network architecture for nested ner. In ACL.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Graphrel: Modeling text as relational graphs for joint entity and relation extraction",
"authors": [
{
"first": "Tsu-Jui",
"middle": [],
"last": "Fu",
"suffix": ""
},
{
"first": "Peng-Hsuan",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Wei-Yun",
"middle": [],
"last": "Ma",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1409--1418",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tsu-Jui Fu, Peng-Hsuan Li, and Wei-Yun Ma. 2019. Graphrel: Modeling text as relational graphs for joint entity and relation extraction. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 1409-1418.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Visual-linguistic methods for receipt field recognition",
"authors": [
{
"first": "Rinon",
"middle": [],
"last": "Gal",
"suffix": ""
},
{
"first": "Nimrod",
"middle": [],
"last": "Morag",
"suffix": ""
},
{
"first": "Roy",
"middle": [],
"last": "Shilkrot",
"suffix": ""
}
],
"year": 2018,
"venue": "Asian Conference on Computer Vision",
"volume": "",
"issue": "",
"pages": "542--557",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rinon Gal, Nimrod Morag, and Roy Shilkrot. 2018. Visual-linguistic methods for receipt field recognition. In Asian Conference on Computer Vision, pages 542-557. Springer.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "A neural layered model for nested named entity recognition",
"authors": [
{
"first": "Meizhi",
"middle": [],
"last": "Ju",
"suffix": ""
},
{
"first": "Makoto",
"middle": [],
"last": "Miwa",
"suffix": ""
},
{
"first": "Sophia",
"middle": [],
"last": "Ananiadou",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "1446--1459",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meizhi Ju, Makoto Miwa, and Sophia Ananiadou. 2018. A neural layered model for nested named entity recog- nition. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 1446-1459.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Chargrid: Towards understanding 2d documents",
"authors": [
{
"first": "Christian",
"middle": [],
"last": "Anoop Raveendra Katti",
"suffix": ""
},
{
"first": "Cordula",
"middle": [],
"last": "Reisswig",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Guder",
"suffix": ""
},
{
"first": "Steffen",
"middle": [],
"last": "Brarda",
"suffix": ""
},
{
"first": "Johannes",
"middle": [],
"last": "Bickel",
"suffix": ""
},
{
"first": "Jean",
"middle": [],
"last": "H\u00f6hne",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Baptiste Faddoul",
"suffix": ""
}
],
"year": 2018,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anoop Raveendra Katti, Christian Reisswig, Cordula Guder, Sebastian Brarda, Steffen Bickel, Johannes H\u00f6hne, and Jean Baptiste Faddoul. 2018. Chargrid: Towards understanding 2d documents. In EMNLP.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Semi-supervised classification with graph convolutional networks",
"authors": [
{
"first": "N",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Max",
"middle": [],
"last": "Kipf",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Welling",
"suffix": ""
}
],
"year": 2017,
"venue": "International Conference on Learning Representations (ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR).",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Dot-net: Document layout classification using texture-based cnn",
"authors": [
{
"first": "Chandra",
"middle": [],
"last": "Sai",
"suffix": ""
},
{
"first": "Mohammed",
"middle": [],
"last": "Kosaraju",
"suffix": ""
},
{
"first": "Nelson",
"middle": [
"Zange"
],
"last": "Masum",
"suffix": ""
},
{
"first": "Pritesh",
"middle": [],
"last": "Tsaku",
"suffix": ""
},
{
"first": "Tanju",
"middle": [],
"last": "Patel",
"suffix": ""
},
{
"first": "Girish",
"middle": [],
"last": "Bayramoglu",
"suffix": ""
},
{
"first": "Mingon",
"middle": [],
"last": "Modgil",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kang",
"suffix": ""
}
],
"year": 2019,
"venue": "2019 International Conference on Document Analysis and Recognition (ICDAR)",
"volume": "",
"issue": "",
"pages": "1029--1034",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sai Chandra Kosaraju, Mohammed Masum, Nelson Zange Tsaku, Pritesh Patel, Tanju Bayramoglu, Girish Modgil, and Mingon Kang. 2019. Dot-net: Document layout classification using texture-based cnn. In 2019 Interna- tional Conference on Document Analysis and Recognition (ICDAR), pages 1029-1034. IEEE.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Neural architectures for named entity recognition",
"authors": [
{
"first": "Guillaume",
"middle": [],
"last": "Lample",
"suffix": ""
},
{
"first": "Miguel",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "Sandeep",
"middle": [],
"last": "Subramanian",
"suffix": ""
},
{
"first": "Kazuya",
"middle": [],
"last": "Kawakami",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
}
],
"year": 2016,
"venue": "NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Guillaume Lample, Miguel Ballesteros, Sandeep Subramanian, Kazuya Kawakami, and Chris Dyer. 2016. Neural architectures for named entity recognition. In NAACL.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Albert: A lite bert for self-supervised learning of language representations",
"authors": [
{
"first": "Zhenzhong",
"middle": [],
"last": "Lan",
"suffix": ""
},
{
"first": "Mingda",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Goodman",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Gimpel",
"suffix": ""
},
{
"first": "Piyush",
"middle": [],
"last": "Sharma",
"suffix": ""
},
{
"first": "Radu",
"middle": [],
"last": "Soricut",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1909.11942"
]
},
"num": null,
"urls": [],
"raw_text": "Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. 2019. Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Deep learning approach for receipt recognition",
"authors": [
{
"first": "Anh Duc",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Dung",
"middle": [],
"last": "Van Pham",
"suffix": ""
},
{
"first": "Tuan",
"middle": [
"Anh"
],
"last": "Nguyen",
"suffix": ""
}
],
"year": 2019,
"venue": "International Conference on Future Data and Security Engineering",
"volume": "",
"issue": "",
"pages": "705--712",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anh Duc Le, Dung Van Pham, and Tuan Anh Nguyen. 2019. Deep learning approach for receipt recognition. In International Conference on Future Data and Security Engineering, pages 705-712. Springer.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Graph convolution for multimodal information extraction from visually rich documents",
"authors": [
{
"first": "Xiaojing",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Feiyu",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Qiong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Huasha",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2018,
"venue": "NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaojing Liu, Feiyu Gao, Qiong Zhang, and Huasha Zhao. 2018. Graph convolution for multimodal information extraction from visually rich documents. In NAACL.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "An invoice reading system using a graph convolutional network",
"authors": [
{
"first": "Devashish",
"middle": [],
"last": "Lohani",
"suffix": ""
},
{
"first": "Yolande",
"middle": [],
"last": "Bela\u00efd",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bela\u00efd",
"suffix": ""
}
],
"year": 2018,
"venue": "Asian Conference on Computer Vision",
"volume": "",
"issue": "",
"pages": "144--158",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Devashish Lohani, A Bela\u00efd, and Yolande Bela\u00efd. 2018. An invoice reading system using a graph convolutional network. In Asian Conference on Computer Vision, pages 144-158. Springer.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Hierarchical contextualized representation for named entity recognition",
"authors": [
{
"first": "Ying",
"middle": [],
"last": "Luo",
"suffix": ""
},
{
"first": "Fengshun",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2020,
"venue": "AAAI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ying Luo, Fengshun Xiao, and Hai Zhao. 2020. Hierarchical contextualized representation for named entity recognition. In AAAI.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Cloudscan-a configuration-free invoice analysis system using recurrent neural networks",
"authors": [
{
"first": "Rasmus",
"middle": [],
"last": "Berg Palm",
"suffix": ""
},
{
"first": "Ole",
"middle": [],
"last": "Winther",
"suffix": ""
},
{
"first": "Florian",
"middle": [],
"last": "Laws",
"suffix": ""
}
],
"year": 2017,
"venue": "14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"volume": "1",
"issue": "",
"pages": "406--413",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rasmus Berg Palm, Ole Winther, and Florian Laws. 2017. Cloudscan-a configuration-free invoice analysis system using recurrent neural networks. In 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR), volume 1, pages 406-413. IEEE.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Attend, copy, parse-end-to-end information extraction from documents",
"authors": [
{
"first": "Rasmus",
"middle": [],
"last": "Berg Palm",
"suffix": ""
},
{
"first": "Florian",
"middle": [],
"last": "Laws",
"suffix": ""
},
{
"first": "Ole",
"middle": [],
"last": "Winther",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXivpreprintarXiv:1812.07248"
]
},
"num": null,
"urls": [],
"raw_text": "Rasmus Berg Palm, Florian Laws, and Ole Winther. 2018. Attend, copy, parse-end-to-end information extraction from documents. In arXiv preprint arXiv:1812.07248.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Graphie: A graph-based framework for information extraction",
"authors": [
{
"first": "Yujie",
"middle": [],
"last": "Qian",
"suffix": ""
},
{
"first": "Enrico",
"middle": [],
"last": "Santus",
"suffix": ""
},
{
"first": "Zhijing",
"middle": [],
"last": "Jin",
"suffix": ""
},
{
"first": "Jiang",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Regina",
"middle": [],
"last": "Barzilay",
"suffix": ""
}
],
"year": 2019,
"venue": "NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yujie Qian, Enrico Santus, Zhijing Jin, Jiang Guo, and Regina Barzilay. 2019. Graphie: A graph-based framework for information extraction. In NAACL.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Deep learning for automatic sale receipt understanding",
"authors": [
{
"first": "Rizlene",
"middle": [],
"last": "Raoui-Outach",
"suffix": ""
},
{
"first": "Cecile",
"middle": [],
"last": "Million-Rousseau",
"suffix": ""
},
{
"first": "Alexandre",
"middle": [],
"last": "Benoit",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Lambert",
"suffix": ""
}
],
"year": 2017,
"venue": "2017 Seventh International Conference on Image Processing Theory, Tools and Applications (IPTA)",
"volume": "",
"issue": "",
"pages": "1--6",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rizlene Raoui-Outach, Cecile Million-Rousseau, Alexandre Benoit, and Patrick Lambert. 2017. Deep learning for automatic sale receipt understanding. In 2017 Seventh International Conference on Image Processing Theory, Tools and Applications (IPTA), pages 1-6. IEEE.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Neural segmental hypergraphs for overlapping mention recognition",
"authors": [
{
"first": "Bailin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Lu",
"suffix": ""
}
],
"year": 2018,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bailin Wang and Wei Lu. 2018. Neural segmental hypergraphs for overlapping mention recognition. In EMNLP.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Combining spans into entities: A neural two-stage approach for recognizing discontiguous entities",
"authors": [
{
"first": "Bailin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Lu",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bailin Wang and Wei Lu. 2019. Combining spans into entities: A neural two-stage approach for recognizing discontiguous entities.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Layoutlm: Pre-training of text and layout for document image understanding",
"authors": [
{
"first": "Yiheng",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Minghao",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Lei",
"middle": [],
"last": "Cui",
"suffix": ""
},
{
"first": "Shaohan",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Furu",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1912.13318"
]
},
"num": null,
"urls": [],
"raw_text": "Yiheng Xu, Minghao Li, Lei Cui, Shaohan Huang, Furu Wei, and Ming Zhou. 2019. Layoutlm: Pre-training of text and layout for document image understanding. arXiv preprint arXiv:1912.13318.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Learning to extract semantic structure from documents using multimodal fully convolutional neural networks",
"authors": [
{
"first": "Xiao",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Ersin",
"middle": [],
"last": "Yumer",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Asente",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Kraley",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Kifer",
"suffix": ""
},
{
"first": "C Lee",
"middle": [],
"last": "Giles",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition",
"volume": "",
"issue": "",
"pages": "5315--5324",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiao Yang, Ersin Yumer, Paul Asente, Mike Kraley, Daniel Kifer, and C Lee Giles. 2017. Learning to extract semantic structure from documents using multimodal fully convolutional neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 5315-5324.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Cutie: Learning to understand documents with convolutional universal text information extractor",
"authors": [
{
"first": "Xiaohui",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Zhuo",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Xiaoguang",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1903.12363"
]
},
"num": null,
"urls": [],
"raw_text": "Xiaohui Zhao, Zhuo Wu, and Xiaoguang Wang. 2019. Cutie: Learning to understand documents with convolu- tional universal text information extractor. arXiv preprint arXiv:1903.12363.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "Example of a visual documents: visual business card. The red rectangular boxes are different text segments.",
"type_str": "figure",
"num": null
},
"FIGREF1": {
"uris": null,
"text": "GraphNEMR Architecture sequential front state of text segments and apply LSTM+CRF for named entity recognition.",
"type_str": "figure",
"num": null
},
"TABREF0": {
"type_str": "table",
"num": null,
"html": null,
"text": "86.18 86.46 91.42 94.43 92.90 89.88 94.43 92.10 SROIE-VNER ORG 75.71 75.71 75.71 80.95 86.29 83.54 84.38 82.23 83.29 DATE 94.15 84.73 89.19 87.18 89.47 88.31 90.96 90.00 90.48 ALL 85.37 82.08 83.69 87.70 91.18 89.40 88.81 90.28 89.54 PER 85.35 88.72 87.00 83.66 94.14 88.59 94.32 93.71 94.02 BCD LOC 80.67 85.47 83.00 84.42 95.59 89.66 93.84 94.12 93.98 ORG 69.75 70.93 70.34 74.10 79.58 76.74 83.17 82.46 82.81 ALL 76.92 79.60 78.24 79.58 87.82 83.50 89.05 88.63 88.84 Table 1: Visual documents named entity character tagging results. For a fair comparison, here we use GraphNEMR * that removes the pre-trained language model Loss nsp/sop supervision in equantion (10). ORG 69.70 70.89 70.29 72.70 77.02 74.80 82.23 80.73 81.48 ALL 76.90 79.58 78.22 75.95 82.86 79.25 88.58 87.75 88.16",
"content": "<table><tr><td>dataset</td><td>Entity</td><td>P</td><td>BiLSTM-CRF R F1</td><td>P</td><td>GraphIE R</td><td>F1</td><td>P</td><td>GraphNEMR * R F1</td></tr><tr><td colspan=\"4\">LOC 86.75 dataset BiLSTM-CRF Entity P R F1</td><td>P</td><td>GraphIE R</td><td>F1</td><td>P</td><td>GraphNEMR * R F1</td></tr><tr><td/><td>LOC</td><td colspan=\"7\">86.75 86.18 86.46 55.33 42.03 47.77 90.53 94.43 92.44</td></tr><tr><td colspan=\"9\">SROIE-VNER ORG 75.71 75.71 75.71 80.95 86.29 83.54 84.38 82.23 83.29</td></tr><tr><td/><td colspan=\"8\">DATE 94.15 84.73 89.19 88.54 89.47 89.01 90.96 90.00 90.48</td></tr><tr><td/><td>ALL</td><td colspan=\"7\">85.37 82.08 83.69 72.08 64.71 68.19 89.14 90.28 89.71</td></tr><tr><td/><td>PER</td><td colspan=\"7\">85.35 88.72 87.00 83.11 92.07 87.36 94.28 93.68 93.98</td></tr><tr><td>BCD</td><td>LOC</td><td colspan=\"7\">80.67 85.47 83.00 74.53 84.05 79.00 93.64 93.86 93.75</td></tr></table>"
},
"TABREF2": {
"type_str": "table",
"num": null,
"html": null,
"text": "Results of different k nearest text segments from 8-geometry neighbors. +\u221e means using all text segments from the document.",
"content": "<table><tr><td>Model</td><td>F1</td></tr><tr><td>GraphNEMR-FULL</td><td>88.88</td></tr><tr><td>-relative location</td><td>88.49(\u2193 0.39)</td></tr><tr><td colspan=\"2\">-merge with geometry 87.48(\u2193 1.4)</td></tr><tr><td colspan=\"2\">-Loss nsp/sop supervise 88.16(\u2193 0.72)</td></tr></table>"
}
}
}
} |