These tools, called xfst, twolc, and lexc, are used in many linguistic applications such as morphological analysis, tokenisation, and shallow parsing of a wide variety of natural languages. The finite state tools here are built on top of a software library that provides algorithms to create automata from regular expressions and equivalent formalisms and contains both classical operations, such as union and composition, and new algorithms such as replacement and local sequentialisation.
Finite-state linguistic resources are used in a series of applications and prototypes that range from OCR to terminology extraction, comprehension assistants, digital libraries and authoring and translation systems.
The components provided here are:
Xfst, twolc, and lexc are now available, under a non-commercial license, in the book Finite State Morphology (Beesley and Karttunen, 2003, CSLI Publications) which documents their use. The finite-state software has also been licensed commercially.
Enter the text for processing. The part of speech tagging is performed in real time.
|Rate this service :|