Home
Catalogue search
Refine your search:
Keyword
Creator / Publisher:
Cotterell, Ryan (10)
Vieira, Tim (10)
Zmigrod, Ran (10)
Li, Wenjie (2)
Navigli, Roberto (2)
The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021 (2)
Xia, Fei (2)
Zong, Chengqing (2)
Cohn, Trevor (1)
He, Yulan (1)
more
Year:
2021 (9)
2020 (1)
Medium
Type
BLLDB-Access
Search in the Catalogues and Directories
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
Sort by
creator [A → Z]
'
creator [Z → A]
'
publishing year ↑ (asc)
'
publishing year ↓ (desc)
'
title [A → Z]
'
title [Z → A]
'
Simple Search
Hits 1 – 10 of 10
1
Higher-order Derivatives of Weighted Finite-state Machines ...
The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021
;
Cotterell, Ryan
;
Vieira, Tim
. - : Underline Science Inc., 2021
BASE
Show details
2
On Finding the K-best Non-projective Dependency Trees ...
The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021
;
Cotterell, Ryan
;
Vieira, Tim
. - : Underline Science Inc., 2021
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
Abstract:
We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement with or without automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria. As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence. In all cases, our approach matches the efficiency of existing algorithms ... : Transactions of the Association for Computational Linguistics, 9 ...
URL:
https://dx.doi.org/10.3929/ethz-b-000517632
http://hdl.handle.net/20.500.11850/517632
BASE
Hide 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
Zmigrod, Ran
;
Cotterell, Ryan
;
Vieira, Tim
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
Zmigrod, Ran
;
Cotterell, Ryan
;
Vieira, Tim
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
Cotterell, Ryan
;
Zmigrod, Ran
;
Vieira, Tim
In: Transactions of the Association for Computational Linguistics, 9 (2021)
BASE
Show details
9
Efficient Sampling of Dependency Structure
Vieira, Tim
;
Zmigrod, Ran
;
Cotterell, Ryan
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
Vieira, Tim
;
Cotterell, Ryan
;
Zmigrod, Ran
In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) (2020)
BASE
Show details
Mobile view
All
Catalogues
UB Frankfurt Linguistik
0
IDS Mannheim
0
OLC Linguistik
0
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
0
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
0
BDSL
0
IDS Bibliografie zur deutschen Grammatik
0
IDS Bibliografie zur Gesprächsforschung
0
IDS Konnektoren im Deutschen
0
IDS Präpositionen im Deutschen
0
IDS OBELEX meta
0
MPI-SHH Linguistics Collection
0
MPI for Psycholinguistics
0
Linked Open Data catalogues
Annohub
0
Online resources
Link directory
0
Journal directory
0
Database directory
0
Dictionary directory
0
Open access documents
BASE
10
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern