Search

We characterize the α-large submodules of α-modules in terms of certain sequences of ordinals, and give some of their interesting properties. Also, we deal with α-large submodules of the closure of an unbounded direct sum of uniserial modules, and the α-large submodules of the smallest α-pure fully invariant submodules of the closure containing a given element. [ABSTRACT FROM AUTHOR]

This paper studies the state estimation problem for memristor-based stochastic neural networks (MSNNs) with mixed variable delays. A new Lyapunov-Krasovskii functional (LKF) with quadruple integral terms is incorporated. Then, asymptotic stability conditions are estab- lished for the error system using a linear matrix inequality technique. The estimator gain can be obtained by solving the linear matrix inequalities. Numerical simulations are given to demon- strate the effectiveness and superiority of the new scheme. [ABSTRACT FROM AUTHOR]

For a µ;n dichotomic systems generalization of Palmer's lemma was proved. Necessary and sufficient conditions of the existence of bounded on the whole axis solutions and quasisolutions that minimize the residual norm were obtained. Index of the corresponding operator was found. [ABSTRACT FROM AUTHOR]

We study the problem of finding the common element of the set of fixed points of two nonexpansive mappings in Hilbert spaces. Some previous attempts in this direction make some restrictive assumptions which may be difficult to check in practice on the generated sequence. In this paper, we introduce a viscosity S-iteration scheme for finding the common fixed point of two nonexpansive mappings. Under some very mild conditions, we obtain a strong convergence theorem for the sequence generated by our algorithm. We apply our main result to approximating common fixed points of nonexpansive semigroups. We also provide numerical examples to support our main results and illustrate the efficiency and effectiveness of our algorithm by comparing with some existing algorithms in literature. This work generalizes and improves some existing works in the literature in this direction. [ABSTRACT FROM AUTHOR]

This paper tests whether lemma frequency impacts the duration of homographic noun–verb homophones in spontaneous speech, e.g. cut (n)/ cut (v). In earlier research on effects of lemma frequency (e.g. Gahl 2008), these pairs of words were not investigated due to a focus on heterographic homophones. Theories of the mental lexicon in both linguistics and psycholinguistics differ as to whether these word pairs are assumed to have shared or separate lexical representations. An empirical analysis based on spontaneous speech from the Buckeye corpus (Pitt et al. 2007) yields the result that differences in lemma frequency affect the duration of the N/V pairs under investigation. First, this finding provides evidence for N/V pairs having separate representations and thus supports models of the mental lexicon in which lexical entries are specified for word class. Second, the result is at odds with an account of 'full inheritance' of frequency across homophones and consequently with speech production models implementing inheritance effects via a shared form representation for homophonous words. The findings are best accounted for in a model that assumes completely separate lexical representations for homophonous words. [ABSTRACT FROM AUTHOR]

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and can be decomposed into very homogeneous semialgebraic pieces up to a small error (see e.g. [33, 2, 16, 18]). We show that similar results can be obtained for families of graphs with the edge relation uniformly definable in a structure satisfying a certain model-theoretic property called distality, with respect to a large class of generically stable measures. Moreover, distality characterizes these strong regularity properties. This applies in particular to graphs definable in arbitrary o-minimal structures and in p-adics. [ABSTRACT FROM AUTHOR]

It is shown that the operad maps En → En+k are formal over the reals for k ≥ 2 and nonformal for k = 1. Furthermore we compute the homology of the deformation complex of the operad maps En → En+1, proving an algebraic version of the Cerf lemma. [ABSTRACT FROM AUTHOR]

