Search results for " Languages"

showing 10 items of 1859 documents

Phonological precision for word recognition in skilled readers

2019

According to the lexical quality hypothesis (Perfetti, 2007), differences in the orthographic, semantic, and phonological representations of words will affect individual reading performance. Whilst several studies have focused on orthographic precision and semantic coherence, few have considered phonological precision. The present study used a suite of individual difference measures to assess which components of lexical quality contributed to competition resolution in a masked priming experiment. The experiment measured form priming for word and pseudoword targets with dense and sparse neighbourhoods in 84 university students. Individual difference measures of language and cognitive skills …

Physiologymedia_common.quotation_subjectExperimental and Cognitive PsychologySemanticsSocial and Behavioral SciencesPsyArXiv|Social and Behavioral Sciences|Linguistics|Psycholinguistics and NeurolinguisticsPhoneticsPhysiology (medical)Reading (process)Reaction TimeHumansPsychologyQuality (business)bepress|Social and Behavioral Sciences|Linguistics|Psycholinguistics and Neurolinguisticsindividual differencesLexical Quality Hypothesissemanticsbepress|Social and Behavioral Sciences|LinguisticsGeneral PsychologyLanguageVDP::Humaniora: 000::Språkvitenskapelige fag: 010media_commonVisual Word recognitionVisual word recognitionorthographyCognitive PsychologyPhonologyLinguisticsGeneral Medicinebepress|Social and Behavioral Sciences|Psychology|Cognitive PsychologyPsyArXiv|Social and Behavioral Sciences|Cognitive Psychology|LanguageFOS: PsychologyPsyArXiv|Social and Behavioral SciencesphonologyNeuropsychology and Physiological PsychologyPsycholinguistics and NeurolinguisticsPattern Recognition VisualReadingWord recognitionbepress|Social and Behavioral SciencesPsyArXiv|Social and Behavioral Sciences|Cognitive PsychologyFOS: Languages and literatureAffect (linguistics)PsychologyPsyArXiv|Social and Behavioral Sciences|LinguisticsOrthographyCognitive psychology
researchProduct

Język polski na Uniwersytecie Łotewskim w Rydze

2015

The Polish language at the Latvian University in RigaThe history of teaching of Polish language in the University of Latvia (LU) starts soon after its establishment in 1919. In the 1930s thanks to such famous scientists as Julian Krzyżanowski and Stanisław Kolbuszewski, the number of subjects connected with the Polish culture has increased at the Faculty of Philology and Philosophy and the Latvian society was introduced to the numerous works of these professors, published in different publications in Latvia. After the Second World War, Polish language has been taught within Russian philology with the aim of comparison Eastern and Western Slavic language groups. At the same time scientific w…

Polish-Latvian cultural tieslcsh:Ethnology. Social and cultural anthropologyLinguistics and LanguagePolish studiesmedia_common.quotation_subjectlcsh:PG1-9665World War IIForeign languageLatvianArtPolishPolish literatureBachelorPolish as the foreign languageLanguage and Linguisticslanguage.human_languageUniversity of Latvialcsh:GN301-674Philologylcsh:Slavic languages. Baltic languages. Albanian languageshistory of Polish literaturelanguageCenter of Bohemistics and PolonisticsClassicsmedia_commonActa Baltico-Slavica
researchProduct

The Slovak Case: From Upper Hungary’s Slavophone Populus to Slovak Nationalism and the Czechoslovak Nation

2009

As a political entity, Slovakia emerged in 1918 within the broader framework of Czechoslovakia. The ethnonym ‘Slovak,’ though known since the mid-15th century, denoted either a Slav in general or a Slavophone inhabitant of Upper Hungary. Only in the course of the 19th century was the usage limited exclusively to the latter case. Although the name ‘Slovakia’ for the region where the Slovaks lived appeared at the end of the 18th century, it did not gain any official recognition until 1918 when Czechoslovakia came into being. Clearly, the nationalism of the Slovaks is much more steeped in ethnicity than that of the Magyars, the Poles, or the Czechs (Flajshans 1924: 5, 307).

