Umeå University's logo

umu.sePublications
Change search
Link to record
Permanent link

Direct link
Publications (10 of 18) Show all publications
Tatar, K., Ericson, P., Cotton, K., Del Prado, P. T., Batlle-Roca, R., Cabrero-Daniel, B., . . . Hussain, J. (2024). A shift in artistic practices through artificial intelligence. Leonardo: Journal of the International Society for the Arts, Sciences and Technology, 293-297
Open this publication in new window or tab >>A shift in artistic practices through artificial intelligence
Show others...
2024 (English)In: Leonardo: Journal of the International Society for the Arts, Sciences and Technology, ISSN 0024-094X, E-ISSN 1530-9282, p. 293-297Article in journal (Refereed) Epub ahead of print
Abstract [en]

The explosion of content generated by artificial intelligence (AI) models has initiated a cultural shift in arts, music, and media, whereby roles are changing, values are shifting, and conventions are challenged. The vast, readily available dataset of the Internet has created an environment for AI models to be trained on any content on the Web. With AI models shared openly and used by many globally, how does this new paradigm shift challenge the status quo in artistic practices? What kind of changes will AI technology bring to music, arts, and new media?

Place, publisher, year, edition, pages
MIT Press, 2024
National Category
Arts
Research subject
Artistic research
Identifiers
urn:nbn:se:umu:diva-223036 (URN)10.1162/leon_a_02523 (DOI)
Available from: 2024-04-08 Created: 2024-04-08 Last updated: 2024-04-09
Björklund, H., Björklund, J. & Ericson, P. (2024). Tree-based generation of restricted graph languages. International Journal of Foundations of Computer Science, 35(1 & 2), 215-243
Open this publication in new window or tab >>Tree-based generation of restricted graph languages
2024 (English)In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 35, no 1 & 2, p. 215-243Article in journal (Refereed) Published
Abstract [en]

Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in O (n2 + nm) , where m and n are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the \minimal adequeate teacher" paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic.

Place, publisher, year, edition, pages
World Scientific, 2024
Keywords
Graph languages, logic characterisation, MAT learning, minimization
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-217981 (URN)10.1142/S0129054123480106 (DOI)001109806500001 ()2-s2.0-85178101785 (Scopus ID)
Funder
Swedish Research Council, 2020-03852Wallenberg AI, Autonomous Systems and Software Program (WASP), Nest project Sting
Available from: 2023-12-15 Created: 2023-12-15 Last updated: 2024-05-14Bibliographically approved
Ericson, P., Rammos, Y. & Rohrmeier, M. (2023). Musereduce: a generic framework for hierarchical music analysis. In: Ailynn Ang; Jennifer Bain; David M. Weigl (Ed.), Music Encoding Conference 2022 Proceedings: . Paper presented at Music Encoding Conference 2022, Halifax, Canada, May 19-22, 2022 (pp. 40-51). Music Encoding Initiative
Open this publication in new window or tab >>Musereduce: a generic framework for hierarchical music analysis
2023 (English)In: Music Encoding Conference 2022 Proceedings / [ed] Ailynn Ang; Jennifer Bain; David M. Weigl, Music Encoding Initiative , 2023, p. 40-51Conference paper, Published paper (Refereed)
Abstract [en]

In comparison to computational linguistics, with its abundance of natural-language datasets, corpora of music analyses are rather fewer and generally smaller. This is partly due to difficulties inherent to the encoding of music analyses, whose multimodal representations—typically a combination of music notation, graphic notation, and natural language—are designed for communication between human musician-analysts, not for automated large-scale data analysis. Analyses based on hierarchical models of tonal structure, such as Heinrich Schenker’s, present additional notational and encoding challenges, since they establish relations between non- adjacent tones, and typically interpret successions of tones as expressions of abstract chordal sonorities, which may not be literally present in the music score. Building on a published XML format by Rizo and Marsden (2019), which stores analyses alongside symbolically encoded scores, this paper presents a generic graph model for reasoning about music analyses, as well as a graphical web application for creating and encoding music analyses in the aforementioned XML format. Several examples are given showing how various techniques of music analysis, primarily but not necessarily hierarchical, might be unambiguously represented through this model.

