Jump to content

Affix grammar over a finite lattice

Add links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by HeyElliott (talk | contribs) at 23:01, 18 September 2023 (MOS:FIRST). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]
Stub icon

This syntax-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Affix_grammar_over_a_finite_lattice&oldid=1176019133"