CasSys

CasSysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... provides users the possibility to create UnitexTRE is a lightweight, robust, efficient, portable, and POSIX compliant regexp matching library. Key features include the agrep command line tool for approximate regexp matching in the style of grep, an approximate matching library API, portability, wide character and multibyte character support, binary pattern and data support, complete thread safety, consistently efficient matching, low memory consumption and small footprint, and... cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such a system is typically used for syntactic analysis, chunking, information extraction, recognizing named entities etc. To do that, CasSysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... uses a succession of “locate patterns” to which was added special options and
behaviors.

The first prototype of the CasSysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... system was created in 2002 at the LI (Computer science
Laboratory of Université François Rabelais Tours, France) [30]. This prototype was totally
dedicated to named entity recognitionNamed entity (NE) recognition - one of three fundamental natural language processing tasks..... Later, CasSysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... was generalized to allow any sort of
work needing a cascade: throughout the years, it was improved but never really integrated
in UnitexTRE is a lightweight, robust, efficient, portable, and POSIX compliant regexp matching library. Key features include the agrep command line tool for approximate regexp matching in the style of grep, an approximate matching library API, portability, wide character and multibyte character support, binary pattern and data support, complete thread safety, consistently efficient matching, low memory consumption and small footprint, and..., until a recent project which resulted in the complete integration of CasSysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... in
Unitex1.
UnitexTRE is a lightweight, robust, efficient, portable, and POSIX compliant regexp matching library. Key features include the agrep command line tool for approximate regexp matching in the style of grep, an approximate matching library API, portability, wide character and multibyte character support, binary pattern and data support, complete thread safety, consistently efficient matching, low memory consumption and small footprint, and... grammars are known as Context free grammars and contain the notion of transduction
derived from the field of finite state automata. A grammar with transduction (a
transducer) is enabled to produce some ouput. CassysCasSys provides users the possibility to create Unitex cascade of transducers and new opportunities to work on natural language whith Finite State Graphs. A cascade of transducers applies several FSGraphs (also called automata or transducers), one after the other, onto a text: each graph modifies the text, and changes can be useful for further processings with the next graphs. Such... is dedicated to the application of
transducers in the form of a cascade.