IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6691354.html
   My bibliography  Save this article

Machine-Reading Comprehension for Bridge Inspection Domain by Fusing Graph Embedding

Author

Listed:
  • Fangyue Xiang
  • Hongjin Zhu
  • YuFang Sun
  • Maobo Zheng
  • Wenyong Yan

Abstract

Bridge inspection text records are very significant for the maintenance and upkeep of bridges, which can help engineers and maintenance personnel to understand the actual condition of bridges, detect and repair problems in time, and ensure the safe operation of bridges. Currently, more and more research focuses on how to extract potentially valuable bridge-related information from bridge inspection texts. In this study, we take the bridge inspection domain machine-reading comprehension corpus as the data support for model training and performance evaluation; oriented to the bridge inspection domain data text extraction machine-reading comprehension task, on the basis of word-granularity text input, we further explore two schemes of co-occurring linkage of cross-sentence entities in the context and co-occurring linkage of entities within the sentence through graph structure, and we learn and extract naming through graph-attentive neural networks-structured semantic information between entities and fused the obtained named entity embeddings with a hidden representation of the pretrained context. Tested on the bridge inspection domain dataset, the integrated model proposed in this research improves the EM optimum by 1.4% and the mean by 2.2% and the F1 optimum by 2.2% and the mean by 1.6% on the BIQA test, compared with the better-performing baseline model RoBERTa_wwm_ext.

Suggested Citation

  • Fangyue Xiang & Hongjin Zhu & YuFang Sun & Maobo Zheng & Wenyong Yan, 2025. "Machine-Reading Comprehension for Bridge Inspection Domain by Fusing Graph Embedding," Complexity, Hindawi, vol. 2025, pages 1-14, May.
  • Handle: RePEc:hin:complx:6691354
    DOI: 10.1155/cplx/6691354
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2025/6691354.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2025/6691354.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/cplx/6691354?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6691354. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.