• Foma: a finite-state toolkit and library
  Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers
  By mcswell in Computational Linguistics > Finite State with finite-state transducer
• AGFL Grammar Lab
  The AGFL formalism for the syntactic description of Natural Languages has been developed by the Computer Science Department of the Radboud University of Nijmegen. It is a formalism in which large context free grammars can be described in a compact way. AGFLs belong to the family of two level grammars, along with attribute grammars and DCG's: a first, context-free level is augmented with set-valued features for expressing agreement between constituents.
  By mcswell in Computational Linguistics > Morphology with computational finite morphology state transducer
• Portuguese Lemmatizer
  Lemmatizer, links to paradigm generator and multilingual dictionary.
  By mcswell in Languages > Romance Languages > Portuguese with lemmatizer morphological parser portuguese transducer

Results 1 - 3 for transducer