Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Adam Pauls"'
Publikováno v:
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers).
Autor:
Sam Thomson, Emmanouil Antonios Platanios, Alexander Kyte, Adam Pauls, Subhro Roy, Dan Klein, Yuchen Zhang, Jason Wolfe, Jacob Andreas, Jayant Krishnamurthy, Alan Guo
Publikováno v:
ACL/IJCNLP (1)
Conversational semantic parsers map user utterances to executable programs given dialogue histories composed of previous utterances, programs, and system responses. Existing parsers typically condition on rich representations of history that include
Autor:
Graham Neubig, Hao Fang, Adam Pauls, Sam Thomson, Yu Su, Emmanouil Antonios Platanios, Pengcheng Yin, Jacob Andreas
Publikováno v:
NAACL-HLT
We describe a span-level supervised attention loss that improves compositional generalization in semantic parsers. Our approach builds on existing losses that encourage attention maps in neural sequence-to-sequence models to imitate the output of cla
Publikováno v:
Computational Intelligence. 29:545-576
In many decision-making scenarios, people can benefit from knowing what other people's opinions are. As more and more evaluative documents are posted on the Web, summarizing these useful resources becomes a critical task for many organizations and in
Autor:
Adam Pauls, Brett Gladman
Publikováno v:
Meteoritics & Planetary Science. 40:1241-1256
We explore the orbital dynamics of Earth-crossing objects with the intent to understand the time scales under which an "orbital stream" of material could produce time-correlated meteorite falls. These meteoroid streams have been suggested to be assoc
Publikováno v:
HLT-NAACL
The tree-transducer grammars that arise in current syntactic machine translation systems are large, flat, and highly lexicalized. We address the problem of parsing efficiently with such grammars in three ways. First, we present a pair of grammar tran
Autor:
Adam Pauls, Dan Klein
Publikováno v:
HLT-NAACL
Both coarse-to-fine and A* parsing use simple grammars to guide search in complex ones. We compare the two approaches in a common, agenda-based framework, demonstrating the tradeoffs and relative strengths of each method. Overall, coarse-to-fine is m
Autor:
Adam Pauls, Dan Klein
Publikováno v:
ACL/IJCNLP
A* parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing k-best extraction methods can efficiently search for top derivations, but only after an exhaustive 1-best pass. We present a unified algorithm for k-best A* parsi
Publikováno v:
EMNLP
We propose a novel objective function for discriminatively tuning log-linear machine translation models. Our objective explicitly optimizes the BLEU score of expected n-gram counts, the same quantities that arise in forest-based consensus and minimum
Publikováno v:
ACL/IJCNLP (Short Papers)
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it is complex (and sometimes impossible) to find synchronous rule binariza