A graph G is pancyclic if it contains a cycle C of every length with 3≤l(C)≤|V(G)|3≤l(C)≤|V(G)|, where l(C) denotes the length of C and |V(G)||V(G)| denotes the number of vertices in G. In this paper, we propose an augmented pancyclicity problem for the n-dimensional crossed cube CQn, which is a popular variant of the hypercube network. Let dC(u,v)dC(u,v) denote the distance between any two distinct vertices u and v traversed by a cycle C in CQn, n≥4n≥4. Then, for any integer m with [n+/1/2]+1≤m≤2n-1[n+1/2]+1≤m≤2n-1, there exist cycles C of various lengths in CQn such that dC(u,v)=mdC(u,v)=m, where (i) 2m+1≤l(C)≤2n2m+1≤l(C)≤2n if n is odd and m=,n+1/2+1m=,n+12+1 and (ii) 2m≤l(C)≤2n2m≤l(C)≤2n otherwise. This result indicates that any two distinct vertices of crossed cubes can be embedded on cycles of various feasible lengths with keeping any feasible distance from each other. [ABSTRACT FROM AUTHOR]

The paper introduces the ORTOFON corpus of spontaneous spoken Czech and the DIALEKT corpus of Czech dialects, their design principles and practical solutions adopted during data collection. [ABSTRACT FROM AUTHOR]

We explore human judgments on how well individual patterns of 29 target verbs from the Pattern Dictionary of English Verbs describe their random KWICs. We focus on cases where more than one pattern is judged as highly appropriate for a given KWIC and seek to estimate the effect of event participants (arguments) being denotatively similar in two patterns, considering all pair combinations in a given lemma. We compare this effect to the effect of several contextual features of the KWICs, the effect of paired PDEV implicatures implying each other, and the effect of belonging to a given lemma. We show that the lemma effect is still stronger than any feature going across lemmas we have examined so far, so that each verb appears to be a little universe in its own right. [ABSTRACT FROM AUTHOR]

In many languages, some words can be written in several ways. We call them variants. Values of all their morphological categories are identical, which leads to an identical morphological tag. Together with the identical lemma, we have two or more wordforms with the same morphological description. This ambiguity may cause problems in various NLP applications. There are two types of variants - those affecting the whole paradigm (global variants) and those affecting only wordforms sharing some combinations of morphological values (inflectional variants). In the paper, we propose means how to tag all wordforms, including their variants, unambiguously. We call this requirement "Golden rule of morphology". The paper deals mainly with Czech, but the ideas can be applied to other languages as well. [ABSTRACT FROM AUTHOR]

We investigate a finite-time synchronization problem of hybrid-coupled delayed dynamical network via pinning control. According to linear feedback principle and finite-time control theory, the finite-time synchronization can be achieved by pinning control with suitable continuous finite-time controller. Some sufficient conditions are given for finite-time synchronization of undirected and directed complex network by applying finite-time stability lemma. Numerical simulations are finally presented to demonstrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

This contribution deals with n-ary relations and hyperstructure theory. There exists a way of creating semihypergroups and hypergroups from (partially) quasi-ordered (semi)groups known as Ends lemma construction. In this paper, we use this method to introduce a new class of (semi)hypergroup from a given (semi)group endowed with a preordering n-ary relation as a generalization of EL-hyperstructures. Then, we study some basic properties and important elements belonging to this class and the essential differences between this new class and the earlier one (i.e. EL-hyperstructures) are also investigated. [ABSTRACT FROM AUTHOR]

Multi-installment scheduling (MIS) has shown great effectiveness in minimizing the processing time for large-scale partitionable workloads. To derive an optimal MIS strategy, one has to explicitly determine optimal numbers of installments and processors. Existing studies tend to solve this problem by treating the influence of number of installments (and processors) w.r.t processing time as time-continuous functions and taking the derivative of these functions to determine the optimal values, which may lead to invalid solutions. In this paper, we employ periodic multi-installment scheduling (P-MIS) models for homogeneous and heterogeneous single-level tree networks. Using these models we make the following significant contributions. First, we derive a closed-form solution for an optimal number of installments based on a given network size and a fixed load distribution sequence. Second, we propose a heuristic algorithm for determining an optimal number of processors by first proving several important intermediate lemmas and theorems. Third, for heterogeneous systems, we propose a genetic algorithm to determine an optimal load distribution sequence. Finally, we conduct various experiments to illustrate the effectiveness of the proposed algorithms and perform rigorous analysis on the influence of load distribution sequence on processing time, on the basis of which a practical advice for determining a near-optimal load distribution sequence is given. [ABSTRACT FROM PUBLISHER]

