Search results for "Computational linguistics"

showing 10 items of 210 documents

Some applications of a theorem of Shirshov to language theory

1983

Some applications of a theorem of Shirshov to language theory are given: characterization of regular languages, characterization of bounded languages, and a sufficient condition for a language to be Parikh-bounded.

business.industryGeneral EngineeringComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Characterization (mathematics)computer.software_genrePhilosophy of languageAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRegular languageBounded functionComputer Science::Programming LanguagesArtificial intelligencebusinesscomputerNatural language processingEngineering(all)MathematicsInformation and Control
researchProduct

A word prediction methodology for automatic sentence completion

2015

Word prediction generally relies on n-grams occurrence statistics, which may have huge data storage requirements and does not take into account the general meaning of the text. We propose an alternative methodology, based on Latent Semantic Analysis, to address these issues. An asymmetric Word-Word frequency matrix is employed to achieve higher scalability with large training datasets than the classic Word-Document approach. We propose a function for scoring candidate terms for the missing word in a sentence. We show how this function approximates the probability of occurrence of a given candidate word. Experimental results show that the proposed approach outperforms non neural network lang…

business.industryLatent semantic analysisComputer scienceSentence completionComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Statistical semanticsMachine learningcomputer.software_genreSemanticsSemEvalSentence completion testsword space modelLSAScalabilitylanguage modellatent semantic analysisArtificial intelligencebusinesscomputerComputer Science::Formal Languages and Automata TheoryNatural language processingSentenceWord (computer architecture)word predictionProceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)
researchProduct

BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS

2010

We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalized to non periodic infinite words as well.

combinatoria delle parole parole circolari parole bilanciateCombinatoricsCombinatorics on wordsSettore INF/01 - InformaticaComputer Science (miscellaneous)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Formal Languages and Automata TheoryMathematicsInternational Journal of Foundations of Computer Science
researchProduct

A Qualitative and Quantitative Study on Ancient Latin Texts Concerning the Concept of aether : Some Methodological Considerations

2022

My study focuses on the semantic analysis of an ambiguous Latin word, aether, which may roughly be translated as ‘celestial substance’. The study is carried out by utilising both qualitative and quantitative methods on a digital text corpus containing Latin literature dating from ca. 200 BCE to 200 CE. In this paper, the compilation process and the contents of the corpus are described. Beside qualitative research (close reading), various computational methods are implemented on the corpus (distant reading). Of the latter, cosine similarity and correspondence analysis are discussed in this paper. I will explicate one way of combining qualitative and quantitative methods by assigning numerica…

computational linguisticslatinan kieliconceptual historydistributional semanticskäsitehistoriakorpuslingvistiikkacorpus linguisticssemantiikkasemanticslatin languagetietokonelingvistiikka
researchProduct

Where lol is: function and position of lol used as a discourse marker in YouTube comments

2020

Lol is probably one of the most popular words in computer-mediated communication. It is generally taken to be the acronym of “laughing out loud”, but it is not always used to indicate a humorous response; rather, it is multifunctional. Drawing on previous studies of the different functions of lol, this paper explores a possible correlation between the position and function of non-lexicalized lol in the specific context of YouTube comments. The hypothesis is that the function of lol largely depends on its position: clause-initial lol is not used with the same functions as clause-final lol. The data for the study come from the comment threads of three popular YouTube videos posted in 2017, 20…

media_common.quotation_subjectDiscourse analysis[SHS.INFO]Humanities and Social Sciences/Library and information scienceslolContext (language use)[SHS.INFO] Humanities and Social Sciences/Library and information sciencesmarqueur pragmatique030507 speech-language pathology & audiology03 medical and health scienceslcsh:P1-1091Acronym[SHS.LANGUE]Humanities and Social Sciences/LinguisticsFunction (engineering)discours médié par ordinateurmedia_commondiscourse marker060201 languages & linguisticsposition syntaxiqueYouTubemarqueur discursiflcsh:P98-98.506 humanities and the artsPragmatics[SHS.LANGUE] Humanities and Social Sciences/LinguisticsLinguisticslcsh:Philology. Linguistics0602 languages and literaturecomputer-mediated discoursepragmatic markerlcsh:Computational linguistics. Natural language processing0305 other medical sciencePsychologysyntactic positionDiscourse marker
researchProduct

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

