• 20 Years of Two-Level Morphology
  ESSLLI 2001 Special Event organised by Lauri Karttunen, Kimmo Koskenniemi and Gertjan van Noord.
  in Computational Linguistics > Finite State with computational finite linguistics 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.
  in Computational Linguistics > Morphology with computational finite morphology state transducer
• ALE-RA
  ALE-RA is an ALE extension to: * Realizational morphology & finite-state * Automata phonology
  in Computational Linguistics > Morphology with computational finite morphology phonology state
• Approximation and Exactness in Finite State Optimality Theory
  
  Approximation and Exactness in Finite State Optimality Theory
  in Computational Linguistics > Finite State with computational finite linguistics optimality phonology state
• ATT Finite State Library
  in Computational Linguistics > Finite State with algorithms finite state
• Differences between functions in SFST and OpenFst interfaces
  Compares SFST and OpenFST wrt interfaces, processing speed etc.
  in Computational Linguistics > Finite State with finite openfst sfst state
• Extended finite state models of language
  in Computational Linguistics > Finite State with computational finite language linguistics morphology state
• Finite State Methods and NLP
  Finite-State Methods and Natural Language Processing 2008 Seventh International Workshop 11-12 September 2008 Ispra, Lago Maggiore, Italy
  in Conferences > Old Conferences with conferences finite state
• FSAs and DAWGs
  Finite-state automata (FSA) and directed acyclic word graphs (DAWG), and some info on transducers
  in Computational Linguistics > Finite State with finite fsa state
• FsmReg
  FsmReg — a registry of FSM technology
  in Computational Linguistics > Finite State with finite fsa fsm state
• Google RegEx directory
  Google's directory: Computers > Programming > Languages > Regular Expressions
  in Computational Linguistics > Finite State with expressions finite regular state
• Grail toolkit
  symbolic computation environment for finite-state machines, regular expressions, and finite languages
  in Computational Linguistics > Finite State with algorithms finite intersections state
• Jan Daciuk's Finite State Utilities
  Jan Daciuk's Finite State Utilities for Morphology
  in Computational Linguistics > Finite State with computational finite linguistics morphology state utilities
• Koskenniemi Festschrift
  Inquiries into Words, Constraints and Contexts Festschrift for Kimmo Koskenniemi on his 60th Birthday
  in Computational Linguistics > Finite State with festschrift finite koskenniemi state
• OpenFST library
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight.
  in Computational Linguistics > Finite State with finite fst state transducer
• Regular-Expressions Info
  General site on regex's, including what can go wrong, tutorials, RegexBuddy.
  in Computational Linguistics > Finite State with expressions finite regular state by 17 users
• 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.
  in Computational Linguistics > Finite State with finite fsa fst state
• Stuttgart FST kit
  Includes rewrite operator
  in Computational Linguistics > Finite State with computational finite linguistics state
• Xerox Finite State Technology
  in Computational Linguistics > Finite State with computational finite linguistics state xerox

finite from all users