In this paper, we give possible suggestions for a classroom lesson about an application of probability using basic mathematical notions. We will approach to some combinatoric results without using ‘induction’, ‘polynomial identities’ nor ‘generating functions’, and will give a proof of the ‘Vandermonde Identity’ using elementary notions of probability. [ABSTRACT FROM AUTHOR]

In this article, we revisit the concept of strong differentiability of real functions of one variable, underlying the concept of differentiability. Our discussion is guided by the Straddle Lemma, which plays a key role in this context. The proofs of the results presented are designed to meet a young audience in mathematics, typical of students in a first course of Real Analysis or an honors-level Calculus course. [ABSTRACT FROM AUTHOR]

We prove a version of the classical λ-lemma for holomorphic families of Riemann surfaces. We then use it to show that critical loci for complex H'enon maps that are small perturbations of quadratic polynomials with Cantor Julia sets are all quasiconformally equivalent. [ABSTRACT FROM AUTHOR]

The present research is a follow-up research of an exploratory validation study of computer-based dictation tests utilizing TTS (text-to-speech) (Choi & Park, 2015). The study attempted to explore the efficacy of different scoring methods utilizing corpus linguistic techniques. To this end, the data collected from a prior study was employed in the research. 117 Korean EFL learners participated in this research and were divided into three groups depending on educational levels as well as their proficiency levels: 37 UNI (advanced), 40 HSU (intermediate), and 40 HSL (low). Participants' responses were scored using six different methods: GS (graduated scoring), AM (appropriate meaning-based scoring), EW (exact-word scoring), WM (wordlist match scoring), WML (wordlist match scoring including lemmas), and WMS (wordlist match scoring including synonyms). Comparative analysis of the efficacy of the scoring methods revealed that the four methods were highly correlated with each other and that corpus-based wordlist matching was found to be the most effective and robust scoring method. Among the three wordlist match scoring methods producing robust results, WM was proven to be the most effective semi-automated method with high practicality, requiring the least amount of time and energy for scoring. [ABSTRACT FROM AUTHOR]

Beinecke papyrus P.CtYBR inv. 5018 consists of a series of well-defined entries, each with three elements: (1) an ordinal number (surviving are '10th' through '15th'); (2) the lemma, no more than a phrase, apparently excerpted from an unknown prose text; (3) literary examples or verbatim quotations, presumably intended to illustrate the content of the lemma. Quoted are a passage from Odyssey 11 and two trimeter lines from an unknown tragedy or tragedies. The contents of the prose text from which the lemmata derive is not clear, but appears to regard poetics or poetic composition. [ABSTRACT FROM AUTHOR]

We establish the splitting lemmas (or generalized Morse lemmas) for the energy functionals of Finsler metrics on the natural Hilbert manifolds of H1-curves around a critical point or a critical R1 orbit of a Finsler isometry-invariant closed geodesic. They are the desired generalization on Finsler manifolds of the corresponding Gromoll-Meyer's splitting lemmas on Riemannian manifolds [Gromoll and Meyer, 'On differentiable functions with isolated critical points', Topology 8 (1969) 361-369; Gromoll and Meyer 'Periodic geodesics on compact Riemannian manifolds', J. Differential Geom. 3 (1969) 493-510]. As an application, we extend to Finsler manifolds a result by Grove and Tanaka ['On the number of invariant closed geodesics', Acta Math. 140 (1978) 33-48; Tanaka, 'On the existence of infinitely many isometry-invariant geodesics', J. Differential Geom. 17 (1982) 171-84] about the existence of infinitely many, geometrically distinct, isometry invariant closed geodesics on a closed Riemannian manifold. [ABSTRACT FROM AUTHOR]