Place, publisher, year, edition, pages
Music Encoding Initiative, 2023
Keywords
computational music theory, graph representation, hierarchical analysis, Music analysis, music analysis corpora, Music encoding
National Category
Musicology
Research subject
Musicology; Computer Science
Identifiers
urn:nbn:se:umu:diva-214920 (URN)10.17613/mczq-3s12 (DOI)
Conference
Music Encoding Conference 2022, Halifax, Canada, May 19-22, 2022
Funder
EU, Horizon 2020, 760081 – PMSB
Available from: 2023-10-04 Created: 2023-10-04 Last updated: 2023-10-05Bibliographically approved
Björklund, H., Drewes, F., Ericson, P. & Starke, F. (2021). Uniform Parsing for Hyperedge Replacement Grammars. Journal of computer and system sciences (Print), 118, 1-27
Open this publication in new window or tab >>Uniform Parsing for Hyperedge Replacement Grammars
2021 (English)In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 118, p. 1-27Article in journal (Refereed) Published
Abstract [en]

It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest for practical applications.

Place, publisher, year, edition, pages
Elsevier, 2021
Keywords
parsing, graph language, graph grammar, abstract meaning representation
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-177125 (URN)10.1016/j.jcss.2020.10.002 (DOI)000615930900001 ()2-s2.0-85097717738 (Scopus ID)
Available from: 2020-11-29 Created: 2020-11-29 Last updated: 2023-09-05Bibliographically approved
Snook, K., Barri, T., Bolles, M., Ericson, P., Fravel, C., Gossmann, J., . . . Thomas, R. (2020). Concordia: A musical XR instrument for playing the solar system. Journal of New Music Research, 49(1), 88-103
Open this publication in new window or tab >>Concordia: A musical XR instrument for playing the solar system
Show others...
2020 (English)In: Journal of New Music Research, ISSN 0929-8215, E-ISSN 1744-5027, Vol. 49, no 1, p. 88-103Article in journal (Refereed) Published
Abstract [en]

Kepler Concordia, a new scientific and musical instrument enabling players to explore the solar system and other data within immersive extended-reality (XR) platforms, is being designed by a diverse team of musicians, artists, scientists and engineers using audio-first principles. The core instrument modules will be launched in 2019 for the 400th anniversary of Johannes Kepler's Harmonies of the World, in which he laid out a framework for the harmony of geometric form as well as the three laws of planetary motion. Kepler's own experimental process can be understood as audio-first because he employed his understanding of Western Classical music theory to investigate and discover the heliocentric, elliptical behaviour of planetary orbits. Indeed, principles of harmonic motion govern much of our physical world and show up at all scales in mathematics and physics. Few physical systems, however, offer such rich harmonic complexity and beauty as our own solar system. Concordia is a musical instrument that is modular, extensible and designed to allow players to generate and explore transparent sonifications of planetary movements rooted in the musical and mathematical concepts of Johannes Kepler as well as researchers who have extended Kepler's work, such as Hartmut Warm. Its primary function is to emphasise the auditory experience by encouraging musical explorations using sonification of geometric and relational information of scientifically accurate planetary ephemeris and astrodynamics. Concordia highlights harmonic relationships of the solar system through interactive sonic immersion. This article explains how we prioritise data sonification and then add visualisations and gamification to create a new type of experience and creative distributed-ledger powered ecosystem. Kepler Concordia facilitates the perception of music while presenting the celestial harmonies through multiple senses, with an emphasis on hearing, so that, as Kepler wrote, 'the mind can seize upon the patterns'.

