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
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
;
Zmigrod, Ran
. - : Underline Science Inc., 2021
Abstract:
Read paper: https://www.aclanthology.org/2021.acl-short.32 Abstract: Weighted finite-state machines are a fundamental building block of NLP systems. They have withstood the test of time---from their early use in noisy channel models in the 1990s up to modern-day neurally parameterized conditional random fields. This work examines the computation of higher-order derivatives with respect to the normalization constant for weighted finite-state machines. We provide a general algorithm for evaluating derivatives of all orders, which has not been previously described in the literature. In the case of second-order derivatives, our scheme runs in the optimal O(A^2 N^4) time where A is the alphabet size and N is the number of states. Our algorithm is significantly faster than prior algorithms. Additionally, our approach leads to a significantly faster algorithm for computing second-order expectations, such as covariance matrices and gradients of first-order expectations. ...
URL:
https://dx.doi.org/10.48448/b0dp-6v40
https://underline.io/lecture/25998-higher-order-derivatives-of-weighted-finite-state-machines
BASE
Hide 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
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
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