minimal automata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Timed automatondeterministic automataBüchi automaton0102 computer and information sciences02 engineering and technology01 natural sciencesDeterministic automaton0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Two-way deterministic finite automatonNondeterministic finite automatonMathematicsonline construction.Discrete mathematicsSettore INF/01 - InformaticaPowerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010201 computation theory & mathematicsProbabilistic automaton020201 artificial intelligence & image processingFinite set of wordAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

The Future of Technology in Positive Psychology: Methodological Advances in the Science of Well-Being

2018

Advances in biotechnology and information technology are poised to transform well-being research. This article reviews the technologies that we predict will have the most impact on both measurement and intervention in the field of positive psychology over the next decade. These technologies include: psychopharmacology, non-invasive brain stimulation, virtual reality environments, and big-data methods for large-scale multivariate analysis. Some particularly relevant potential costs and benefits to individual and collective well-being are considered for each technology as well as ethical considerations. As these technologies may substantially enhance the capacity of psychologists to intervene…

non-invasive brain stimulationpositive psychologylcsh:BF1-990050109 social psychologycomputational linguistics03 medical and health sciences0302 clinical medicinePsychology0501 psychology and cognitive sciencesGeneral PsychologypsychopharmacologyCost–benefit analysisbusiness.industry05 social sciencesInformation technologyIntervention (law)lcsh:PsychologyBrain stimulationPerspectivetechnologyWell-beingvirtual realityEngineering ethicsPositive psychologybusinessPsychology030217 neurology & neurosurgeryFrontiers in Psychology
researchProduct

Finite groups with all minimal subgroups solitary

2016

We give a complete classification of the finite groups with a unique subgroup of order p for each prime p dividing its order. All the groups considered in this paper will be finite. One of the most fruitful lines in the research in abstract group theory during the last years has been the study of groups in which the members of a certain family of subgroups satisfy a certain subgroup embedding property. The family of the subgroups of prime order (also called minimal subgroups) has attracted the interest of many mathematicians. For example, a well-known result of Itˆo (see [8, Kapitel III, Satz 5.3; 9]) states that a group of odd order with all minimal subgroups in the center is nilpotent. Th…

p-groupNormal subgroupFinite groupAlgebra and Number TheoryApplied MathematicsAstrophysics::Instrumentation and Methods for AstrophysicsMinimal subgroupGrups Teoria deComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Fitting subgroupCombinatoricsMathematics::Group TheoryLocally finite groupExtra special groupComputer Science::General LiteratureOmega and agemo subgroupSolitary subgroupÀlgebraIndex of a subgroupFinite groupMATEMATICA APLICADAMathematics
researchProduct

On Prefix Normal Words

2011

We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…

permutation matchingcontext-free languagesSearch engine indexingpre-necklacesBinary numberParikh vectorsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lyndon wordsnon- standard pattern matchingLyndon wordsCombinatoricsPrefixjumbled pattern matchingPattern matchingParikh vectors; pre-necklaces; Lyndon words; context-free languages; jumbled pattern matching; permutation matching; non- standard pattern matching; indexingComputer Science::Formal Languages and Automata TheoryParikh vectors pre-necklaces Lyndon words context-free languages jumbled pattern matching permutation matching non-standard pattern matching indexingMathematicsindexing
researchProduct

Are they different? affect, feeling, emotion, sentiment, and opinion detection in text

2014

A major limitation in the automatic detection of affect, feelings, emotions, sentiments, and opinions in text is the lack of proper differentiation between these subjective terms and understanding of how they relate to one another. This lack of differentiation not only leads to inconsistency in terminology usage but also makes the subtleties and nuances expressed by the five terms difficult to understand, resulting in subpar detection of the terms in text. In light of such limitation, this paper clarifies the differences between these five subjective terms and reveals significant concepts to the computational linguistics community for their effective detection and processing in text.

ta113ta520business.industrymedia_common.quotation_subjectAffect (psychology)Electronic mailTerminologyHuman-Computer InteractionText miningText processingFeelingCultural diversityComputational linguisticsPsychologybusinessSocial psychologySoftwaremedia_commonCognitive psychologyIEEE transactions on affective computing
researchProduct