Two-Level rules are declarative constraints that describe morphological alternations, such as the y ie alternation in the plural of some English nouns (spy spies). This document describes a compiler, written in C, that converts two-level rules into deterministic, minimized finite-state transducers. It describes the format of two-level grammars, the rule formalism, and the user interface to the compiler. It also explains how the compiler can assist the user in the development of a two-level grammar.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Lindén, Krister; Silfverberg, Miikka; Pirinen, Tommi: HFST tools for morphology --- an efficient open-source package for construction of morphological analyzers (2009)
- Alegria, Iñaki; Aranzabe, Maxux; Ezeiza, Nerea; Ezeiza, Aitzol; Urizar, Ruben: Using finite state technology in natural language processing of Basque (2002)
- Kiraz, George Anton: Compressed storage of sparse finite-state transducers (2001)
- Guengoerdue, Zelal: Parsing turkish using the lexical functional grammar. (1995)