Affix grammar over a finite lattice

From HandWiki
Revision as of 15:42, 6 February 2024 by Smart bot editor (talk | contribs) (update)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Notation for context-free grammars with finite set-valued features

In linguistics, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammars with finite set-valued features, acceptable to linguists of many different schools.

The AGFL-project aims at the development of a technology for Natural language processing available under the GNU GPL.

External links