Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Affix grammar over a finite lattice
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.

We don't have any images related to Affix grammar over a finite lattice yet.
We don't have any YouTube videos related to Affix grammar over a finite lattice yet.
We don't have any PDF documents related to Affix grammar over a finite lattice yet.
We don't have any Books related to Affix grammar over a finite lattice yet.
We don't have any archived web articles related to Affix grammar over a finite lattice yet.