1 |
Constrained Language Models Yield Few-Shot Semantic Parsers ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Searching for More Efficient Dynamic Programs ...
|
|
|
|
Abstract:
Computational models of human language often involve combinatorial problems. For instance, a probabilistic parser may marginalize over exponentially many trees to make predictions. Algorithms for such problems often employ dynamic programming and are not always unique. Finding one with optimal asymptotic runtime can be unintuitive, time-consuming, and error-prone. Our work aims to automate this laborious process. Given an initial correct declarative program, we search for a sequence of semantics-preserving transformations to improve its running time as much as possible. To this end, we describe a set of program transformations, a simple metric for assessing the efficiency of a transformed program, and a heuristic search procedure to improve this metric. We show that in practice, automated search—like the mental search performed by human programmers—can find substantial improvements to the initial program. Empirically, we show that many speed-ups described in the NLP literature could have been discovered ... : Findings of the Association for Computational Linguistics: EMNLP 2021 ...
|
|
URL: http://hdl.handle.net/20.500.11850/518987 https://dx.doi.org/10.3929/ethz-b-000518987
|
|
BASE
|
|
Hide details
|
|
3 |
Searching for More Efficient Dynamic Programs
|
|
|
|
In: Findings of the Association for Computational Linguistics: EMNLP 2021 (2021)
|
|
BASE
|
|
Show details
|
|
7 |
A Corpus for Large-Scale Phonetic Typology
|
|
|
|
In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics (2020)
|
|
BASE
|
|
Show details
|
|
9 |
Are All Languages Equally Hard to Language-Model?
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2019)
|
|
BASE
|
|
Show details
|
|
10 |
A Generative Model for Punctuation in Dependency Trees
|
|
|
|
In: Transactions of the Association for Computational Linguistics, Vol 7, Pp 357-373 (2019) (2019)
|
|
BASE
|
|
Show details
|
|
11 |
On the Complexity and Typology of Inflectional Morphological Systems
|
|
|
|
In: Transactions of the Association for Computational Linguistics, Vol 7, Pp 327-342 (2019) (2019)
|
|
BASE
|
|
Show details
|
|
12 |
Spell Once, Summon Anywhere: A Two-Level Open-Vocabulary Language Model ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
On the Complexity and Typology of Inflectional Morphological Systems ...
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Unsupervised Disambiguation of Syncretism in Inflected Lexicons ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Predicting Fine-Grained Syntactic Typology from Surface Features
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2018)
|
|
BASE
|
|
Show details
|
|
18 |
Quantifying the Trade-off Between Two Types of Morphological Complexity
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2018)
|
|
BASE
|
|
Show details
|
|
19 |
Probabilistic Typology: Deep Generative Models of Vowel Inventories ...
|
|
|
|
BASE
|
|
Show details
|
|
20 |
Probabilistic Typology: Deep Generative Models of Vowel Inventories ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|