Affix grammar over a finite lattice: Difference between revisions
Jump to navigation
Jump to search
imported>HeyElliott |
imported>Fadesga |
||
| Line 7: | Line 7: | ||
*[https://www.cs.ru.nl/agfl/ AGFL-project website] | *[https://www.cs.ru.nl/agfl/ AGFL-project website] | ||
[[Category:Grammar frameworks]] | [[Category:Grammar frameworks]] | ||
[[Category:Natural language processing]] | [[Category:Natural language processing]] | ||
[[Category:Free linguistic software]] | [[Category:Free linguistic software]] | ||
{{syntax-stub}} | |||
{{NLP-stub}} | |||
Latest revision as of 10:11, 25 June 2025
Template:Short description 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.