Classifying sequences by combining context-free grammars and OWL ontologies
Symbolic Computation
2023-05-23 v1 Formal Languages and Automata Theory
Abstract
This paper describes a pattern to formalise context-free grammars in OWL and its use for sequence classification. The proposed approach is compared to existing methods in terms of computational complexity as well as pragmatic applicability, with examples in the music domain.
Keywords
Cite
@article{arxiv.2304.03089,
title = {Classifying sequences by combining context-free grammars and OWL ontologies},
author = {Nicolas Lazzari and Andrea Poltronieri and Valentina Presutti},
journal= {arXiv preprint arXiv:2304.03089},
year = {2023}
}
Comments
Preprint - ESWC 2023