Affix grammar 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.
External links
This article is issued from Wikipedia - version of the 7/12/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.