DE eng

Search in the Catalogues and Directories

Page: 1 2 3
Hits 1 – 20 of 41

1
Compositional Generalization Requires Compositional Parsers ...
BASE
Show details
2
Learning compositional structures for semantic graph parsing ...
BASE
Show details
3
Learning compositional structures for semantic graph parsing ...
BASE
Show details
4
Aligning Actions Across Recipe Graphs ...
BASE
Show details
5
Script Parsing with Hierarchical Sequence Modelling ...
BASE
Show details
6
Towards the extraction of cross-sentence relations through event extraction and entity coreference
Simova, Iliana. - : Saarländische Universitäts- und Landesbibliothek, 2021
BASE
Show details
7
Fast semantic parsing with well-typedness guarantees ...
BASE
Show details
8
Normalizing Compositional Structures Across Graphbanks ...
BASE
Show details
9
Predicting Coreference in Abstract Meaning Representations ...
BASE
Show details
10
Generating Instructions at Different Levels of Abstraction ...
BASE
Show details
11
Methods for taking semantic graphs apart and putting them back together again
Groschwitz, Jonas. - : Saarländische Universitäts- und Landesbibliothek, 2019
BASE
Show details
12
Prediction, detection, and correction of misunderstandings in interactive tasks
Villalba, Martin Federico. - : Saarländische Universitäts- und Landesbibliothek, 2019
BASE
Show details
13
AMR Dependency Parsing with a Typed Semantic Algebra ...
BASE
Show details
14
Efficient techniques for parsing with tree automata
Groschwitz, Jonas; Koller, Alexander; Johnson, Mark. - : Red Hook, New York : Association for Computational Linguistics, 2016
Abstract: 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, to the point that it becomes practically feasible on realistic data when applied to context-free, TAG, and graph parsing. For graph parsing, we obtain the best runtimes in the literature. ; 10 page(s)
URL: http://hdl.handle.net/1959.14/1189834
BASE
Hide details
15
Graph parsing with s-graph grammars
Groschwitz, Jonas; Koller, Alexander; Teichmann, Christoph. - : Red Hook, New York : Association for Computational Linguistics, 2015
BASE
Show details
16
Report on the Second Second Challenge on Generating Instructions in Virtual Environments (GIVE-2.5)
In: 13th European Workshop on Natural Language Generation ; https://hal.inria.fr/inria-00636498 ; 13th European Workshop on Natural Language Generation, Sep 2011, Nancy, France (2011)
BASE
Show details
17
Underspecified computation of normal forms
Koller, Alexander; Thater, Stefan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. : LIPIcs - Leibniz International Proceedings in Informatics. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010
BASE
Show details
18
Underspecified computation of normal forms ...
Koller, Alexander; Thater, Stefan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2010
BASE
Show details
19
Report on the second NLG challenge on generating instructions in virtual environments (GIVE-2)
Koller, Alexander; Striegnitz, Kristina; Gargett, Andrew. - : Stroudsburg, PA : Association for Computational Linguistics, 2010
BASE
Show details
20
The Software architecture for the first challenge on generating instructions in virtual environments
Koller, Alexander; Byron, Donna; Cassell, Justine. - : United States : Association for Computational Linguistics (ACL), 2009
BASE
Show details

Page: 1 2 3

Catalogues
Bibliographies
Linked Open Data catalogues
Online resources
Open access documents
41
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern