Results 11 to 20 of about 421 (161)

Af hverju góðlátlegur en ekki *góðleglátur? Um leyfilegar og óleyfilegar viðskeytaraðir í íslensku

open access: yesOrð og Tunga, 2021
The article discusses suffix combinations in Icelandic with nominal and adjectival suffixes as first members of the combinations, how common these combinations are and which selectional restrictions are central in Icelandic derivational morphology ...
Þorsteinn G. Indriðason
doaj   +1 more source

WORD FORMATION – USING SUFFIXES AND IDENTIFYING DIFFICULTIES IN LEARNING NEWLY-FORMED WORDS / FORMATION DES MOTS – UTILISATION DES SUFFIXES ET IDENTIFICATION DES DIFFICULTÉS DANS L'APPRENTISSAGE DES MOTS NOUVELLEMENT FORMÉS [PDF]

open access: yesStudii si Cercetari Filologice: Seria Limbi Straine Aplicate, 2022
Word formation is a chapter of the English grammar which requires specific attention not only due to its complexity in forming new words, but also in terms of a variety of means by which it is expressed.
Laura IONICĂ
doaj   +1 more source

RECONSTRUCTING A SUFFIX ARRAY [PDF]

open access: yesInternational Journal of Foundations of Computer Science, 2006
For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures,
Franěk, F., Smyth, W.F.
openaire   +2 more sources

Methods of Modification and Semantics of Foreign Anthroponyms in Russian Internet Discourse (Example of Nomination of Members of British Royal Family)

open access: yesНаучный диалог, 2021
The results of a study of the functioning peculiarities of modified foreign anthroponyms in the Russian-language Internet discourse is presented in the article.
Y. A. Tregubova, E. V. Lavrishcheva
doaj   +1 more source

On Suffix Extensions in Suffix Trees

open access: yesTheoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire   +6 more sources

Split and unified functions in the formation of old English nouns and adjectives

open access: yesRevista de Lingüística y Lenguas Aplicadas, 2014
This journal article draws a distinction between the split and unified functions obtaining in the formation of Old English nouns and adjectives. The starting point of the discussion is an enlarged inventory of lexical functions that draw on Meaning-Text ...
Raquel Vea Escarza
doaj   +1 more source

From morphemes to words: A comparative approach to study profession names in Persian and French [PDF]

open access: yesزبان پژوهی, 2020
The current research is based on morphology which is the study of words and how they are formed. Morphology analyzes the internal structure of words and different parts of words; it considers the morphemes as the smallest meaningful units in a language ...
Sanaz Dehkharghani, Nahid Djalili Marand
doaj   +1 more source

Faster suffix tree construction with missing suffix links [PDF]

open access: yesProceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
Summary: We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
openaire   +3 more sources

Why can one be irritabile ‘irritable’ but can not be *divertibile ‘amuse+able’? On Italian -bile adjectives from psychological verbs

open access: yesQuaderns de Filologia: Estudis Lingüístics, 2014
The paper proposes to set out the domain of application of the adjective forming Italian suffix -bile on the basis of the Aktionsart properties of verbs. In particular, -bile adjectives based on object-experiencer psychological verbs are discussed. It is
Antonietta Bisetto
doaj   +1 more source

On the Suffix Automaton with Mismatches [PDF]

open access: yes, 2007
In this paper we focus on the construction of the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of Sk in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition
M. CROCHEMORE   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy