Skip to content
Alexandre Rademaker edited this page Dec 13, 2023 · 14 revisions

ACE (the Answer Constraint Engine) is a processor for DELPH-IN grammars, supporting both parsing and generation. ACE was written by and is maintained by Woodley Packard, and is distributed as free software under the MIT license. This page serves to link to the following pages:

  • AceInstall offers a few tips for those not familiar with Unix terminal commands

  • AceUse gives some examples of common use cases.

  • AceFaq gives answers to frequently asked questions.

  • AceConfiguration describes the options available in ACE's per-grammar configuration files.

  • AceOptions details the command-line option syntax.

  • AceLui shows how to run ACE with LUI for interactive grammar debugging.

  • FftbTop shows how to use the full forest treebanker to treebank, and then how to build a statistical model using the treebank.

  • AceCsaw describes an extension to back off to a pcfg approximation.

  • AceWishlist hosts a brainstorm list of features or bugfixes that someone wants ACE to incorporate.

  • AceExperimental describes some emerging (perhaps unstable) features

  • The ACE website hosts more information and the downloadable.

  • libtsdb and art can be used to process TsdbTop profiles with ACE.

  • Ace Tools can be used to treebank and train statistical models for ACE.

Read-only public SVN access to the ACE source code is available to interested parties, e.g. the (unstable) development trunk:

  svn co http://sweaglesw.org/svn/ace/trunk ace
Clone this wiki locally