Affix grammar over a finite lattice
Encyclopedia
In linguistics
, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammar
s 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
.
Linguistics
Linguistics is the scientific study of human language. Linguistics can be broadly broken into three categories or subfields of study: language form, language meaning, and language in context....
, the affix grammars over a finite lattice (AGFL) formalism is a notation for context-free grammar
Context-free grammar
In formal language theory, a context-free grammar is a formal grammar in which every production rule is of the formwhere V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals ....
s 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
Natural language processing
Natural language processing is a field of computer science and linguistics concerned with the interactions between computers and human languages; it began as a branch of artificial intelligence....
available under the GNU
GNU
GNU is a Unix-like computer operating system developed by the GNU project, ultimately aiming to be a "complete Unix-compatible software system"...
GPL
GNU General Public License
The GNU General Public License is the most widely used free software license, originally written by Richard Stallman for the GNU Project....
.