Search results for "Suffix"

showing 10 items of 75 documents

SUSTANTIVOS DEVERBALES ALTERNANTES: PROPUESTA PARA UNA CLASIFICACIÓN DIFERENCIAL

2008

[EN] Since the point of view of Cognitive Linguistics, any linguistic form has its own menaing, therfore, any change in the form implies a change in its meaning. Given that, the main goal of this contribution is to systematize the meaning differenes among certain type of deverbal nouns. They share the same matrix verb, but they differ in their form, either because they use a different suffix or because they follow different derivational process.

Linguistics and LanguageAspectualidadMatrix (music)DefectividadVerbSelección metonímicaLanguage and LinguisticsLinguisticslcsh:Philology. Linguisticslcsh:P1-1091NounRestricción semánticaMeaning (existential)SuffixPsychologySustantivo deverbalCognitive linguistics
researchProduct

Doesdarknesslead tohappiness? Masked suffix priming effects

2008

Masked affix priming effects have usually been obtained for words sharing the initial affix (e.g., re action- RE FORM). However, prior evidence on masked suffix priming effects (e.g., bak er -WALK ER ) is inconclusive. In the present series of masked priming lexical decision experiments, a target word was briefly preceded by a morphologically or orthographically related prime, or by an unrelated prime. In Experiment 1, the prime words in the suffix priming condition were formed by their suffixes (e.g., er -WALK ER ). In Experiment 2, the primes included the suffix inserted in a nonsense symbol string (e.g., %%%% er -WALK ER ). In Experiment 3, the primes were formed by a real word that shar…

Linguistics and LanguageDissociation (neuropsychology)Speech recognitionAffixExperimental and Cognitive PsychologyLanguage and LinguisticsEducationSymbol stringDarknessWord recognitionLexical decision taskReal wordSuffixPsychologyLanguage and Cognitive Processes
researchProduct

2020

Abstract Difficulties in phonological processing and speech perception are associated with developmental dyslexia, but there is considerable diversity across people with developmental dyslexia (e.g., dyslexics with and without phonological difficulties). Phonological and morphological awareness are both known to play an important role in reading acquisition. Problems in morpho-phonological information processing could arguably be associated with developmental dyslexia, especially for Finnish, which is a rich morphologically language. We used MEG to study the connection between morpho-phonology in the Finnish language and familial risk for developmental dyslexia. We measured event-related fi…

Linguistics and LanguageSpeech perceptionCognitive Neurosciencemedia_common.quotation_subject05 social sciencesDyslexiaInformation processingExperimental and Cognitive PsychologyVerbmedicine.diseasebehavioral disciplines and activities050105 experimental psychology03 medical and health sciences0302 clinical medicineArts and Humanities (miscellaneous)NounReading (process)Vowelmedicine0501 psychology and cognitive sciencesSuffixPsychology030217 neurology & neurosurgeryCognitive psychologymedia_commonJournal of Neurolinguistics
researchProduct

Secondary grammaticalization and the English adverbial -ly suffix

2015

Author's version of an article in the journal: Language sciences. Also available from the publisher at: http://dx.doi.org/10.1016/j.langsci.2014.10.003 This paper discusses the secondary grammaticalization of the English adverbial -ly suffix and makes claims about the concept of secondary grammaticalization. Secondary grammaticalization is defined as the development of a new grammatical function in an already grammatical element. It is shown that the development of the -ly suffix involves a number of the processes which are associated with grammaticalization, e.g. paradigmatization, specialization, obligatorification, subjectification, layering and persistence. However, none of these proces…

Linguistics and Languageadverbializationzero adverbsGrammaticalizationLanguage and LinguisticsLinguistics-ly adverbsadjectivesEnglishVDP::Humanities: 000::Linguistics: 010::English language: 020secondary grammaticalizationSociologySuffixAdverbialLanguage Sciences
researchProduct

From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization

2007

AbstractWe introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198–207]), are special cases i…

Lossless compressionBoosting (machine learning)General Computer ScienceComputer scienceComputationData_CODINGANDINFORMATIONTHEORYLyndon wordOptimal word permutationTheoretical Computer ScienceCombinatoricsPermutationSuffix treeCombinatorial optimizationBurrows–Wheeler transformTime complexityComputer Science(all)
researchProduct

SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET

2014