Place, publisher, year, edition, pages
Routledge, 2020
Keywords
Sonification, astronomy, mathematics, ephemeris, immersive media, musical instruments
National Category
Musicology
Identifiers
urn:nbn:se:umu:diva-168217 (URN)10.1080/09298215.2020.1714666 (DOI)000509212100001 ()2-s2.0-85078454685 (Scopus ID)
Note

Special Issue.

Available from: 2020-02-27 Created: 2020-02-27 Last updated: 2023-03-24Bibliographically approved
Harasim, D., Finkensiep, C., Ericson, P., O’Donnell, T. J. & Rohrmeier, M. (2020). The jazz harmony treebank. In: Proceedings of the 21st ISMIR Conference: . Paper presented at 21st International Society for Music Information Retrieval Conference, Montréal, Canada, October 11-16, 2020 (pp. 207-215).
Open this publication in new window or tab >>The jazz harmony treebank
Show others...
2020 (English)In: Proceedings of the 21st ISMIR Conference, 2020, p. 207-215Conference paper, Published paper (Refereed)
Abstract [en]

Grammatical models which represent the hierarchical structure of chord sequences have proven very useful in recent analyses of Jazz harmony. A critical resource for building and evaluating such models is a ground-truth database of syntax trees that encode hierarchical analyses of chord sequences. In this paper, we introduce the Jazz Harmony Treebank (JHT), a dataset of hierarchical analyses of complete Jazz standards. The analyses were created and checked by experts, based on lead sheets from the open iRealPro collection. The JHT is publicly available in JavaScript Object Notation (JSON), a human-understandable and machine-readable format for structured data. We additionally discuss statistical properties of the corpus and present a simple open-source web application for the graphical creation and editing of trees which was developed during the creation of the dataset.

National Category
Musicology
Research subject
Musicology
Identifiers
urn:nbn:se:umu:diva-205235 (URN)10.5281/zenodo.4245406 (DOI)
Conference
21st International Society for Music Information Retrieval Conference, Montréal, Canada, October 11-16, 2020
Available from: 2023-02-27 Created: 2023-02-27 Last updated: 2023-02-27Bibliographically approved
Ericson, P. (2019). Order-preserving graph grammars. (Doctoral dissertation). Umeå: Umeå universitet, Institutionen för datavetenskap
Open this publication in new window or tab >>Order-preserving graph grammars
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Alternative title[sv]
Ordningsbevarande grafgrammatiker
Abstract [en]

The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. In particular, we investigate two formalisms: Order-Preserving DAG Grammars (OPDG) and Order-Preserving Hyperedge Replacement Grammars (OPHG), where OPHG generalise OPDG.

Graph parsing is the practise of, given a graph grammar and a graph, to determine if, and in which way, the grammar could have generated the graph. If the grammar is considered fixed, it is the non-uniform graph parsing problem, while if the grammars is considered part of the input, it is named the uniform graph parsing problem. Most graph grammars have parsing problems known to be NP-complete, or even exponential, even in the non-uniform case. We show both OPDG and OPHG to have polynomial uniform parsing problems, under certain assumptions.

We also show these parsing algorithms to be suitable, not just for determining membership in graph languages, but for computing weights of graphs in graph series.

Additionally, OPDG is shown to have several properties common to regular languages, such as MSO definability and MAT learnability. We moreover show a direct corresponcence between OPDG and the regular tree grammars.

Finally, we present some limited practical experiments showing that real-world semantic graphs appear to mostly conform to the requirements set by OPDG, after minimal, reversible processing.

