A Very Short and Fast intro to XFST
And its applications to linguistics.
This has three units:
Exercise 1: Make graphs of finite-state automata
Exercise 2: How to test a transliterator
Exercise 3: Using lexc to compose morphologies
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more.
Please sign in to use Codespaces.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download Xcode and try again.
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.