Yamakami (Theoret. Comput. Sci., 2011) studies non-uniform context-free languages. Here, the length of advice is assumed to be the same as that of an input. Let CFL and CFL/n denote the class of all context-free languages and its nonuniform version, respectively. We let CFL(2) denote the class of intersections of two context-free languages. An interesting direction of a research is asking how complex CFL(2) is, relative to CFL. Yamakami raised a problem whether there is a CFL-immune set in CFL(2) - CFL/n. The best known so far is that LSPACE - CFL/n has a CFL-immune set, where LSPACE denotes the class of languages recognized in logarithmic-space. We present an affirmative solution to his problem. Two key concepts of our proof are the overlapped palindrome and Yamakami's swapping lemma. The swapping lemma is applicable to the setting where the pumping lemma (Bar-Hillel's lemma) does not work. Our proof is an example showing how useful the swapping lemma is. In addition, by means of Kolmogorov complexity, we show the following: With respect to realtime deterministic context-free languages, the non-uniform class with parallel advice is not a subset of that with serial advice. [ABSTRACT FROM AUTHOR]

We propose the one-way jumping finite automaton model, restricting the jumping relation of the recently introduced jumping finite automaton so that the machine can only jump over symbols it cannot process in its current state. The reading head of a one-way jumping finite automaton moves deterministically in one direction within the input word, whereas movement of the reading head of jumping finite automaton is non-deterministic. The class of languages accepted by one-way jumping finite automata is different from that of jumping finite automata, in particular, it includes all regular languages, as opposed to the latter. We study one-way jumping finite automata and obtain closure properties, a pumping lemma, and separation results with respect to the classical language classes of the Chomsky hierarchy. [ABSTRACT FROM AUTHOR]

We study 2-absorbing ideals in a commutative semiring S with 1 ≠ 0 and prove some important results analogous to ring theory. More general form of the Prime Avoidance Theorem is also given. We also prove that if I = 〈ha1, a2, ..., ar〉 is a finitely generated ideal of a semiring S and P1, P2,...,Pn are subtractive prime ideals of S such that ⊂ Pi for each 1 ≤ i 6 ≤, then there exist b2,...,br ϵ S such that c = a1 + b2a2 + ... + brar ϵ ⋓ni=1 Pi. [ABSTRACT FROM AUTHOR]

The study of intertextuality, or how authors make artistic use of other texts in their works, has a long tradition, and has in recent years benefited from a variety of applications of digital methods. This article describes an approach for detecting the sorts of intertexts that literary scholars have found most meaningful, as embodied in the free Tesserae website http://tesserae.caset.buffalo.edu/. Tests of Tesserae Versions 1 and 2 showed that word-level n-gram matching could recall a majority of parallels identified by scholarly commentators in a benchmark set. But these versions lacked precision, so that the meaningful parallels could be found only among long lists of those that were not meaningful. The Version 3 search described here adds a second stage scoring system that sorts the found parallels by a formula accounting for word frequency and phrase density. Testing against a benchmark set of intertexts in Latin epic poetry shows that the scoring system overall succeeds in ranking parallels of greater significance more highly, allowing site users to find meaningful parallels more quickly. Users can also choose to adjust both recall and precision by focusing only on results above given score levels. As a theoretical matter, these tests establish that lemma identity, word frequency, and phrase density are important constituents of what make a phrase parallel a meaningful intertext. [ABSTRACT FROM AUTHOR]

A literary criticism of the book "930" is presented. Topics discussed include the three elements of the book comprising the lemma, the anonymous extraction from an unidentified historical work, and glossary of Herodotean usages, the edition of the "Suda" by Thomas Gaisford, and the basis for the identification of anonymous citations provided by the book.

