Home
Catalogue search
Refine your search:
Keyword:
Creator / Publisher:
Cotterell, Ryan (9)
Vieira, Tim (9)
Zmigrod, Ran (9)
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)
Huang, Xuanjing (1)
Moens, Marie-Francine (1)
more
Year:
2021 (9)
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 – 9 of 9
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
Abstract:
The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependency parsing schemes, an important detail of this approach is that the spanning tree must have exactly one edge emanating from the root. While work has been done to efficiently solve this problem for finding the one-best dependency tree, no research has attempted to extend this solution to finding the K-best dependency trees. This is arguably a more important extension as a larger proportion of decoded trees will not be subject to the root constraint of dependency trees. Indeed, we show that the rate of root constraint violations increases by an average of 13 times when decoding with K=50 as opposed to K=1. In this paper, we provide a simplification of the K-best spanning tree algorithm of Camerini et al. (1980). Our simplification allows us to obtain a constant time speed-up over the original algorithm. Furthermore, we present a ... : Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing ...
URL:
https://dx.doi.org/10.3929/ethz-b-000519003
http://hdl.handle.net/20.500.11850/521262
BASE
Hide 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
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
9
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern