Digital document analytics using logistic regressive and deep transition-based dependency parsing

被引:0
|
作者
Rekha, D. [1 ]
Sangeetha, J. [1 ]
Ramaswamy, V. [1 ]
机构
[1] SASTRA Deemed Univ, Dept Comp Sci & Engn, Srinivasa Ramanujan Ctr, Kumbakonam, India
来源
JOURNAL OF SUPERCOMPUTING | 2022年 / 78卷 / 02期
关键词
Logistic regressive; Token generation; Napierian grammar; Deep learning; Transition-based; Dependency parsing; Duplex long short-term memory; CLASSIFICATION;
D O I
10.1007/s11227-021-03973-4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The selection of text features is a fundamental task and plays an important role in digital document analysis. Conventional methods in text feature extraction necessitate indigenous features. Obtaining an efficient feature is an extensive process, but a new and real-time representation of features in text data is a challenging task. Deep learning is making inroads in digital document mining. A significant distinction between deep learning and traditional methods is that deep learning learns features in a digital document in an automatic manner. In this paper, logistic regression and deep dependency parsing (LR-DDP) methods are proposed. The logistic regression token generation model generates robust tokens by means of Napierian grammar. With the robust generated tokens, a deep transition-based dependency parsing using duplex long short-term memory is designed. Experimental results demonstrate that our dependency parser achieves comparable performance in terms of digital document parsing accuracy, parsing time and overhead when compared to existing methods. Hence, these methods are found to be computationally efficient and accurate.
引用
收藏
页码:2580 / 2596
页数:17
相关论文
共 50 条
  • [31] Efficient Disfluency Detection with Transition-based Parsing
    Wu, Shuangzhi
    Zhang, Dongdong
    Zhou, Ming
    Zhao, Tiejun
    PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, 2015, : 495 - 503
  • [32] Transition-based Parsing with Stack-Transformers
    Astudillo, Ramon Fernandez
    Ballesteros, Miguel
    Naseem, Tahira
    Blodget, Austin
    Florian, Radu
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, 2020, : 1001 - 1007
  • [33] Unlexicalized Transition-based Discontinuous Constituency Parsing
    Coavoux, Maximin
    Crabbe, Benoit
    Cohen, Shay B.
    TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2019, 7 : 73 - 89
  • [34] An accurate transformer-based model for transition-based dependency parsing of free word order languages
    Zuhra, Fatima Tuz
    Saleem, Khalid
    Naz, Surayya
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2024, 36 (06)
  • [35] Enhancements on a Transition-based Approach for AMR Parsing using LSTM Networks
    Pop, Roxana
    Drcgan, Anda
    Macicasan, Florin
    Lemnaru, Camelia
    Potolea, Rodica
    2018 IEEE 14TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTER COMMUNICATION AND PROCESSING (ICCP), 2018, : 55 - 62
  • [36] Integrating Graph-Based and Transition-Based Dependency Parsers in the Deep Contextualized Era
    Falenska, Agnieszka
    Bjorkelund, Anders
    Kuhn, Jonas
    16TH INTERNATIONAL CONFERENCE ON PARSING TECHNOLOGIES AND IWPT 2020 SHARED TASK ON PARSING INTO ENHANCED UNIVERSAL DEPENDENCIES, 2020, : 25 - 39
  • [37] Structured Training for Neural Network Transition-Based Parsing
    Weiss, David
    Alberti, Chris
    Collins, Michael
    Petrov, Slav
    PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, 2015, : 323 - 333
  • [38] From text to graph: a general transition-based AMR parsing using neural network
    Min Gu
    Yanhui Gu
    Weilan Luo
    Guandong Xu
    Zhenglu Yang
    Junsheng Zhou
    Weiguang Qu
    Neural Computing and Applications, 2021, 33 : 6009 - 6025
  • [39] Rewarding Smatch: Transition-Based AMR Parsing with Reinforcement Learning
    Naseem, Tahira
    Shah, Abhishek
    Wan, Hui
    Florian, Radu
    Roukos, Salim
    Ballesteros, Miguel
    57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), 2019, : 4586 - 4592
  • [40] Inherent Dependency Displacement Bias of Transition-Based Algorithms
    Anderson, Mark
    Gomez-Rodriguez, Carlos
    PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION (LREC 2020), 2020, : 5147 - 5155