Sylviane R. Schwer

Sylviane R. Schwer
Université Paris 13 Nord | Paris 13 Nord · Galilee Institute

Professor

About

76
Publications
6,610
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
367
Citations
Introduction
Sylviane R. Schwer currently works at the Galilee Institute, Université Paris 13 Nord. Sylviane does research in numeral and temporal representation in languages.

Publications

Publications (76)
Presentation
Full-text available
L'enseignement des probabilités peut se heurter aux représentations culturelles et cultuelles du hasard chez les élèves. Nous proposons une approche qui s'appuie sur les représentations initiales des élèves, qui peuvent persister jusqu'à l'université. Une activité, dérivable de la 5° à l'université est proposée autour du jeu du Quinquenove, très en...
Presentation
Full-text available
le système de numération orale française est de base le million, terme du XIII° siècle. Au-delà de mille, il est parfaitement régulier, bien que peu de personnes savent dire des nombres de plus d'une vingtaine de chiffres. En revanche, en dessous de mille, le système a hérité d'une part du système proto-indo-européen que lui a transmis la langue la...
Preprint
Les systèmes linguistiques de numération orale reflètent des éléments de culture fortement ancrés dans la conscience collective, et par conséquent très résistants aux changements, notamment pour les plus petits nombres. Les numérations orales des variétés d'occitan et de français sont issus de la numération décimale latine. Les évolutions phonologi...
Article
Overcounting is a neologism which was proposed in the late XXth century to define « the operation that designates a number by its orientation towards a boundary ». With a few examples taken from Asiatic languages, Mayan numerations from Central America are generally given as representative of this uncommon type of linguistic operation to build word...
Presentation
Full-text available
Conférence donnée lors de la semaine des mathématiques 2019 dont le thème était "Jouons ensemble aux mathématiques" pour montrer que les jeux et récréations mathématiques constitue un thème éducatif récurrent.
Book
Full-text available
Quel rapport y-a-t-il entre des déplacements sur un échiquier, des alignements de séquences ADN, la probabilité de la durée d’un jeu de pile ou face, les temps du verbe en français et le découpage d’un diamant Aztec ? Les chemins et les nombres de Delannoy, qui les modélisent et les comptent. Henri Auguste Delannoy (1833-1915), dont le centenaire d...
Presentation
Full-text available
Explication historique et linguistique du système des numéraux cardinaux en français.
Chapter
Full-text available
Les termes hier / aujourd'hui / demain forment une triade de repérage temporel déictique naturellement associée à l'unité temporelle JOUR, avec des emplois métaphoriques qui décrivent des phases contiguës du cycle de vie d'un individu ou d'une société. Aucun indice morphosyntaxique ne permet de distinguer les deux, bien qu'il n'y ait aucune ambiguï...
Conference Paper
Full-text available
We describe our approach to build a new model of Time Expressions Recognition in Vietnamese, including a temporal reasoning tool in order to provide an automatic supervised learning system based on a socio-cultural linguistic approach. The Vietnamese morphem hôm is taken for examplification of the impediments to be solved.
Working Paper
Full-text available
This paper provides a comparative perspective of proximal deictic temporal markers, examining both language-specific and cross-linguistic patterns. The expressions considered are based on three types of time-reckoning terms, reflecting distinct types of abstract segmentation and referring to distinct temporal cycles: FUNDAMENTAL CALENDAR UNITS (e.g...
Article
Full-text available
The aim of this talk is to compare the semantics and distribution of the Mandarin adverb "zài" and the French adverb "encore". • We will characterize "encore" and "zài" as two repetitive adverbs, sharing the same presuppositional semantics ; • We will show that the interpretive and distributional differences between them can be described as terms o...
Article
Ce travail etudie les proprietes semantiques de l'adverbe zai ??? du chinois mandarin, que nous analysons comme un adverbe de repetition restreint aux evenements prospectifs par rapport au temps d'evaluation, et comparons avec l'adverbe encore du francais, en reprenant l'analyse de Renaud et Luo (1987). Un examen detaille des contraintes imposees p...
Article
Full-text available
Nous présentons un cadre unique de description des différents modèles référentiels et procéduraux de descriptions des temps verbaux, fondé sur la notion de \emph{points spécieux}, associée à celle de neutralité de la forme des extensions temporelles des éléments des modèles. Ce cadre permet à la fois la description et le calcul des relations décrit...
Article
Full-text available
Nous rappelons brièvement les ontologies temporelles et aspectuelles proposéees dans la littérature pour représenter les informations temporelles. Il apparait que l'évenance n'aurait pas d'existence ontologique directe. Cependant, elle est pertinence car c'est sur elle que sont construites les notions d'aspect et de temps. Après avoir montré le rôl...
Conference Paper
Full-text available
Parthood Relation: an historical point of view Theories based on relations between parts and wholes are currenty named mereologies (from the Greek µǫρoς, part). The roots of mereology can be traced back to the early stage of western philosophy, beginning with the Presocratic. Four notions are connected : part versus bit, whole versus unit.
Article
Full-text available
The first part is an historical review of the "part-of" relations. In the second part, properties linked to this relation in mathematics, information systems and linguistics are treated. In part III deals with the part-of relation and the verbal predication.
Article
Full-text available
Temporal expressions that refer to a part of a calendar area in terms of common calendar divisions are studied. Our claim is that such a "cal- endar expression" (CE) can be described by a succession of operators operating on a calendar base (CB). These operators are categorized: a pointing operator that transform a CB into a CE; a focalizing/shifti...
Article
Processing literature (i.e., text corpora) to capture gene regulation events is not easy and can be driven by the final data representation. We propose to build, manually, an example of temporal representation (whole gene networks for coat formation in Bacillus Subtilis). Our temporal representation is based on a generalised formal language theory...
Article
Full-text available
Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of natural language processing for instance, the temporal analysis of a text yields a set of temporal relations between events in a given linguistic theory. The problem is firs...
Article
Full-text available
Representing and reasoning about qualitative temporal information is an essential part of many artificial intelligence tasks. Lots of models have been proposed in the litterature for representing such temporal information. All derive from a point-based or an interval-based framework. One fundamental reasoning task that arises in applications of the...
Article
Full-text available
This paper proposes an innovative way of modelising time with mathematical tools. Based on the classical formalism of Reichenbach and on the numerous linguistic approaches that endorse a Reichenbach-like relational-referential view, our formalism is taken from what is generally called S-languages . This model has three main advantages, which are ad...
Article
Full-text available
Dans cet article, nous nous proposons dans une première partie de donner un aperçu de la théorie des catastrophes de René Thom, et plus précisément l'application qu'il en donne à la linguistique ainsi qu'une approche généraliste de la théorie du chaos. Dans une seconde partie, nous présentons les premiers éléments d'une analyse du roman "Topologie...
Article
Full-text available
The formalizations of periods of time inside a linear model of Time are usually based on the notion of intervals, that may contain or may not their endpoints. This is not enought when the periods are written in terms of coarse granularities with respect to the event taken into account. For instance, how to express the inter-war period in terms of a...
Article
Full-text available
à paraître dans cahiers Chronos
Article
Full-text available
Cette biographie traite en annexe du legs de la bibliothèque mathématique de Delannoy à la ville de Guéret.
Article
Full-text available
Les S-langages de Sylviane Schwer constituent un outil précieux de traitement de la temporalité dans les textes.
Article
Full-text available
représentation catégorique des ordinaux. Il expose ensuite un projet d'aide à la lecture d'un texte biographique long selon une navigation temporelle. ABSTRACT. In this paper, first we examine the usual treatment of temporal information and we recall the main features relative to the temporality analysis in texts. Then we deal with the formal repre...
Article
This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the fir...
Article
Full-text available
To begin with, we give an overview of linguistics frameworks on the narratives temporal structures calculus. Then, the formal language of S-languages is described. This framework offers both a unified representation of temporal relations and an operation (the joint) which computes combinations between such relations. Finally, we describe a software...
Article
A Delannoy path is a minimal path with diagonal steps in ℤ 2 between two arbitrary points. We extend this notion to the n-dimensional space ℤ n and identify such paths with words over a special kind of alphabet: an S-alphabet. We show that the set of all the words corresponding to Delannoy paths going from one point to another is exactly one class...
Article
Nous étudions les correspondances naturelles entre l'ensemble des arrangements de parties d'un ensemble avec répétitions et des ensembles d'objets rencontrés dans des domaines variés des mathématiques (chemins dans des treillis de dimension n, pré-ordres) et de l'informatique (langages formels, réseaux de Petri, intelligence artificielle), en utili...
Article
A Delannoy path is a minimal path between two given points on Z2, with horizontal, vertical and diagonal steps. We study the Delannoy paths as a special class of a congruence defined by a Thue system. This system induces a partial ordering of the set of Delannoy paths, which actually is a distributive lattice. This system also admits a natural inte...
Article
Full-text available
Starting from the basic notion of chronology, we provide a natural representation of calendars and appropriate tools for manipulating them, inside the framework of finite ordinals category. We show that calendars are closed under infimum and supremum operations but not under direct limits.
Conference Paper
The formalizations of periods of time inside a linear model of Time are usually based on the notion of intervals, that may contain or may not their endpoints. This is not enough when the periods are written in terms of coarse granularities with respect to the event taken into account. For instance, how to express the inter-war period in terms of a...
Article
Full-text available
Nous étudions quelques aspects combinatoires de l'ensemble des arrangements de blocs avec répétitions de tas ou multi-ensembles en utilisant le cadre des langages formels.
Article
Full-text available
Nous étudions quelques familles d'objets isomorphes à l'ensemble des arrangements avec répétitions par des blocs de tas ou multi-ensembles puis nous introduisons une op\ération algéébrique de composition fondée sur les S-mots.
Conference Paper
The formalization of periods of time inside a linear model of Time are based on the notion of intervals, that can or not contain their endpoints. It is quite insufficient when these periods are expressing in terms of coarse granularities with respect to the event taken into account. For instance, how to express the inter-war period in terms of a ye...
Article
Full-text available
Représenter et raisonner sur des informations temporelles qualitatives, incomplètes et imprécises constitue une partie essentielle de nombreux travaux en intelligence artificielle. Les modèles de représentation de ces informations temporelles reposent soit sur le concept d'intervalle, soit sur celui de point. Raisonner dans l'algèbre d'intervalle d...
Article
Full-text available
The aim of this paper consists in defining an algebra allowing the request of structured documents in the context of object oriented approach. The operators of this algebra are defined in conformity with the concepts of the object model. It takes into consideration not only the embedding of structures and links between them, but also the informatio...
Patent
Full-text available
State of the art (1998)
Article
Full-text available
This paper presents an overview of the process theory developed in the context of the ESPRIT project NATURE.1 This theory proposes means for modelling and engineering the requirements engineering (RE) process. The key element of this theory is a situation-and decision-based process meta-model independent of any RE methodology. The process meta-mode...
Conference Paper
The majority of events and choices in information systems are driven by conditions. We argue that, as for facts or events, conditions have a time life during which it is pertinent to deal with them. In this paper, we study conditions as temporal boolean functions in the context of boolean algebra. We provide a taxonomy of conditions and an algorith...
Article
Requirements Engineering is an ill-defined, but growing area of research which addresses a critical problem, that of designing the right thing. This paper reports research on the ESPRIT project NATURE (Novel Theories Underlying Requirements Engineering). A framework for RE research is introduced which covers overall conceptions of the modelling and...
Article
This paper presents an innovative approach to partially validate E/R specifications. It is based on the automatic deduction of cardinalities for transitive relationship. The major result of this work is a set of deduction rules relying on mathematical function composition. These deduced cardinalities can be effectively used by the designer to valid...
Article
This paper introduces new tools designed for the study of the languages associated with vector addition systems or, equivalently, Petri nets. With these tools, we prove that the problem of deciding the context-freeness of such a language is solvable.
Article
The aim of this note is to provide a constructible refinement of the R. Karp and R. Miller automaton [Parallel program schemata, J. Comput. Syst. sci. 3, 147-195 (1969; Zbl 0198.326)]: the covering automaton. This automaton recognizes a language included in the one recognized by the coverability automaton, and still containing the language associat...
Article
Full-text available
We present some properties of the Gauss curves and the codes associated to it. In particular we give a necessary condition for a Gauss curve to have a simple closed region of order three and we give a complete characterization of the binary sequences which code for Gauss curves with multiple self-intersections.
Article
The rational index ρL of a non-empty language L is a function of ℕ into ℕ, whose asymptotic behavior can be used to classify languages. We prove that the languages associated to Vector Addition System or Petri nets have rational indexes bounded by polynomials. This situation should be contrasted with the case of context-free languages. Indeed some...
Article
On montre que pour tout graphe etiquete dont on a distingue un sommet, il existe un graphe ayant les memes etiquettes de chemins et possedant une forme particuliere de cactus. Cette transformation se fait de facon constructive, par un algorithme de type Mac-Naughton et Yamada. Le resultat peut etre utilise dans differents domaines de l'informatique...
Article
Full-text available
We give a new interpretation of rationality for Petri net languages improving the result of Valk and Vidal (1977).
Article
Representing and reasoning about incomplete and inde- finite qualitative temporal information is an essential par t of many artificial intelligence tasks. An interval-based fr a- mework and a point-based framework has been proposed for representing such temporal information. Reasoning tas ks in Allen Interval Algebra are known to be NP-hard. That i...
Article
Full-text available
RÉSUMÉ. L'objectif de cet article est de présenter la théorie des S-langages pour modéliser les extensions temporelles des entités et leurs relations temporelles dans un cadre purement algébrique. ABSTRACT. This paper gives a first outlook on S-languages theory in order to model temporal extension of entities and their temporal relationship in a pu...
Article
Full-text available
Temps des grammairiens et temps des (méta-)physiciens ont-ils quelque rapport ? Dans son article « Temps » de l'Encyclopédie, Beauzée fonde sa théorie des temps verbaux sur la définition très leibnizienne du temps physique issu de l'ouvrage d'astronomie du cartésien Gamaches : « le temps est la succession même attachée à l'existence de la créature....
Article
Full-text available
25738573-6.html sous le titre « Au jour d'aujourd'hui, quel [beau] pléonasme » et parfois en des termes très violents : ' Le sens de l'imitation, l'imprégnation par la médiocrité, l'envie de singer les grands hommes ou les bêtes de médias provoquent une excroissance déplaisante de notre lexique de truismes, maladresses syntaxiques et autres ineptie...
Article
Les documents scientifiques écrits constituent un paradigme de document structuré : ouvrages divisés en chapitres (ou articles), eux-mêmes structurés en sections, sous-sections, comportant des figures, des bibliographies... Une grande partie des documents scientifiques publiés sont produits avec le logiciel LATEX, qui propose – et impose – au rédac...

Network

Cited By