A Formal Language for the Analysis of Graph Models and its Software Implementation
DOI:
https://doi.org/10.18372/1990-5548.85.20427Keywords:
graph models, language for analysis of graph models, semantic networks, syntactical analysis, message transition, rumor spreading processAbstract
The purpose of this paper is to develop a specialized language for processing graph data and its software implementation. The proposed solution ensures versatility, usability, and efficiency, enabling the execution of both basic graph operations and more complex procedures. The tool supports classical graph algorithms, including shortest path search, graph traversal, and minimum spanning tree construction, as well as applications in modeling and analyzing message transition processes and processing graph-based representations of textual data. A common drawback of many existing graph analysis tools—often implemented as libraries of general-purpose programming languages—is their limited usability. This limitation arises from the fact that the description of graph analysis procedures relies on data structure operations defined in terms of these general-purpose languages, which complicates perception and reduces the clarity of the mathematical methods being implemented. Developing a specialized domain-specific language based on high-level abstractions can address these shortcomings. Such a language will provide a formalized description of methods for analyzing and processing graph models, improving their comprehensibility and accessibility to users. Its software implementation will deliver ready-to-use solutions for executing graph analysis methods. Composing such methods will facilitate solving a wide range of tasks, including the analysis of natural language messages and the study of information publication and dissemination processes in online environments.
References
A. Korger, & J. Baumeister, (2021, September). Rule-based Semantic Relation Extraction in Regulatory Documents. LWDA, pp. 26–37.
M. C. De Marneffe, C. D. Manning, J. Nivre, & D. Zeman, “Universal dependencies,” Computational linguistics, 47(2), pp. 255–308, 2021. https://doi.org/10.1162/coli_a_00402
K. D'Oosterlinck, S. K. Bitew, B. Papineau, C. Potts, T. Demeester, & C. Develder, CAW-coref: Conjunction-Aware Word-level Coreference Resolution. arXiv preprint arXiv:2310.06165. https://doi.org/10.18653/v1/2023.crac-main.2
S. Schuster, & C. D. Manning, “Enhanced English universal dependencies: An improved representation for natural language understanding tasks,” Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16), 2016, May, pp. 2371–2378.
C. D. Manning, D. Christopher, M. Surdeanu, J. Bauer, J. Finkel, S. J. Bethard, and D. McClosky, “The Stanford CoreNLP Natural Language Processing Toolkit,” Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations, 2014, pp. 55–60. https://doi.org/10.3115/v1/P14-5010
Peng Qi, Yuhao Zhang, Yuhui Zhang, Jason Bolton and Christopher D. Manning, "Stanza: A Python Natural Language Processing Toolkit for Many Human Languages," Association for Computational Linguistics (ACL) System Demonstrations, 2020. https://doi.org/10.18653/v1/2020.acl-demos.14
K. Dong, A. Sun, J. J. Kim, & X. Li, “Syntactic multi-view learning for open information extraction,” 2022. arXiv preprint arXiv:2212.02068. https://doi.org/10.18653/v1/2022.emnlp-main.272
G. Angeli, M. J. J. Premkumar, & C. D. Manning, “Leveraging linguistic structure for open domain information extraction,” Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (vol. 1: Long Papers), 2015, pp. 344–354. https://doi.org/10.3115/v1/P15-1034
, P. Heyvaert, B. De Meester, A. Dimou, & R. Verborgh, “Declarative rules for linked data generation at your fingertips!,” The Semantic Web: ESWC 2018 Satellite Events: ESWC 2018 Satellite Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers 15 (pp. 213–217). Springer International Publishing. https://doi.org/10.1007/978-3-319-98192-5_40
D. Van Assche, T. Delva, P. Heyvaert, B. De Meester, & A. Dimou, “Towards a more human-friendly knowledge graph generation & publication,” ISWC2021, The International Semantic Web Conference, vol. 2980, 2021. CEUR.
Guillaume Plique, “Graphology, a robust and multipurpose Graph object for JavaScript,” Zenodo, Published December 11, 2021 | Version 0.23.2-lib
D. Li, H. Mei, Y. Shen, S. Su, W. Zhang, J. Wang, M. Zu, & W. Chen, “ECharts: a declarative framework for rapid construction of web-based visualization,” Visual Informatics, 2(2), 136–146, 2018. https://doi.org/10.1016/j.visinf.2018.04.011
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