This paper focuses on the newly developed notion of minimum gain and the corresponding Large Gain Theorem. The Large Gain Theorem is an input-output stability result particularly well suited to unstable plants connected in feedback with stable or unstable controllers. This paper aims to facilitate the practical application of these results. An altered definition of minimum gain broadens the applicability of the Large Gain Theorem, and the novel Minimum Gain Lemma provides LMI conditions that imply and are often equivalent to a minimum gain for LTI systems. Numerical examples are provided to clarify the differences between the existing and proposed definitions of minimum gain, highlight the utility of the newly established Minimum Gain Lemma, and demonstrate how the paper's contributions may be employed in practice. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Zipf’s law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf’s law should hold in the most natural way, studying its validity for plain word forms and for the corresponding lemma forms. We analyze several long literary texts comprising four languages, with different levels of morphological complexity. In all cases Zipf’s law is fulfilled, in the sense that a power-law distribution of word or lemma frequencies is valid for several orders of magnitude. We investigate the extent to which the word-lemma transformation preserves two parameters of Zipf’s law: the exponent and the low-frequency cut-off. We are not able to demonstrate a strict invariance of the tail, as for a few texts both exponents deviate significantly, but we conclude that the exponents are very similar, despite the remarkable transformation that going from words to lemmas represents, considerably affecting all ranges of frequencies. In contrast, the low-frequency cut-offs are less stable, tending to increase substantially after the transformation. [ABSTRACT FROM AUTHOR]

In this paper, we prove a Schwarz–Pick lemma for the modulus of holomorphic mappings between the unit balls in complex spaces. This extends the classical Schwarz–Pick lemma and the related result proved by Pavlovi. [ABSTRACT FROM AUTHOR]

Let $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$, where $u^{2}=u$. A relation between the support weight distribution of a linear code $\mathscr{C}$ of type $p^{2k}$ over $R$ and its dual code $\mathscr{C}^{\bot }$ is established. [ABSTRACT FROM PUBLISHER]

This paper presents an approach for verifying the correctness of the feasibility theorem on the deadline driven scheduler (DDS) with the axiom system of Propositional Projection Temporal Logic (PPTL). To do so, the deadline driven scheduling algorithm is modeled by an MSVL (Modeling, Simulation and Verification Language) program and the feasibility theorem is formulated by PPTL formulas with two parts: a necessary part and a sufficient part. Then, several lemmas are abstracted and proved by means of the axiom system of PPTL. With the help of the lemmas, two parts of the theorem are deduced respectively. This case study convinces us that some real-time properties of systems can be formally verified by theorem proving using the axiom system of PPTL. [ABSTRACT FROM AUTHOR]

Abstract: Many tasks related to sentiment analysis rely on sentiment lexicons, lexical resources containing information about the emotional implications of words (e.g., sentiment orientation of words, positive or negative). In this work, we present an automatic method for building lemma-level sentiment lexicons, which has been applied to obtain lexicons for English, Spanish and other three official languages in Spain. Our lexicons are multi-layered, allowing applications to trade off between the amount of available words and the accuracy of the estimations. Our evaluations show high accuracy values in all cases. As a previous step to the lemma-level lexicons, we have built a synset-level lexicon for English similar to SentiWordNet 3.0, one of the most used sentiment lexicons nowadays. We have made several improvements in the original SentiWordNet 3.0 building method, reflecting significantly better estimations of positivity and negativity, according to our evaluations. The resource containing all the lexicons, ML-SentiCon, is publicly available. [Copyright &y& Elsevier]

