• RWTH FSA Toolkit
  FSA is an efficient and flexible toolkit to create, manipulate and optimize finite-state automata. It supports weighted and unweighted automata as well as transducers and is designed to use on-demand computations in order to keep memory footprint as low as possible. It may be used to model various problems from the field of natural language processing. The toolkit offers three different interfaces: a C++ library, a Python module and a command-line tool.
  By mcswell in Computational Linguistics > Finite State with finite fsa fst state
• Differences between functions in SFST and OpenFst interfaces
  Compares SFST and OpenFST wrt interfaces, processing speed etc.
  By mcswell in Computational Linguistics > Finite State with finite openfst sfst state
• 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
• Regular-Expressions Info
  General site on regex's, including what can go wrong, tutorials, RegexBuddy.
  By mcswell in Computational Linguistics > Finite State with expressions finite regular state by 17 users
• FsmReg
  FsmReg — a registry of FSM technology
  By mcswell in Computational Linguistics > Finite State with finite fsa fsm state
• Koskenniemi Festschrift
  Inquiries into Words, Constraints and Contexts Festschrift for Kimmo Koskenniemi on his 60th Birthday
  By mcswell in Computational Linguistics > Finite State with festschrift finite koskenniemi state
• FSAs and DAWGs
  Finite-state automata (FSA) and directed acyclic word graphs (DAWG), and some info on transducers
  By mcswell in Computational Linguistics > Finite State with finite fsa state
• ALE-RA
  ALE-RA is an ALE extension to: * Realizational morphology & finite-state * Automata phonology
  By mcswell in Computational Linguistics > Morphology with computational finite morphology phonology state
• Stuttgart FST kit
  Includes rewrite operator
  By mcswell in Computational Linguistics > Finite State with computational finite linguistics state
• Finite State Utilities
  By abonch in Systems with finite nlp programmes state utilities ñèñòåìû

Results 1 - 10 for finite Next »