Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Kilian Gebhardt"'
Publikováno v:
Computational Linguistics, Vol 43, Iss 3 (2017)
We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-projective dependency structures. T
Externí odkaz:
https://doaj.org/article/8d5944a522f642e490e0b6ebfa0b6541
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, 2022, 127, pp.41-52. ⟨10.1016/j.jcss.2022.02.003⟩
Journal of Computer and System Sciences, 2022, 127, pp.41-52. ⟨10.1016/j.jcss.2022.02.003⟩
International audience; Commutative properties in formal languages pose problems at the frontier of computer science, computational linguistics and computational group theory. A prominent problem of this kind is the position of the language $O_n$, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ae86b5d5decdce7eeaf2c77977f7171
https://hal.science/hal-01771670v2/file/MCFL.pdf
https://hal.science/hal-01771670v2/file/MCFL.pdf
Autor:
Kilian Gebhardt
Publikováno v:
IWPT 2020
We present new experiments that transfer techniques from Probabilistic Context-free Grammars with Latent Annotations (PCFG-LA) to two grammar formalisms for discontinuous parsing: linear context-free rewriting systems and hybrid grammars. In particul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04058435a01277dedfe2bf145561a2d3
https://doi.org/10.18653/v1/2020.iwpt-1.9
https://doi.org/10.18653/v1/2020.iwpt-1.9
Publikováno v:
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata.
We define the concept of probabilistic aligned hypergraph bimorphism. Each such bimorphism consists of a probabilistic regular tree grammar, two hypergraph algebras in which the generated trees are ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26e9e2efb59e791d80227b89b04edb21
https://doi.org/10.18653/v1/w16-2407
https://doi.org/10.18653/v1/w16-2407
Autor:
Kilian Gebhardt, Norbert Manthey
Publikováno v:
KI 2013: Advances in Artificial Intelligence ISBN: 9783642409417
KI
KI
Formula simplification is important for the performance of SAT solvers. However, when applied until completion, powerful preprocessing techniques like variable elimination can be very time consuming. Therefore, these techniques are usually used with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1af2c53dfcc25fd5625cc820fe35decd
https://doi.org/10.1007/978-3-642-40942-4_6
https://doi.org/10.1007/978-3-642-40942-4_6