Abstract: The formulation of fuzzy automata allows us to select a great variety of triangular norms. Depending on the selected triangular norm, a fuzzy automaton can accept a fuzzy language (FA-language) with infinite range. These fuzzy automata are not equivalent to the so-called deterministic fuzzy automata (deterministic automata with a fuzzy subset of final states) which only accept fuzzy languages with finite range. In this paper, we study FA-languages with infinite range and a determinization procedure in order to obtain an equivalent fuzzy deterministic automaton for a given fuzzy automaton. A fuzzy deterministic automaton is a fuzzy automaton which satisfies the deterministic condition in its state transition function. The main contributions of our paper are: (1) a Pumping Lemma of FA-languages with infinite range; (2) the formulation of fuzzy deterministic automata and a Pumping Lemma of FDA-languages; (3) the necessary conditions for the determinization of fuzzy automata under continuous triangular norms which accept fuzzy languages of infinite range; and (4) a determinization algorithm for fuzzy automata, its correctness proof and performance. [Copyright &y& Elsevier]

This paper deals with Γ-groupoids which are generalizations of groupoids and Γ- semigroups. The main purpose of this paper is to extend Green's equivalences and Green's Lemma to suitably restricted Γ-groupoids. We study only Γ-groupoids satisfying some additional conditions and we show that these are sufficient for the statement of Green's equivalences in case of Γ-groupoids. Additional condition sufficient to prove Green's Lemma for Γ-groupoids is provided and some illustrative examples are presented. [ABSTRACT FROM AUTHOR]

Highlights: [•] A corpus-based study of metalinguistic word in present-day English was carried out. [•] Metonymic uses (55%) of word are more frequent than metaphorical uses (24%). [•] The two forms of the lemma word display different semantic profiles. [•] Abstract word is figuratively richer than previously studied body part nouns. [•] Metonymic uses are more conventionalized in nature than basic uses. [ABSTRACT FROM AUTHOR]

We prove an approximation lemma on (stratified) homogeneous groups that allows one to approximate a function in the non-isotropic Sobolev space NL˙1,Q by L∞ functions, generalizing a result of Bourgain-Brezis. We then use this to obtain a Gagliardo-Nirenberg inequality for\dbarb on the Heisenberg group Hn. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we consider effective constructions of the greatest solution of the language inequality . It has been proved by Kunc in 2005 that the greatest solution of is regular provided that B is regular, no matter what A is. However this proof is based on Kruskal's tree theorem, and does not provide any effective way to construct the greatest solution. We focus on this gap in this paper. We give an effective construction of the greatest solution for the following two cases: [(i)] are regular and there exists such that , where is the set of prefixes of words in B, [(ii)] are regular and B is a code with finite decoding delay. Our construction takes the point of view of games. As shown by Kunc in his regularity proof, the construction of the greatest solution can be reduced to the construction of the winning region of a two-player game. Our contribution is to show that the winning regions of the two-player game for the two cases can be constructed effectively. The main ingredient of the construction for the first case is a shrinking lemma for the words on which one of the players has a winning strategy. While the construction for the second case is based on the observation that the two-player game can be reduced to a two-player reachability game played on the transition graph of a one-counter machine. [Copyright &y& Elsevier]

We investigated the effects of age as well as the linked factors of education and bilingualism on confrontation naming in rural Kashmir by creating a culturally appropriate naming test with pictures of 60 objects. We recruited 48 cognitively normal participants whose ages ranged from 18 to 28 and from 60 to 85. Participants in our study were illiterate monolinguals (N = 18) and educated Kashmiri-Urdu bilinguals (N = 30). Hierarchical multiple regression revealed that younger adults performed better than older adults (P < 0.01) and the age effect was quadratic (age²). It also showed Age X Education and Age X L2 Speaking interactions predicted naming performance. The Age X Education interaction indicated that the advantages of greater education increased with advancing age. Since education is in the second language (L2) in our population, this finding is no doubt linked to the Age X L2 Speaking interaction. This suggests that L2 speaking proficiency contributed more to first language (L1) naming with advancing age. [ABSTRACT FROM AUTHOR]

We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow. [ABSTRACT FROM AUTHOR]

