SSH

Software (mostly free software - FLOSS) useful to researchers and teachers in the field of Social Sciences and Humanities (SSH)
Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 11/09/13
  • Minor correction: 11/09/13

TreeCloud : building tree cloud visualizations from texts

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System:
  • Current version: 1.3 - 13/12/2009
  • License(s): GPL
  • Status: under development
  • Support: maintained, ongoing development
  • Designer(s): Philippe Gambette ; Jean VĂ©ronis
  • Contact designer(s):

    P. Gambette

  • Laboratory, service:

 

General software features

TreeCloud generates a tree cloud from a text, that is a word cloud whose words are arranged around a tree which reflects their semantic proximity inside the text.

Context in which the software is used

The main application of the tree clouds built by TreeCloud is to provide a quick overview of the content of a text. It is also possible to use them for a deeper analysis of the texts, included in a textometric approach (text analysis using software tools and statistical methods). Then, the tree cloud will help the user to fomalize some hypotheses, or test them. It can therefore lead to use other textometric tools to confirm these hypotheses, or to visualize the results of the output of those tools.

Publications related to the software

Philippe Gambette and Jean VĂ©ronis: Visualising a Text with a Tree Cloud, In Locarek-Junge H. and Weihs C., editors, Classification as a Tool of Research, Proc. of IFCS'09 (11th Conference of the International Federation of Classification Societies) Studies in Classification, Data Analysis, and Knowledge Organization 40, p. 561-570, 2010.

Delphine Amstutz and Philippe Gambette (in French): Utilisation de la visualisation en nuage arboré pour l'analyse littéraire, Statistical Analysis of Textual Data (Proc. of JADT'10), p. 227-238, 2010.

Philippe Gambette, Nuria Gala and Alexis Nasr(in French): Longueur de branches et arbres de mots, Corpus 11, p. 129-146, 2012.

William Martinez and Philippe Gambette (in French): L'affaire du Médiator au prisme de la textométrie, Texto !, to appear, 2013.

Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 12/03/10
  • Minor correction: 12/03/10

String process : implementation of algorithms for automatic processing of natural language

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System:
  • Current version: 1.0 - 2001
  • License(s): not yet chosen
  • Status: stable release
  • Support: maintained, no ongoing development
  • Designer(s): Maxime Crochemore, Christophe Hancart, Thierry Lecroq
  • Contact designer(s): Thierry.Lecroq @ univ-rouen.fr
  • Laboratory, service:

 

General software features

Set of C and Java code to implement algorithms on strings :

  • Pattern matching automata
  • String searching with a sliding window
  • Suffix arrays
  • Structures for indexes
  • Indexes
  • Alignments
  • Approximate patterns
  • Local periods

These algorithms are presented in [Crochemore, Hancart, Lecroq, 2001].

Context in which the software is used

This set of programs was provided to explain the algorithms of the book [Crochemore, Hancart, Lecroq, 2001].
This is the first French book dedicated to string process algorithms.

Publications related to the software
  • Algorithmique du texte, M. Crochemore, C. Hancart et T. Lecroq, Vuibert, 2001
  • Algorithms on Strings, M. Crochemore, C. Hancart et T. Lecroq, Cambridge University Press, 2007
Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 21/10/08
  • Minor correction: 12/05/12

Lothaire package : implementation of the algorithmes of combinatorics on words

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System:
  • Current version: 1.0 - DĂ©cembre 2004
  • License(s): Other - The programs can be freely copied and used with the mention of their origin.
  • Status: stable release
  • Support: maintained, no ongoing development
  • Designer(s): Jean Berstel, Dominique Perrin
  • Contact designer(s): Jean.Berstel @ univ-mlv.fr
  • Laboratory, service:

 

General software features

This set of Java programs implements algorithms for dealing with:

  • words
  • rooted trees
  • automata and their minimization
  • pattern matching
  • transducers
  • parsers
  • probability distributions on words
  • statistics on words

The algorithms are described in [Lothaire, 2005].

Context in which the software is used

This set of programs has been developed in order to illustrate the algorithms of the book [Lothaire, 2005].

The series of books authored by Lothaire is much used in teaching and in research of combinatorics on words.

Publications related to the software
  • Applied Combinatorics on words, M. Lothaire, eds. J. Berstel et D. Perrin, Cambridge University Press (2005).
Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 03/07/09
  • Minor correction: 27/01/10

Vaucanson : finite state machine manipulation platform

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System:
  • Current version: 1.2 - mars 2008
  • License(s): GPL - Licence LGPL for version 0.7 and former versions.
  • Status: under development
  • Support: maintained, ongoing development
  • Designer(s): Several contributors
  • Contact designer(s): Sylvain.Lombardy @ univ-mlv.fr
  • Laboratory, service:

 

General software features

The C++ library provides:

  • Generic algebraic structures, including:
    • efficient polynomials as maps from monoid values to weights
    • efficient rational expressions as binary trees
  • Automaton structures, using a graph structure that ensures minimum complexity for most operations
  • Algorithms
  • Generic testsuites for user-made extensions
Context in which the software is used

Vaucanson is a finite state machine manipulation platform, initiated by Jacques Sakarovitch and Sylvain Lombardy in 2001. A finite state machine (also called automaton) is a computing tool useful in langage processing or automation.
In the past, such platforms were intended to work either at an industrial scale, specialized in weighted letter automaton (FSM) to be efficient, or in a pure abstract way (FSA). Using static and generic C++ programming, Vaucanson tries to respond to these two trends.
Indeed, our framework is the set of automata with multiplicity over any semiring: a general algorithm is written just once and can be statically instantiated to any particular kind of automaton. As a result, we obtain efficient code from algorithms written in an abstract way using basic primitives taken from the C++ library.

Publications related to the software
Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 24/03/09
  • Minor correction: 10/07/13

Unitex : corpus processing using finite state technology

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System:
  • Current version: 3.0 stable - september 2012
  • License(s): LGPL - - The language resources distributed with the software are licensed LGPLLR, a license developed by the UniversitĂ© Paris-Est Marne-la-VallĂ©e and validated by the FSF as the equivalent of LGPL for linguistic data. http://igm.univ-mlv.fr/~unitex/lgpllr.html
  • Status: validated (according to PLUME), stable release, under development
  • Support: maintained, ongoing development
  • Designer(s): SĂ©bastien Paumier
  • Contact designer(s): unitex@univ-mlv.fr
  • Laboratory, service:

 

General software features

The Unitex system provides tools to build language resources such as electronic dictionaries and grammars to use them in advanced searches in texts and in generating concordances.

The French validated software index card Fiche Plume describes the software in detail.

Context in which the software is used

Exploration tool used for research by the language processing team of the computer laboratory.
It is also used in several universities at international level as a tool for research and teaching in computer language studies.

Publications related to the software
  • SĂ©bastien Paumier. 2000. Nouvelles mĂ©thodes pour la recherche d'expressions dans de grands corpus. In A. Dister (ed.), Actes des 3èmes JournĂ©es INTEX. Revue Informatique et Statistique dans les Sciences Humaines, 36ème annĂ©e, n° 1 Ă  4.
  • SĂ©bastien Paumier. 2003. A Time-Efficient Token Representation for Parsers, Proceedings of the EACL Workshop on Finite-State Methods in Natural Language Processing, Budapest, pp. 83-90.
  • Other publications associated with the project can be found at its website.
Syndicate content