PoliticsGeographyEthnonymEthnic grouplanguageSlovakSlavic languagesOfficial languageAncient historylanguage.human_languageNationalism
researchProduct

InternallyK-like spaces and internal inverse limits

2014

Abstract We establish equivalences between compacta that admit mappings that limit to the identity, and compacta that are inverse limits of the images under these maps. Our results have relationships to Mardesic and Segalʼs equivalence between polyhedra-like compacta and inverse limits of polyhedra, to the Anderson–Choquet Embedding Theorem, to approximative absolute neighborhood retracts, and to continua that are approximated from within as defined by C.A. Eberhart and J.B. Fugate.

PolyhedronPure mathematicsMathematical analysisInverseEmbeddingGeometry and TopologyEquivalence (formal languages)MathematicsTopology and its Applications
researchProduct

Minimal Absent Words in Rooted and Unrooted Trees

2019

We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.

Polynomial (hyperelastic model)050101 languages & linguistics05 social sciencesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)02 engineering and technologyCombinatoricsTree (descriptive set theory)CardinalityInteger0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesAlphabetMinimal Absent Words Rooted trees Unrooted Trees AlgorithmsNonlinear Sciences::Pattern Formation and SolitonsComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Inglés contra valenciano. La introducción del multilingüismo en el sistema lingüístico educativo valenciano

2017

Aquest treball tracta sobre l’ús polític de les llengües i, singularment, centra l’atenció en el programa de plurilingüisme educatiu posat en marxa pel govern de la Generalitat Valenciana el 2012. Considerem que aquesta iniciativa obeïa una voluntat conscient del partit en el govern (PP) de minoritzar més encara el valencià davant el castellà, amb l’excusa de millorar el coneixement d’anglés. Ara bé, la iniciativa valenciana no és un fet aïllat, s’emmarca dins d’una proposta política d’àmbit estatal orientada a garantir la preeminència del castellà i debilitar le polítiques lingüístiques educatives favorables a les altres llengües espanyoles. Val a dir que fem el treball des de l'òptica com…

Política lingüística Comunidad Valenciana educación plurilingüismo diversidad lingüística multilingüismo.lcsh:Language and LiteratureEducació Aspectes políticslcsh:PC1-5498lcsh:Romanic languageslcsh:PValenciàLinguistic policy País Valencià education plurilingualism linguistic diversity multilingualism.Política lingüística País Valencià educació plurilingüisme diversitat lingüística multilingüisme.Revista de Llengua i Dret - Journal of Language and Law
researchProduct

On the Size Complexity of Deterministic Frequency Automata

2013

Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…

Powerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesCombinatoricsDeterministic pushdown automatonDeterministic finite automatonDeterministic automatonComputer Science::Programming LanguagesQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Monadic second-order logic over pictures and recognizability by tiling systems

1994

We show that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system if and only if it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and matches a natural logic. The proof is based on the Ehrenfeucht-FraIsse technique for first-order logic and an implementation of “threshold counting” within tiling systems.

Predicate logicDiscrete mathematicsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceSubstructural logicSecond-order logicMultimodal logicDynamic logic (modal logic)Intermediate logicHigher-order logicComputer Science::Formal Languages and Automata TheoryMonadic predicate calculusMathematics
researchProduct

Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems

1996

Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.

Predicate logicMonadic second-order logicDiscrete mathematicsNatural logicIntermediate logicHigher-order logicMonadic predicate calculusComputer Science ApplicationsTheoretical Computer ScienceMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and MathematicsComputer Science::Logic in Computer ScienceMany-valued logicDynamic logic (modal logic)Computer Science::Formal Languages and Automata TheoryInformation SystemsMathematicsInformation and Computation
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct