Abstract
With the development of intelligentization in maritime vessels, the pursuit of an organized and scalable knowledge storage approach for marine engine room systems has become one of the current research hotspots. This study addressed the foundational named entity recognition (NER) task in constructing a knowledge graph for marine engine rooms. It proposed an entity recognition algorithm for Chinese semantics in marine engine rooms that integrates language models. Firstly, the bidirectional encoder representation from transformers (BERT) language model is used to extract text features and obtain word-level granularity vector matrices. Secondly, the trained word embeddings are fed into a bidirectional long short-term memory network (BiLSTM) to extract contextual information. It considers the surrounding words and their sequential relationships, enabling a better understanding of the context. Additionally, the conditional random field (CRF) model was used to extract the globally optimal sequence of named entities in the marine engine room semantic. The CRF model considered the dependencies between adjacent entities that ensured a coherent and consistent final result for entity recognition in marine engine room semantics. The experiment results demonstrate that the proposed algorithm achieves superior F1 scores for all three entity types. Compared with BERT, the overall precision, recall, and F1 score of the entity recognition are improved by 1.36%, 1.41%, and 1.38%, respectively. Future research will be carried out on named entity recognition of a small sample set to provide basic support for more efficient entity relationship extraction and construction of a marine engine room knowledge graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.