Finite-state transducer source code
Abbreviation: FST
Identifiers:
Type | Id | |
---|---|---|
SIS ID | fFST | Copy ID to clipboardSIS ID copied |
Media type(s):
-
text/plain
File extension(s): .regex
Format family: Plain.Running
Functional domains:
- Tool Support
Recommendations:
Centre | Domain | Level | Comments |
---|---|---|---|
CLARINO_Bergen | Tool SupportTool-related formats required for specific functionality of the tool or reliable reuse of resources (e.g. tagsets, annotation schemes, vocabularies, language models, parameter files, and other specifications or settings) | recommended |
|
Description:
Finite-state transducers are finite-state automata that map between two sets of symbols. They are commonly used in lexical analysis. The XFST and HFST projects ("X" for Xerox, "H" for Helsinki) use a plain-text format defined by Beesley and Karttunen. See the following for more details:
Keywords: regular expressions, finite state transducer, XFST, HFST, lexical analysis