• 20 Years of Two-Level Morphology
  ESSLLI 2001 Special Event organised by Lauri Karttunen, Kimmo Koskenniemi and Gertjan van Noord.
  with computational finite linguistics state
• Approximation and Exactness in Finite State Optimality Theory
  
  Approximation and Exactness in Finite State Optimality Theory
  with computational finite linguistics optimality phonology state
• ATT Finite State Library
  with algorithms finite state
• Differences between functions in SFST and OpenFst interfaces
  Compares SFST and OpenFST wrt interfaces, processing speed etc.
  with finite openfst sfst state
• Extended finite state models of language
  with computational finite language linguistics morphology state
• Foma: a finite-state toolkit and library
  Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers
  with finite-state transducer
• FSAs and DAWGs
  Finite-state automata (FSA) and directed acyclic word graphs (DAWG), and some info on transducers
  with finite fsa state
• FsmReg
  FsmReg — a registry of FSM technology
  with system:unfiled
• FsmReg
  FsmReg — a registry of FSM technology
  with finite fsa fsm state
• Google RegEx directory
  Google's directory: Computers > Programming > Languages > Regular Expressions
  with expressions finite regular state
• Grail toolkit
  symbolic computation environment for finite-state machines, regular expressions, and finite languages
  with algorithms finite intersections state
• Jan Daciuk's Finite State Utilities
  Jan Daciuk's Finite State Utilities for Morphology
  with computational finite linguistics morphology state utilities
• Koskenniemi Festschrift
  Inquiries into Words, Constraints and Contexts Festschrift for Kimmo Koskenniemi on his 60th Birthday
  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.
  with finite fst state transducer
• pysfst
  The pysfst module contains Python bindings for the API of SFST, the Stuttgart Finite State Transducer Tools.
  with pysfst python sfst stuttgart
• Regex and Unicode
  Tutorial on regular expressions in Unicode, for e.g. Perl
  with regexpr unicode
• Regular-Expressions Info
  General site on regex's, including what can go wrong, tutorials, RegexBuddy.
  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.
  with finite fsa fst state
• Stuttgart FST kit
  Includes rewrite operator
  with computational finite linguistics state
• Xerox Finite State Technology
  with computational finite linguistics state xerox

Bookmarks 1 - 20 Next »