Place, publisher, year, edition, pages
Umeå: Umeå universitet, Institutionen för datavetenskap, 2019. p. 56
Series
Report / UMINF, ISSN 0348-0542 ; 19.01
Keywords
Graph grammars, graph parsing, graph series, hyperedge replacement, uniform parsing problem, abstract meaning representation, semantic modelling, order preservation, reentrancy preservation, minimally adequate teacher, weighted graph grammars
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-154777 (URN)978-91-7855-017-3 (ISBN)
Public defence
2019-02-04, MA121, Umeå, 13:00 (English)
Opponent
Supervisors
Available from: 2019-01-14 Created: 2019-01-07 Last updated: 2019-07-05Bibliographically approved
Björklund, H., Drewes, F. & Ericson, P. (2019). Parsing Weighted Order-Preserving Hyperedge Replacement Grammars. In: F. Drewes, P. de Groote, G. Penn (Ed.), Proceedings of the 16th Meeting on the Mathematics of Language: . Paper presented at 16th Meeting on the Mathematics of Language (MOL 2019), Toronto, Canada, July 18–19, 2019 (pp. 1-11). Association for Computational Linguistics
Open this publication in new window or tab >>Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
2019 (English)In: Proceedings of the 16th Meeting on the Mathematics of Language / [ed] F. Drewes, P. de Groote, G. Penn, Association for Computational Linguistics, 2019, p. 1-11Conference paper, Published paper (Refereed)
Abstract [en]

We introduce a weighted extension of the recently proposed notion oforder-preserving hyperedge-replacement grammars and prove that the weightof a graph according to such a weighted graph grammar can be computeduniformly in quadratic time (under assumptions made precise in the paper).

Place, publisher, year, edition, pages
Association for Computational Linguistics, 2019
Keywords
Graph grammar, Hyperedge replacement, Abstract meaning representation, Weighted uniform parsing
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-159908 (URN)
Conference
16th Meeting on the Mathematics of Language (MOL 2019), Toronto, Canada, July 18–19, 2019
Available from: 2019-06-10 Created: 2019-06-10 Last updated: 2019-10-30Bibliographically approved
Björklund, H., Björklund, J. & Ericson, P. (2018). Minimisation and Characterisation of Order-Preserving DAG Grammars. Umeå: Umeå University
Open this publication in new window or tab >>Minimisation and Characterisation of Order-Preserving DAG Grammars
2018 (English)Report (Other academic)
Abstract [en]

Order-preserving DAG grammars (OPDGs) is a formalism for processing semantic infor- mation in natural languages [5, 4]. OPDGs are sufficiently expressive to model abstract meaning representations, a graph-based form of semantic representation in which nodes en- code objects and edges relations. At the same time, they allow for efficient parsing in the uniform setting, where both the grammar and subject graph are taken as part of the input.

In this article, we introduce an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars. This makes it possible to transfer a number of results from that domain to OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable in the so-called MAT setting. To conclude, we show that the languages generated by OPDGs are MSO-definable.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2018. p. 19
Series
Report / UMINF, ISSN 0348-0542 ; 18.15
Keywords
graph grammars, minimally adequate teacher, order preservation, weighted graph grammars, weighted learning
National Category
Computer Sciences
Research subject
business data processing
Identifiers
urn:nbn:se:umu:diva-153394 (URN)
Available from: 2018-11-19 Created: 2018-11-19 Last updated: 2019-07-05Bibliographically approved
Björklund, H., Drewes, F. & Ericson, P. (2018). Parsing Weighted Order-Preserving Hyperedge Replacement Grammars. Umeå: Umeå Universitet
Open this publication in new window or tab >>Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
2018 (English)Report (Other academic)
Abstract [en]

We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper).

Place, publisher, year, edition, pages
Umeå: Umeå Universitet, 2018. p. 12
Series
Report / UMINF, ISSN 0348-0542 ; 18.16
Keywords
graph grammars, order-preservation, parsing, weighted graph grammars
National Category
Computer Sciences
Research subject
business data processing
Identifiers
urn:nbn:se:umu:diva-153395 (URN)
Available from: 2018-11-19 Created: 2018-11-19 Last updated: 2019-07-05Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-8722-5661

Search in DiVA

Show all publications