50,022 research outputs found
Cross-domain Semantic Parsing via Paraphrasing
Existing studies on semantic parsing mainly focus on the in-domain setting.
We formulate cross-domain semantic parsing as a domain adaptation problem:
train a semantic parser on some source domains and then adapt it to the target
domain. Due to the diversity of logical forms in different domains, this
problem presents unique and intriguing challenges. By converting logical forms
into canonical utterances in natural language, we reduce semantic parsing to
paraphrasing, and develop an attentive sequence-to-sequence paraphrase model
that is general and flexible to adapt to different domains. We discover two
problems, small micro variance and large macro variance, of pre-trained word
embeddings that hinder their direct use in neural networks, and propose
standardization techniques as a remedy. On the popular Overnight dataset, which
contains eight domains, we show that both cross-domain training and
standardized pre-trained word embeddings can bring significant improvement.Comment: 12 pages, 2 figures, accepted by EMNLP201
th power residue chains of global fields
In 1974, Vegh proved that if is a prime and a positive integer, there
is an term permutation chain of th power residue for infinitely many
primes [E.Vegh, th power residue chains, J.Number Theory, 9(1977), 179-181].
In fact, his proof showed that is an term permutation
chain of th power residue for infinitely many primes. In this paper, we
prove that for any "possible" term sequence , there are
infinitely many primes making it an term permutation chain of th
power residue modulo , where is an arbitrary positive integer [See
Theorem 1.2]. From our result, we see that Vegh's theorem holds for any
positive integer , not only for prime numbers. In fact, we prove our result
in more generality where the integer ring is replaced by any -integer
ring of global fields (i.e. algebraic number fields or algebraic function
fields over finite fields).Comment: 4 page
- …
