DE eng

Search in the Catalogues and Directories

Hits 1 – 10 of 10

1
Higher-order Derivatives of Weighted Finite-state Machines ...
BASE
Show details
2
On Finding the K-best Non-projective Dependency Trees ...
BASE
Show details
3
On Finding the K-best Non-projective Dependency Trees ...
Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021
BASE
Show details
4
Efficient computation of expectations under spanning tree distributions ...
Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021
BASE
Show details
5
Higher-order Derivatives of Weighted Finite-state Machines ...
Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021
BASE
Show details
6
On Finding the K-best Non-projective Dependency Trees
In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (2021)
BASE
Show details
7
Higher-order Derivatives of Weighted Finite-state Machines
In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (2021)
BASE
Show details
8
Efficient computation of expectations under spanning tree distributions
In: Transactions of the Association for Computational Linguistics, 9 (2021)
BASE
Show details
9
Efficient Sampling of Dependency Structure
In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing (2021)
BASE
Show details
10
Please Mind the Root: Decoding Arborescences for Dependency Parsing
In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) (2020)
BASE
Show details

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