Affix grammar over a finite lattice
From Wikipedia, the free encyclopedia
(Redirected from Affix Grammars over a Finite Lattice)
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.
[edit] External links
 |
This syntax-related article is a stub. You can help Wikipedia by expanding it. |
