Send in your ideas. Deadline October 1, 2024
End: 2002-01


parser generator system for natural languages

With the AGFL (Affix Grammars over a Finite Lattice) formalism for the syntactic description of Natural Languages, very large context free grammars can be described in a compact way. AGFLs belong to the family of two level grammars, along with attribute grammars: a first, context-free level is augmented with set-valued features for expressing agreement between parts of speech. The AGFL parser includes a lexicon system that is suitable for the large lexica needed in real life NLP applications.

  • AGFL is brought to you under a GNU licence. This will help linguists to share improvements. more¬†>¬†>
  • The most recent release of AGFL-GNU. ftp

Project AGFL

Navigate projects