Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generating semantic graph corpora with graph expansion grammar
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-8503-0118
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-7349-7693
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0002-9873-4170
2023 (English)In: 13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023) / [ed] Nagy B., Freund R., Open Publishing Association , 2023, Vol. 388, p. 3-15Conference paper, Published paper (Refereed)
Abstract [en]

We introduce LOVELACE, a tool for creating corpora of semantic graphs.The system uses graph expansion grammar as  a representational language, thus allowing users to craft a grammar that describes a corpus with desired properties. When given such grammar as input, the system generates a set of output graphs that are well-formed according to the grammar, i.e., a graph bank.The generation process can be controlled via a number of configurable parameters that allow the user to, for example, specify a range of desired output graph sizes.Central use cases are the creation of synthetic data to augment existing corpora, and as a pedagogical tool for teaching formal language theory. 

Place, publisher, year, edition, pages
Open Publishing Association , 2023. Vol. 388, p. 3-15
Series
Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180
Keywords [en]
semantic representation, graph corpora, graph grammar
National Category
Language Technology (Computational Linguistics)
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-212143DOI: 10.4204/EPTCS.388.3Scopus ID: 2-s2.0-85173059788OAI: oai:DiVA.org:umu-212143DiVA, id: diva2:1782953
Conference
13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, 18-19 September, 2023, Famagusta, Cyprus
Funder
Swedish Research Council, 2020-03852Available from: 2023-07-18 Created: 2023-07-18 Last updated: 2023-10-18Bibliographically approved

Open Access in DiVA

fulltext(225 kB)40 downloads
File information
File name FULLTEXT01.pdfFile size 225 kBChecksum SHA-512
8dbdf50fdd5da427b73540b0d3389e4a5fd96eff01052d45c8cfa8874a70fe90384d0e5fa0904983d6cdd67fa6ac52f255c76fb2a7f286e5d2d9ecbdb9c7b361
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopushttps://ncma.emu.edu.tr/en

Authority records

Andersson, EricBjörklund, JohannaDrewes, FrankJonsson, Anna

Search in DiVA

By author/editor
Andersson, EricBjörklund, JohannaDrewes, FrankJonsson, Anna
By organisation
Department of Computing Science
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
Total: 40 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 572 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf