Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Dietze, Toni"'
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a certain lin
Externí odkaz:
http://arxiv.org/abs/1510.04881
Publikováno v:
In Information and Computation December 2019 269
A Formal View on Training of Weighted Tree Automata by Likelihood-Driven State Splitting and Merging
Autor:
Dietze, Toni
The use of computers and algorithms to deal with human language, in both spoken and written form, is summarized by the term natural language processing (nlp). Modeling language in a way that is suitable for computers plays an important role in nlp. O
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A34110
https://tud.qucosa.de/api/qucosa%3A34110/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A34110/attachment/ATT-0/
Publikováno v:
Language & Automata Theory & Applications: 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings; 2016, p478-489, 12p
Publikováno v:
Language & Automata Theory & Applications: 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings; 2016, p617-618, 2p
This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016. The 42 revised full papers presented together with 5 invit