Search results for "Suffix"

showing 5 items of 75 documents

Les locutions espagnoles : observation de quelques schémas productifs

2019

International audience

analogie[SHS.LANGUE]Humanities and Social Sciences/Linguisticsschémas productifs[SHS.LANGUE] Humanities and Social Sciences/LinguisticsComputingMilieux_MISCELLANEOUSlocutions espagnolesphraséologieSuffixation diminutive
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

A trie-based approach for compacting automata

2004

International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.

automataComputer scienceSuffix tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]suffix tree0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesindex text compressionlaw.inventionlawfactor and suffixTrie0202 electrical engineering electronic engineering information engineeringAutomata and formal languagesPattern matchingDirected acyclic word graphString (computer science)Directed graphDirected acyclic graphMobile automatonAutomaton010201 computation theory & mathematics020201 artificial intelligence & image processingAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

The asymmetric Path-conflation pattern of GO and COME verbs in Aymara

2019

This paper investigates the basic motion verbs sara ‘go’ and juta ‘come’ in Aymara, an indigenous language of the Andes, within the framework of Talmy’s lexical typology (Talmy 2000). In a crosslinguistic perspective, ‘come’ and ‘go’ are assumed to be deictically complementary and have been represented as a kind of Path-conflating verbs, i.e. verbs that include the deictic component of Path in their lexical semantics, which is respectively the direction ‘toward the speaker’ vs that ‘not toward the speaker’. Data from Aymara show in fact that ‘come’ and ‘go’ exhibit an asymmetrical Path-conflation pattern: ‘come’ does inherently entail deictic motion toward the speaker, whereas ‘go’ indicate…

directional suffixeaspectPath-conflationmotion verbspatial deixisSettore L-LIN/01 - Glottologia E Linguistica
researchProduct

Recursion at the crossroads of sequence modeling, random trees, stochastic algorithms and martingales

2013

This monograph synthesizes several studies spanning from dynamical systems in the statistical analysis of sequences, to analysis of algorithms in random trees and discrete stochastic processes. These works find applications in various fields ranging from biological sequences to linear regression models, branching processes, through functional statistics and estimates of risk indicators for insurances. All the established results use, in one way or another, the recursive property of the structure under study, by highlighting invariants such as martingales, which are at the heart of this monograph, as tools as well as objects of study.

modèles auto-régressifs[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]estimation and prediction errorstochastic gradient algorithmschaîne de Markov à mémoire variable[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Digital search treesvariable length Markov chainstrong laws for discrete martingalessuffix trietemps d'occurrences de motifsoptimisation stochastique.dynamical systemtrie des suffixesstochastic optimization.erreur d'estimation et de prédictionArbres digitaux de rechercheauto-regressive modelssystème dynamiquelois fortes de martingales discrètesalgorithmes de gradient stochastiques[MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]occurrences time
researchProduct