Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Graph parsing"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Multimedia Tools and Applications. 81:299-317
In this paper, we present ParVis, an interactive visual system for the animated visualization of logged parser trace executions. The system allows a parser implementer to create a visualizer for generated parsers by simply defining a JavaScript modul
Publikováno v:
Intelligent Automation & Soft Computing. 28:447-458
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the 5th Workshop on Structured Prediction for NLP, 22
STARTPAGE=22;TITLE=Proceedings of the 5th Workshop on Structured Prediction for NLP
STARTPAGE=22;TITLE=Proceedings of the 5th Workshop on Structured Prediction for NLP
AM dependency parsing is a method for neural semantic graph parsing that exploits the principle of compositionality. While AM dependency parsers have been shown to be fast and accurate across several graphbanks, they require explicit annotations of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01e650e93b232159e17a4469e043f3ee
https://dspace.library.uu.nl/handle/1874/415006
https://dspace.library.uu.nl/handle/1874/415006
Autor:
Samuel, David
Deep learning has been successfully applied to semantic graph parsing in recent years. However, to our best knowledge, all graph-based parsers depend on a strong assumption about the ordering of graph nodes. This work explores a permutation-invariant
Externí odkaz:
http://www.nusl.cz/ntk/nusl-448512
Publikováno v:
ACL/IJCNLP (Findings)
Autor:
Samuel, David
Deep learning has been successfully applied to semantic graph parsing in recent years. However, to our best knowledge, all graph-based parsers depend on a strong assumption about the ordering of graph nodes. This work explores a permutation-invariant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::b7db625e34d9037dbc57d218a27147a5
http://www.nusl.cz/ntk/nusl-448512
http://www.nusl.cz/ntk/nusl-448512
Publikováno v:
Hershcovich, D, De Lhoneux, M, Kulmizev, A, Pejhan, E & Nivre, J 2020, Køpsala : Transition-Based Graph Parsing via Efficient Training and Effective Encoding . in Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies . Association for Computational Linguistics, pp. 236-244, 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task, Virtual Meeting, 09/07/2020 . https://doi.org/10.18653/v1/2020.iwpt-1.25
IWPT 2020
IWPT 2020
We present Kopsala, the Copenhagen-Uppsala system for the Enhanced Universal Dependencies Shared Task at IWPT 2020. Our system is a pipeline consisting of off-the-shelf models for everything but enhanced graph parsing, and for the latter, a transitio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::855f5b67c86e563d6c7376ef47c0b35f
https://curis.ku.dk/ws/files/254669149/OA_K_psala.pdf
https://curis.ku.dk/ws/files/254669149/OA_K_psala.pdf