1 |
A Closer Look into the Robustness of Neural Dependency Parsers Using Better Adversarial Examples ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
A Root of a Problem: Optimizing Single-Root Dependency Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
Unlexicalized Transition-based Discontinuous Constituency Parsing
|
|
|
|
In: EISSN: 2307-387X ; Transactions of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-02150073 ; Transactions of the Association for Computational Linguistics, The MIT Press, 2019, 7, pp.73--89. ⟨10.1162/tacl_a_00255⟩ (2019)
|
|
BASE
|
|
Show details
|
|
4 |
Discontinuous Constituency Parsing with a Stack-Free Transition System and a Dynamic Oracle
|
|
|
|
In: 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL-HLT 2019) ; https://hal.archives-ouvertes.fr/hal-02150076 ; 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL-HLT 2019), Jun 2019, Minneapolis, MN, United States. pp.204--217 ; https://naacl2019.org/ (2019)
|
|
BASE
|
|
Show details
|
|
5 |
Unlexicalized Transition-based Discontinuous Constituency Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Unlexicalized Transition-based Discontinuous Constituency Parsing
|
|
|
|
In: Transactions of the Association for Computational Linguistics, Vol 7, Pp 73-89 (2019) (2019)
|
|
BASE
|
|
Show details
|
|
7 |
Privacy-preserving Neural Representations of Text
|
|
|
|
In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing ; 2018 Conference on Empirical Methods in Natural Language Processing ; https://hal.archives-ouvertes.fr/hal-02135081 ; 2018 Conference on Empirical Methods in Natural Language Processing, Nov 2018, Brussels, Belgium. pp.1--10 (2018)
|
|
BASE
|
|
Show details
|
|
8 |
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Unsupervised Bilingual POS Tagging with Markov Random Fields ...
|
|
|
|
BASE
|
|
Show details
|
|
10 |
Unsupervised Bilingual POS Tagging with Markov Random Fields ...
|
|
|
|
BASE
|
|
Show details
|
|
14 |
Whodunnit? Crime Drama as a Case for Natural Language Understanding ...
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Paraphrase Generation from Latent-Variable PCFGs for Semantic Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Paraphrase Generation From Latent-Variable Pcfgs For Semantic Parsing ...
|
|
|
|
Abstract:
One of the limitations of semantic parsing approaches to open-domain question answering is the lexicosyntactic gap between natural language questions and knowledge base entries -- there are many ways to ask a question, all with the same answer. In this paper we propose to bridge this gap by generating paraphrases of the input question with the goal that at least one of them will be correctly mapped to a knowledge-base query. We introduce a novel grammar model for paraphrase generation that does not require any sentence-aligned paraphrase corpus. Our key idea is to leverage the flexibility and scalability of latent-variable probabilistic context-free grammars to sample paraphrases. We do an extrinsic evaluation of our paraphrases by plugging them into a semantic parser for Freebase. Our evaluation experiments on the WebQuestions benchmark dataset show that the performance of the semantic parser significantly improves over strong baselines. ...
|
|
URL: https://dx.doi.org/10.5281/zenodo.827303 https://zenodo.org/record/827303
|
|
BASE
|
|
Hide details
|
|
17 |
Paraphrase Generation From Latent-Variable Pcfgs For Semantic Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
Paraphrase Generation from Latent-Variable PCFGs for Semantic Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
19 |
Paraphrase Generation from Latent-Variable PCFGs for Semantic Parsing ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|