LFG LFG Systems

The following are publicly available implementations (in some sense) of LFG. The ordering is random:

  • The Xerox Grammar Writer's Workbench
  • Avery Andrews's systems: Baby Glue, lfgw, lfg-pc
  • The geta_run system, developed by Rodolfo Delmonte (Universita' Ca' Foscari, VENEZIA) and Dario Bianchi (University of Parma), provides a web interface to a system that produces LFG-style F-Structures.
  • GFU-LAB is a Prolog implementation by Juan C. Ruiz-Anton. It uses SWI-Prolog, and should run under Linux and/or Windows.
  • XLFG is a parser prototype which implements the LFG formalism, developed by Lionel Clément. It is distributed as free software.
  • It is not really a system, as such, but the INESS website provides tree banks for various languages, including LFG style ones developed in the Pargram project (see under development efforts, and ).
  • The ALE system integrates phrase structure parsing, semantic-head-driven generation and constraint logic programming with typed feature structures as terms; ''with suitable coding, it can also execute several aspects of Lexical-Functional Grammar (LFG).''
  • The following implementations are not freely available:

  • The XLE system consists of cutting-edge algorithms for parsing and generating LFGs along with a rich graphical user interface for writing and debugging such grammars.

  • [FAQ|LFG]

    This page is maintained by Doug Arnold, of the Department of Language and Linguistics, at the University of Essex.

    Last update: Thursday, 2 January, 2014.