Results 11 to 20 of about 23,480 (227)
Tiburon: A Weighted Tree Automata Toolkit [PDF]
International Conference on Implementation and Application of Automata, 2006 The availability of weighted finite-state string automata toolkits made possible great advances in natural language processing. However, recent advances in syntax-based NLP model design are unsuitable for these toolkits. To combat this problem, we introduce a weighted finite-state tree automata toolkit, which incorporates recent developments in ...
Jonathan May, Kevin Knight
semanticscholar +2 more sources
Bisimulation Minimisation for Weighted Tree Automata [PDF]
International Conference on Developments in Language Theory, 2007 We generalise existing forward and backward bisimulation minimisation algorithms for tree automata to weighted tree automata. The obtained algorithms work for all semirings and retain the time complexity of their unweighted variants for all additively cancellative semirings.
Johanna Björklund +2 more
semanticscholar +2 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +1 more source
New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata [PDF]
arXiv.org, 2023 Tree kernels have been proposed to be used in many areas as the automatic learning of natural language applications. In this paper, we propose a new linear time algorithm based on the concept of weighted tree automata for SubTree kernel computation ...
Ludovic Mignot, Faissal Ouardi, D. Ziadi
semanticscholar +1 more source
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids [PDF]
Theoretical Computer Science, 2021 ,
M. Droste +3 more
semanticscholar +1 more source
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
Logical Methods in Computer Science, 2023 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule.
Dana Fisman +2 more
doaj +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
Coalgebraic trace semantics via forgetful logics [PDF]
Logical Methods in Computer Science, 2017 We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative ...
Bartek Klin, Jurriaan Rot
doaj +1 more source
Pemodelan dan Verifikasi Formal Protokol EE-OLSR dengan UPPAAL CORA
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2016 Information and Communication Technology systems is a most important part of society. These systems are becoming more and more complex and are massively encroaching on daily life via the Internet and all kinds of embedded systems.
Rachmat Wahid Saleh Insani +1 more
doaj +1 more source
Simulations of Weighted Tree Automata [PDF]
, 2011 17 pages, 2 ...
Ésik, Zoltán, Maletti, Andreas
openaire +2 more sources