The impact-es diachronic corpus of historical Spanish compiles over one hundred books—containing approximately 8 million words—in addition to a complementary lexicon which links more than 10,000 lemmas with attestations of the different variants found in the documents. This textual corpus and the accompanying lexicon have been released under an open license (Creative Commons by-nc-sa) in order to permit their intensive exploitation in linguistic research. Approximately 7 % of the words in the corpus (a selection aimed at enhancing the coverage of the most frequent word forms) have been annotated with their lemma, part of speech, and modern equivalent. This paper describes the annotation criteria followed and the standards, based on the Text Encoding Initiative recommendations, used to represent the texts in digital form. [ABSTRACT FROM AUTHOR]

Highlights: [•] ERPs were obtained while trilinguals performed a digit naming task. [•] Inhibition of non-target languages occurs in trilingual word production. [•] Inhibition is exerted at the lemma selection stage. [Copyright &y& Elsevier]

This article presents the Computer Science Academic Vocabulary List (CSAVL), a pedagogical tool intended for use by English-for-specific-purpose educators and material developers. A 3.5-million-word corpus of academic computer science texts was developed in order to produce the CSAVL. The CSAVL draws from the improved methodologies used in the creation of recent lemma-based word lists such as the Academic Vocabulary List (AVL) (Gardner & Davies, 2014) and the Medical Academic Vocabulary List (MAVL) (Lei & Liu, 2016), which take into account the discipline-specific meanings of academic vocabulary. The CSAVL provides specific information for each entry, including part of speech and CS-specific meanings in order to provide users with clues as to how each item is used within the context of academic CS. Based on the analyses performed in this study, the CSAVL was found to be a more efficient tool for reaching an minimal level of academic CS reading comprehension than the Academic Word List (AWL) (Coxhead, 2000), or the combination of the AWL with the Computer Science Word List (CSWL) (Minshall, 2013). • A lemma-based computer science academic vocabulary list is created. • High-frequency lexical items with discipline-specific meanings are included. • A framework for comparing lists of different units of counting is provided. [ABSTRACT FROM AUTHOR]

The Academic Vocabulary List (AVL) (Gardner & Davies, 2014) is a valuable resource for EAP teachers and students as it identifies potential lexical learning/teaching targets. This study enhances the AVL's pedagogical usefulness by identifying polysemous lemmas in it. Polysemous AVL lemmas are operationalised as those with more than one definition in two lexicographic resources, the Collins COBUILD Advanced Learners' Dictionary and WordNet. This study also examines a theoretical issue, the relationship between the number of meaning senses of AVL lemmas and their frequency in an academic-English corpus. To this end, correlations were calculated between the numbers of AVL lemmas' meaning definitions listed in both lexicographic resources and their frequency in the COCA-Academic corpus. 34.38% of the 2673 AVL lemmas included in both lexicographic resources, excluding homonyms, are polysemous. Most (66.05%) come from the most frequent 1000 AVL lemmas. The number of meaning definitions of AVL lemmas and their frequency are positively correlated. This correlation is non-linear, i.e., low-frequency words tend to be monosemous but beyond a frequency threshold, word definitions increase as word frequency increases. Implications for future research and teaching are discussed. · We examined polysemy in the Academic Vocabulary List using the Collins COBUILD Advanced Learners' Dictionary and WordNet · AVL lemma frequency in COCA-Academic and dictionary definitions are positively correlated · 919 (34.38%) of the 2673 AVL lemmas shared between the two lexicographic resources are polysemous · 607 (65.05%) of polysemous AVL lemmas are in the most frequent 1000 AVL lemmas · The list of polysemous AVL lemmas is provided [ABSTRACT FROM AUTHOR]

Abstract: For a word S, let be the largest integer m such that there are two disjoint identical (scattered) subwords of length m. Let . Here, it is shown that using the regularity lemma for words. In other words, any binary word of length n can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length . A similar result is proven for k identical subwords of a word over an alphabet with at most k letters. [Copyright &y& Elsevier]

