Search results for "Natural language"

showing 10 items of 650 documents

Languages of Baltic Countries in Digital Age

2018

Today, when we are surrounded by intelligent digital devices – computers, tablets and mobile phones, we expect communication with these devices in a natural language. Moreover, such communication needs to be in our native language. We also expect that language technologies will not only assist us in everyday tasks, but also will help to overcome problems caused by language barriers. This keynote will focus on language resources and tools that facilitate use of languages of three Baltic countries – Estonian, Latvian and Lithuanian -in digital means (computers, tablets, mobile phones), allow to minimize language barriers, facilitate social inclusion, and support more natural human-computer in…

World Wide WebComputer scienceFirst languagelanguageLatvianLanguage barrierNatural (music)LithuanianOn LanguageEstonianlanguage.human_languageNatural language
researchProduct

Puhekaverina botti

2020

Viestivät tekoälyt eli luonnollisella kielellä käytävään keskusteluun kykenevät algoritmit ovat yhä tyypillisempiä vuorovaikutuskumppaneita erilaisilla teknologisilla alustoilla. Yksi tyypillinen viestivän tekoälyn muoto on botti: automaattinen ohjelma, joka käyttää verkkopalvelun käyttäjätiliä tavallisen käyttäjän tavoin ja suorittaa yksinkertaisia toimintoja tai viestii. Tyypillisesti botit tavalla tai toisella pyrkivät näyttäytymään ihmiskäyttäjinä, tai ainakin niille ohjelmoidaan ja suunnitellaan ihmisenkaltaisia piirteitä.Artikkeli tarkastelee bottien roolia vuorovaikutuskumppaneina sisäisessä ja julkisessa mediatilassa kytkeytymällä tuoreeseen ihmis-koneviestinnän tutkimusalaan. Keski…

World Wide WebFocus (computing)Advertising campaignComputer scienceAgency (philosophy)Organizational communicationSocial mediaContext (language use)Natural languageLähikuva – audiovisuaalisen kulttuurin tieteellinen julkaisu
researchProduct

A Virtual Shopper Customer Assistant in Pervasive Environments

2007

In this work we propose a smart, human-like PDA-based personal shopper assistant. The system is able to understand the user needs through a spoken natural language interaction and then stores the preferences of the potential customer. Subsequently the personal shopper suggests the most suitable items and shops that match the user profile. The interaction is given by automatic speech recognition and text-to-speech technologies; localization is allowed by the use of Wireless technologies, while the interaction is performed by an Alice-based chat-bot endowed with reasoning capabilities. Besides, being implemented on a PDA, the personal shopper satisfies the user needs of mobility and it is als…

World Wide WebUser profileNatural language interactionComputer sciencebusiness.industryPervasive systemsWirelessUser needsUSablebusinessMobile device
researchProduct

Qualifying semantic graphs using model checking

2011

International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns t…

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[INFO.INFO-WB] Computer Science [cs]/WebComputer science[ INFO.INFO-WB ] Computer Science [cs]/Web0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesSocial Semantic Webtemporal logicSemantic similaritySemantic computing0202 electrical engineering electronic engineering information engineeringSemantic analyticsSemantic integrationSemantic Web StackInformation retrievalbusiness.industry[INFO.INFO-WB]Computer Science [cs]/WebSemantic search020207 software engineeringSemantic interoperability[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationModel-checking010201 computation theory & mathematicsSemantic graphTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS[INFO.INFO-MO] Computer Science [cs]/Modeling and SimulationArtificial intelligencebusinesscomputerNatural language processing2011 International Conference on Innovations in Information Technology
researchProduct

A simple algorithm for finding short sigma-definite representatives

2010

We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.

[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]Braid groupbraid monoids20F3620M0506F05Group Theory (math.GR)02 engineering and technology01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]Mathematics::Group TheoryMathematics::Category TheoryMathematics::Quantum AlgebraFOS: MathematicsBraidBraid group0101 mathematicsSIMPLE algorithmMathematicsDiscrete mathematicsGenerator (computer programming)algorithmAlgebra and Number Theory010102 general mathematicsSigmaComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)021001 nanoscience & nanotechnologyMathematics::Geometric Topologybraid orderingIndex (publishing)0210 nano-technologyMathematics - Group TheoryWord (computer architecture)Journal of Algebra
researchProduct

Le grand débat national, une aide pour prendre des décisions locales?

2021

The Great National Debate, decided by Emmanuel Macron at the beginning of 2019 to respond to the Yellow Vests social movement, allowed the collection of citizens’ contributions on the ecological transition via an online platform. In this article, we use the corpus constituted by these contributions to identify areas where participants are asking for the development of bicycle paths and railway facilities. For this purpose, we have created a classification model to identify contributions dealing with the theme of transportation and proposed a method for extracting patterns that reflect the contributors’ proposals. We then represented these patterns on maps, using the contributors’ postal cod…

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing/I.2.7.0: DiscourseMotifs[SHS.GEO] Humanities and Social Sciences/GeographyGrand Débat NationalTransport[SHS.GEO]Humanities and Social Sciences/GeographyPatternsACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
researchProduct

Asymptotic bit frequency in Fibonacci words

2021

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Mathematics::CombinatoricsDiscrete Mathematics (cs.DM)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics (math.CO)[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

On the suffix automaton with mismatches

2007

International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k 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 index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.

approximate string matchingFibonacci numberlanguages with mismatches[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix treeBüchi automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatoricsPrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringSuffix automaton020201 artificial intelligence & image processingsuffix automatacombinatorics on wordsComputer Science::Data Structures and Algorithmscombinatorics on words suffix automata languages with mismatches approximate string matchingWord (computer architecture)Computer Science::Formal Languages and Automata TheoryMathematics
researchProduct

2020

To successfully learn using open Internet resources, students must be able to critically search, evaluate and select online information, and verify sources. Defined as critical online reasoning (COR), this construct is operationalized on two levels in our study: (1) the student level using the newly developed Critical Online Reasoning Assessment (CORA), and (2) the online information processing level using event log data, including gaze durations and fixations. The written responses of 32 students for one CORA task were scored by three independent raters. The resulting score was operationalized as “task performance,” whereas the gaze fixations and durations were defined as indicators of “pr…

business.industry05 social sciencesInformation processing050301 educationProcess miningContrast (statistics)Dual process theorycomputer.software_genre050105 experimental psychologyLatent class modelTask (project management)Eye tracking0501 psychology and cognitive sciencesPerformance indicatorArtificial intelligencePsychologybusiness0503 educationcomputerGeneral PsychologyNatural language processingFrontiers in Psychology
researchProduct

Pattern languages with and without erasing

1994

The paper deals with the problems related to finding a pattern common to all words in a given set. We restrict our attention to patterns expressible by the use of variables ranging over words. Two essentially different cases result, depending on whether or not the empty word belongs to the range. We investigate equivalence and inclusion problems, patterns descriptive for a set, as well as some complexity issues. The inclusion problem between two pattern languages turns out to be of fundamental theoretical importance because many problems in the classical combinatorics of words can be reduced to it.

business.industryApplied MathematicsInferenceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Inductive reasoningcomputer.software_genreComputer Science ApplicationsPhilosophy of languageComputational Theory and MathematicsrestrictFormal languageArtificial intelligenceEquivalence (formal languages)ArithmeticbusinesscomputerComputer Science::Formal Languages and Automata TheoryNatural language processingMathematicsInternational Journal of Computer Mathematics
researchProduct