Search results for "Language and speech"

showing 6 items of 166 documents

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

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

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

Zaburzenia neurorozwojowe. Zmiany w podejściu teoretycznym i diagnostycznym

2019

Na potrzeby diagnozy i terapii powstały typologie medyczne o zasięgu ogólnoświatowym. Do najbardziej znanych i powszechnie stosowanych zalicza się ICD (ang. International Statistical Classification of Diseases and Related Health Problems) – Międzynarodową Statystyczną Klasyfikację Chorób i Problemów Zdrowotnych ICD oraz DSM (ang. Diagnostic and Statistical Manual of Mental Disorders) – Klasyfikację Zaburzeń Psychicznych DSM, których nowe edycje stanowią przedmiot zainteresowań autorek. W artykule wskazano światowe trendy i kierunki zmian, jakie się dokonują w obszarze terminologii i kategoryzowania zaburzeń rozwoju psychicznego (neurorozwojowych) i związanych z nimi rozwojowych zaburzeń jęz…

rozwojowe zaburzenia językalanguage and speech development disorderszaburzenia rozwoju psychicznegoICDneurodevelopmental disorderslanguage development disorderszaburzenia rozwoju mowy i językamental development disordersmiędzynarodowe klasyfikacje medyczne DSMzaburzenia neurorozwojoweinternational medical classifications DSMLogopedia
researchProduct