Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Jonas Groschwitz"'
Publikováno v:
COLING
The emergence of a variety of graph-based meaning representations (MRs) has sparked an important conversation about how to adequately represent semantic structure. These MRs exhibit structural differences that reflect different theoretical and design
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaddb776710b16b4ae71cc0f5c8826b5
https://doi.org/10.18653/v1/2020.coling-main.267
https://doi.org/10.18653/v1/2020.coling-main.267
Publikováno v:
EMNLP (1)
AM dependency parsing is a linguistically principled method for neural semantic parsing with high accuracy across multiple graphbanks. It relies on a type system that models semantic valency but makes existing parsers slow. We describe an A* parser a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e146ff9f9d8b453bb405c30d0c955c38
Publikováno v:
ACL (1)
Most semantic parsers that map sentences to graph-based meaning representations are hand-designed for specific graphbanks. We present a compositional neural semantic parser which achieves, for the first time, competitive accuracies across a diverse r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c51e32b9dd17b3b0ed02767e56abcbcc
Publikováno v:
ACL (1)
We present a semantic parser for Abstract Meaning Representations which learns to parse strings into tree representations of the compositional structure of an AMR graph. This allows us to use standard neural techniques for supertagging and dependency
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce6cfc843fdf248363367cc924df2c3a
http://arxiv.org/abs/1805.11465
http://arxiv.org/abs/1805.11465
Publikováno v:
EACL (Software Demonstrations)
We present Alto, a rapid prototyping tool for new grammar formalisms. Alto implements generic but efficient algorithms for parsing, translation, and training for a range of monolingual and synchronous grammar formalisms. It can easily be extended to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0de2b5042c75fa29be520b638e982d53
https://doi.org/10.18653/v1/e17-3008
https://doi.org/10.18653/v1/e17-3008
Publikováno v:
ACL (1)
Parsing for a wide variety of grammar formalisms can be performed by intersecting finite tree automata. However, naive implementations of parsing by intersection are very inefficient. We present techniques that speed up tree-automata-based parsing, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecb2de8a33fb31745f10f8049e85f6fb
https://doi.org/10.18653/v1/p16-1192
https://doi.org/10.18653/v1/p16-1192
Autor:
Tibor Szabó, Jonas Groschwitz
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case of Breaker playing randomly and Maker being "clever". The reverse scen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c8a156c3c96c402a5b373d9e100f1c3
Autor:
Tibor Szabó, Jonas Groschwitz
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scenario when Maker plays randomly and Breaker is "clever", and determine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a47d2d5f9da7c31af3e55b09a5cf67f6
http://arxiv.org/abs/1507.06688
http://arxiv.org/abs/1507.06688
Publikováno v:
ACL (1)
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::158d611671e02d94490c0c0a5492ad83
https://doi.org/10.3115/v1/p15-1143
https://doi.org/10.3115/v1/p15-1143