The SUBTLEX-US corpus has been parsed with the CLAWS tagger, so that researchers have information about the possible word classes (parts-of-speech, or PoSs) of the entries. Five new columns have been added to the SUBTLEX-US word frequency list: the dominant (most frequent) PoS for the entry, the frequency of the dominant PoS, the frequency of the dominant PoS relative to the entry's total frequency, all PoSs observed for the entry, and the respective frequencies of these PoSs. Because the current definition of lemma frequency does not seem to provide word recognition researchers with useful information (as illustrated by a comparison of the lemma frequencies and the word form frequencies from the Corpus of Contemporary American English), we have not provided a column with this variable. Instead, we hope that the full list of PoS frequencies will help researchers to collectively determine which combination of frequencies is the most informative. [ABSTRACT FROM AUTHOR]

Abstract: It is not clear how compound words are represented within the influential framework of the lemma-lexeme theory. Theoretically, compounds could be structured through a multiple lemma architecture, in which the lemma nodes of both the compound and its constituents are involved in lexical processing. If this were the case, syntactic properties of both the compound and its constituents should play a role when performing tasks involving compound processing, e.g., compound-word reading. This issue is investigated in the present study through an assessment of the performance of a deep dyslexic patient (GR) in three compound-reading experiments. In the first experiment, verb–noun (VN) compound nouns (e.g., lavapiatti, “dishwasher”, lit. wash-dishes) were employed as stimuli, while in the second, VN compound stimuli were embedded in sentences, and were compared to paired verb phrases (e.g., lui lava piatti, “he washes dishes”). Position-specific effects were ruled out by means of a third experiment, which investigated the retrieval of noun-noun compounds (e.g., pescespada, “swordfish”, lit. fishsword). In experiment 1, GR made errors on the verb constituent more frequently than on the noun, an effect that did not emerge in Experiment 2: when embedded in sentences, VN compounds were read significantly better than verb-phrases and no grammatical-class effect emerged. In Experiment 3, the first and the second constituent were read with the same level of accuracy. The disproportionate impairment, which emerged in reading the verb component of nominal VN compounds, indicates that the grammatical properties of constituents are being retrieved, and thus confirms access to the constituent lemma-nodes. However, the results suggested a whole-word representation when compounds are embedded in sentences; since the sentence context affects the access to compounds through syntactic constraints, whole-word representation is arguably at the lemma level as well (multiple-lemma representation). Experiment 3 indicates that these effects cannot be accounted for by a position-specific impairment. [Copyright &y& Elsevier]

Abstract: This paper reports on lemma-based phonetic variation observed during a year-long sociophonetic ethnography of an all girls'' high school in New Zealand. In-depth acoustic analysis was conducted on tokens of the word like from the girls'' speech. This is a word with a number of different grammatical functions, such as quotative like (I was LIKE “yeah okay”), discourse particle like (It was LIKE so boring), and lexical verb like (I LIKE your socks). The results provide evidence that the different functions of like can vary systematically in terms of their phonetic realisations and that the realisations of some phonetic variables may vary depending on a combination of a word''s function and the social group of the speaker who produced it. Additionally, the results provide evidence of a relationship between phonetic reduction and an individual speaker''s probability of using like when producing a quotative. This finding lends support to probabilistic models of speech production where activation is not filtered through a phonological buffer and where there is a link between lemma-based and acoustically rich information. [Copyright &y& Elsevier]

In this paper, we introduce a permuting tri-(σ,τ ) -derivation and permuting tri-generalized derivation in a near ring and generalize some of the results in [4], [6], [8]. [ABSTRACT FROM AUTHOR]

The aim of this article is to give new forms of Stolz-Cesaro lemma involving the limit [image omitted] [ABSTRACT FROM AUTHOR]