In this paper we are interested in the study of the combinatorial aspects related to the extension of the Burrows-Wheeler transform to a multiset of words. Such study involves the notion of suffixes and conjugates of words and is based on two different order relations, denoted by <lex and ≺ω, that, even if strictly connected, are quite different from the computational point of view. In particular, we introduce a method that only uses the <lex sorting among suffixes of a multiset of words in order to sort their conjugates according to ≺ω-order. In this study an important role is played by Lyndon words. This strategy could be used in applications specially in the field of Bioinformatic…

Lyndon words; Burrows-Wheeler transform; Extended Burrows-Wheeler transform; Circular words; Conjugates; Suffixes; SortingSuffixesMultisetTheoretical computer sciencePoint (typography)Burrows–Wheeler transformSettore INF/01 - InformaticaSortingcircular wordExtension (predicate logic)Lyndon wordsBurrows-Wheeler transformLyndon wordField (computer science)ConjugatesconjugateComputer Science (miscellaneous)sortOrder (group theory)suffixeArithmeticextended Burrows-Wheeler transformCircular wordssortingMathematics
researchProduct

Data Augmentation for Pipeline-Based Speech Translation

2020

International audience; Pipeline-based speech translation methods may suffer from errors found in speech recognition system output. Therefore, it is crucial that machine translation systems are trained to be robust against such noise. In this paper, we propose two methods for parallel data augmentation for pipeline-based speech translation system development. The first method utilises a speech processing workflow to introduce errors and the second method generates commonly found suffix errors using a rule-based method. We show that the methods in combination allow significantly improving speech translation quality by 1.87 BLEU points over a baseline system.

Machine translationComputer sciencePipeline (computing)media_common.quotation_subjectSpeech recognition[INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG]speech translationSpeech processingcomputer.software_genreneural machine translation[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]robustness to errorsWorkflow[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG][INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL]Speech translationQuality (business)Noise (video)Suffixcomputermedia_commonHuman Language Technologies – The Baltic Perspective - Proceedings of the Ninth International Conference Baltic HLT 2020
researchProduct

Children's Implicit Learning of Graphotactic and Morphological Regularities

2005

In French, the transcription of the same sound can be guided by both probabilistic graphotactic constraints (e.g., /epsilon t/ is more often transcribed ette after -v than after -f) and morphological constraints (e.g., /epsilon t/ is always transcribed ette when used as a diminutive suffix). Three experiments showed that pseudo-word spellings of 8-to 11-year-old children and adults were influenced by both types of constraints. The influence of graphotactic regularities persisted when reliance on morphological rules was possible, without any falling off as a function of age. This suggests that rules are not abstracted, even after massive amounts of exposure to a rule-based material. These re…

MaleGrammarmedia_common.quotation_subjectLinguisticsStatistical modelLanguage acquisitionVocabularyLinguisticsImplicit learningEducationDiminutiveTranscription (linguistics)PhoneticsTouchPediatrics Perinatology and Child HealthDevelopmental and Educational PsychologyHumansLearningFemaleSuffixChildPsychologymedia_commonChild Development
researchProduct

Automated Extraction of Motivic Patterns and Application to the Analysis of Debussy’s Syrinx

2009

A methodology for automated extraction of repeated patterns in discrete time series data is presented, dedicated to the discovery of musical motives in symbolic music representations. The basic principle of the approach consists in a search for closed patterns in a multi-dimensional parametric space, comprising various features related to melodic and rhythmic aspects, which can be organized into note-based and interval-based descriptions. The pattern description is further reduced through a lossless pruning of the sequence description. This requires in particular a detailed estimation of the specificity relations between patterns. For instance, a pattern is more specific than its suffix, an…

MelodySequencebusiness.industryPattern recognitionComponent (UML)Formal concept analysisRedundancy (engineering)Artificial intelligencePruning (decision trees)SuffixbusinessAlgorithmMathematicsParametric statistics
researchProduct

Suffix Array Construction on Multi-GPU Systems

2019

Suffix arrays are prevalent data structures being fundamental to a wide range of applications including bioinformatics, data compression, and information retrieval. Therefore, various algorithms for (parallel) suffix array construction both on CPUs and GPUs have been proposed over the years. Although providing significant speedup over their CPU-based counterparts, existing GPU implementations share a common disadvantage: input text sizes are limited by the scarce memory of a single GPU. In this paper, we overcome aforementioned memory limitations by exploiting multi-GPU nodes featuring fast NVLink interconnects. In order to achieve high performance for this communication-intensive task, we …

Multi-core processorSpeedupComputer scienceSuffix array0102 computer and information sciences02 engineering and technologyParallel computingData structure01 natural scienceslaw.inventionCUDAShared memory010201 computation theory & mathematicslaw0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingSuffixData compressionProceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing
researchProduct