This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar based constant generation methods are provided with Grammatical Evolution. Three constant generation techniques are supplied, namely, grammatical ephemeral random constants, digit concatenation, and an expression based a...

Multi-word expressions (MWEs) have been recognized as important linguistic information and much research has been conducted especially on their extraction and interpretation. On the other hand, they have hardly been used in real application areas. While those who are learning English as a second language (ESL) use MWEs in their writings just like native speakers, MWEs haven’t been taken into co...

In this paper we present a methodology for automating the evaluation of the grammatical coverage of machine translation (MT) systems. The methodology is based on the importance of unfolded grammatical structures, which represent the most basic syntactic pattern for a sentence in a given language. A database of unfolded grammatical structures is built to evaluate the parser of any NLP or MT syst...

Readers actively construct representational models of meaning when reading text, and they do so by drawing on a range of kinds of information, from the specifi c linguistic forms of the sentences to knowledge about how the world works (Ferretti, Kutas, & McRae, 2007 ; Madden & Zwaan, 2003 ). The present set of studies focused on how grammatical aspect is integrated into a situation model and ho...

Grammatical inference methods are expected to find grammatical structures hidden in biological sequences. One hopes that studies of grammar serve as an appropriate tool for theory formation. Thus, we have developed JSequitur for automatically generating the grammatical structure of biological sequences in an inference framework of string compression algorithms. Our original motivation was to fi...

Cryptographic schemes using elliptic curves over finite fields require the computation of the cardinality of the curves. Dramatic progress have been achieved recently in that field. The aim of this article is to highlight part of these improvements and to describe an efficient implementation of them in the particular case of the field GF (2n), for n ≤ 500.

j=1 hk,j |8(k, j) 2 [p]⇥[Nk], hk,j 2Hk , and the union of all such families GF,n = S |N|=n GF,N. Fix ⇢ > 0. For a fixed N, the Rademacher complexity of GF,N can be bounded as follows for any m 1: Rm(GF,N)  1 n Pp k=1 Nk Rm(Hk). Thus, the following standard margin-based Rademacher complexity bound holds (Koltchinskii & Panchenko, 2002). For any > 0, with probability at least 1 , for all g 2 GF,...

For an integer n ≥ 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k ∈ {1, 2, . . . , n− 1}, the union of every set of k of these lines has rank k + 1. Spikes are very special and important in matroid theory. Wu [13] found the exact numbers of n-spikes over fields with 2, 3, 4, 5, 7 elements, and the asymptotic values for ...