Umeå University's logo

umu.sePublications
Planned maintenance
A system upgrade is planned for 17/11-2026, at 12:00-13:00. During this time DiVA will be unavailable.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • 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
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0001-8503-0118
2024 (English)In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 146, article id 103563Article in journal (Refereed) Published
Abstract [en]

Dietze's conjecture concerns the problem of equipping a tree automaton M with weights to make it probabilistic, in such a way that the resulting automaton N predicts a given corpus C as accurately as possible. The conjecture states that the accuracy cannot increase if the states in M are merged with respect to an equivalence relation ∼ so that the result is a smaller automaton M∼. Put differently, merging states can never improve predictions. This is under the assumption that both M and M∼ are bottom-up deterministic and accept every tree in C. We prove that the conjecture holds, using a construction that turns any probabilistic version N∼ of M∼ into a probabilistic version N of M, such that N assigns at least as great a weight to each tree in C as N∼ does.

Place, publisher, year, edition, pages
Elsevier, 2024. Vol. 146, article id 103563
Keywords [en]
Probability distributions, Statistical ML, Tree automata
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-227954DOI: 10.1016/j.jcss.2024.103563ISI: 001274710600001Scopus ID: 2-s2.0-85198610979OAI: oai:DiVA.org:umu-227954DiVA, id: diva2:1885743
Funder
Swedish Research CouncilAvailable from: 2024-07-25 Created: 2024-07-25 Last updated: 2025-04-24Bibliographically approved

Open Access in DiVA

fulltext(378 kB)174 downloads
File information
File name FULLTEXT01.pdfFile size 378 kBChecksum SHA-512
4e008386d80340a5cd6777ed9b17389e755d0b66648c6855a8311d80dbb9345055d409352ae4bdced27f5fce6d3ce77fd363c45437b12ebb37afd4a658764d27
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Björklund, Johanna

Search in DiVA

By author/editor
Björklund, Johanna
By organisation
Department of Computing Science
In the same journal
Journal of computer and system sciences (Print)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 176 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: 585 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • 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