François Perrault

Learn More
Lexicat Grammars are a class of unification grammars which share a fixed rule component, for which there exists a simple left-recursion elimination transformation. The parsing and generation programs ale seen as two dual non-left-recursive versions of the original grammar, and are implemented through a standard top-down Prolog interpreter. Formal criteria(More)
Abstrac t We argue that the concept of translatio n analysis provides a suitable foundation for a new generation of translation support tools. We show that pre-existing translations ca n be analyzed into a structured translatio n memory and describe our TransSearch bilingual concordancing system, which allow s translators to harness such a memory. We claim(More)
The views expressed are strictly those of the authors. Également disponible en français, sous le titre : " TransSearch : un concordancier bilingue " Abstract TransSearch is a system for building and exploiting a translation memory, i.e. a textual database consisting of pairs of documents that are mutual translations. Each such pair of documents, when(More)
  • 1