Generating Elliptic Coordination

نویسندگان

  • Claire Gardent
  • Shashi Narayan
چکیده

In this paper, we focus on the task of generating elliptic sentences. We extract from the data provided by the Surface Realisation (SR) Task (Belz et al., 2011) 2398 input whose corresponding output sentence contain an ellipsis. We show that 9% of the data contains an ellipsis and that both coverage and BLEU score markedly decrease for elliptic input (from 82.3% coverage for non-elliptic sentences to 65.3% for elliptic sentences and from 0.60 BLEU score to 0.47). We argue that elided material should be represented using phonetically empty nodes and we introduce a set of rewrite rules which permits adding these empty categories to the SR data. Finally, we evaluate an existing surface realiser on the resulting dataset. We show that, after rewriting, the generator achieves a coverage of 76% and a BLEU score of 0.74 on the elliptical data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The use of MCTAG to Process Elliptic Coordination

In this paper, we introduce a formalization of various elliptical coordination structures within the Multi-Component TAG framework. Numerous authors describe elliptic coordination as parallel constructions where symmetric derivations can be observed from a desired predicate-argument structure analysis. We show that most famous coordinate structures, including zeugma constructions, can be analyz...

متن کامل

Generating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication

We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.

متن کامل

The signs in elliptic nets

We give a generalization of a theorem of Silverman and Stephens regarding the signs in an elliptic divisibility sequence to the case of an elliptic net. We also describe applications of this theorem in the study of the distribution of the signs in elliptic nets and generating elliptic nets using the denominators of the linear combination of points on elliptic curves.

متن کامل

The elliptic algebra Uq,p( ̂ slN ) and the deformation of the WN algebra

After reviewing the recent results on the Drinfeld realization of the face type elliptic quantum group Bq,λ(ŝlN ) by the elliptic algebra Uq,p(ŝlN ), we investigate a fusion of the vertex operators of Uq,p(ŝlN ). The basic generating functions Λj(z) (1 ≤ j ≤ N − 1) of the deformed WN algebra are derived explicitly.

متن کامل

On Pseudo-Random Number Generators Using Elliptic Curves and Chaotic Systems

Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography which is based on the arithmetic on elliptic curves and security of the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. Elliptic curve algorithms are also applie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013