Much NLP research on Multi-Word Expressions (MWEs) focuses on the discovery of new expressions, as opposed to the identification in texts of known expressions. However, MWE identification is not trivial because many expressions allow variation in form and differ in the range of variations they allow. We show that simple rule-based baselines do not perform identification satisfactorily, and pres...

A scaling technique of numbers in residue arithmetic with the flexible selection of the scaling factor is presented. The required scaling factor can be selected from the set of moduli products of the Residue Number System (RNS) base. By permutation of moduli of the number system base it is possible to create many auxiliary Mixed-Radix Systems (MRS). They serve as the intermediate systems in the...

One of the key issues in both natural language understanding and generation is the appropriate processing of Multiword Expressions (MWEs). MWE can be defined as a semantic issue of a phrase where the meaning of the phrase may not be obtained from its constituents in a straightforward manner. This paper presents an approach of identifying bigram noun-noun MWEs from a medium-size Bengali corpus b...

Objectives: Different treatment approaches have been introduced for children with Speech Sound Disorders (SSD). Minimal pair intervention, Metaphon therapy, and parents and children together approach as linguistically-based approaches are routinely utilized in this population and both of them shared minimal pairs as a common component. The purpose of the current study was to develop and investi...

The paper arose from the fact that the smallest element of the set of Salem numbers is not known. Indeed, it is not even known whether this set has a smallest element. The aim of this paper is to prove that the minimal polynomial of the smallest Salem series of degree n in the field of formal power series over a finite field is given by P (Y ) = Y n −XY n−1 − Y + X − 1, where we suppose that 1 ...

Throughout the text, let R be a commutative ring with identity (often called a commutative unital ring) and with multiplicative group of units R∗. Likewise, let f(x) = a0x +a1x n−1+ · · ·+an−1x+an be a polynomial of the variable x over R such that a0 ∈ R∗. Traditionally, R[x] is the ring of all polynomials of x over R; thereby f(x) ∈ R[x]. For an arbitrary but fixed element α, suppose f(x) is t...

We prove that for all algebraic number β > 1 the strings of zeros in the Rényi βexpansion dβ(1) of 1 exhibit a lacunarity bounded above by log(s(Pβ))/ log(β), where s(Pβ) is the size of the minimal polynomial of β. The conjecture about the specification of the β-shift, equivalently the uniform discreteness of the sets Zβ of β-integers, for β a Perron number is discussed. We propose a classifica...

has some ei greater than 1. If every ei equals 1, we say p is unramified in K. Example 1.1. In Z[i], the only prime which ramifies is 2: (2) = (1 + i)2. Example 1.2. Let K = Q(α) where α is a root of f(X) = T 3 − 9T − 6. Then 6 = α3 − 9α = α(α− 3)(α+ 3). For m ∈ Z, α+m has minimal polynomial f(T −m) in Q[T ], so NK/Q(α+m) = −f(−m) = m3 − 9m+ 6 and the principal ideal (α−m) has norm N(α−m) = |m ...

We derive the linear complexity and the minimal polynomial over the finite fields of order two and p of series of binary sequences with a period 4p and optimal autocorrelation value/magnitude. These sequences are constructed by cyclotomic classes of order two, four and six by methods proposed by K.T. Arasu et al. and Y. Sun et al. We define the parameters of sequences with optimal autocorrelati...

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise inputdependant bounds on these coefficients. Such bounds are e.g. useful to perform deterministic chinese remaindering of the characteristic or minimal polynomi...