受强制性开放获取政策约束的文章 - Frank Drewes了解详情
可在其他位置公开访问的文章：7 篇
Uniform parsing for hyperedge replacement grammars
H Björklund, F Drewes, P Ericson, F Starke
Journal of Computer and System Sciences 118, 1-27, 2021
强制性开放获取政策： Swedish Research Council
Weighted DAG automata for semantic graphs
D Chiang, F Drewes, D Gildea, A Lopez, G Satta
Computational linguistics 44 (1), 119-186, 2018
强制性开放获取政策： US National Science Foundation, US Department of Defense, Government of Italy
Generation and polynomial parsing of graph languages with non-structural reentrancies
J Björklund, F Drewes, A Jonsson
Computational Linguistics 49 (4), 841-882, 2023
强制性开放获取政策： Swedish Research Council
Perception, memory, and inference: The trinity of machine learning
A Dahlgren, J Björklund, F Drewes
Is Neuro-Symbolic SOTA still a myth for Natural Language Inference? The …, 2021
强制性开放获取政策： Swedish Research Council
On the parameterized complexity of linear context-free rewriting systems
M Berglund, H Björklund, F Drewes
Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13), 21-29, 2013
强制性开放获取政策： Swedish Research Council
Bridging Perception, Memory, and Inference through Semantic Relations
J Björklund, AD Lindström, F Drewes
Proceedings of the 2021 Conference on Empirical Methods in Natural Language …, 2021
强制性开放获取政策： Swedish Research Council
On the power of local graph expansion grammars with and without additional restrictions
F Drewes, Y Stade
Theoretical Computer Science 1015, 114763, 2024
强制性开放获取政策： Knut and Alice Wallenberg Foundation
出版信息和资助信息由计算机程序自动确定