XSaiga: An implementation of a polynomial-time top-down parser suitable for NLP

This package contains a Haskell implementation of the X-SAIGA project's parser combinators. The combinators enable fully-general attribute grammars to be implemented as executable specifications. Although the parser is top-down, and therefore highly modular, left-recursive productions are allowed and fully-general synthesized and inherited attribute dependencies are also allowed. The parse tree, which is decorated with attribute values, is built as a compact Tomita-style graph. Lazy evaluation enables attribute values to be evaluated only as needed. Time and space complexity are both O(n^4) where n is the length of the input. An example natural-language interface (called Solarman) to a semantic-web style RDF triplestore with approximately 3,000 facts about the solar system has been built as an executable specification of an attribute grammar. Solarman is included in this archive. Solarman computes answers to queries using an event-based denotational semantics which is based on Montague and Davidsonian semantics. A web site [3] has been created so that readers can enter queries and find out more about Solarman.

[1] http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_08.pdf

[2] http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_10.pdf

[3] http://speechweb2.cs.uwindsor.ca/solarman4/demo_sparql.html

Modules

[Last Documentation]

Flags

Manual Flags

Name	Description	Default
asterius	Use when building for Asterius -- sets up hooks for querying triplestores via XMLHttpRequest	Disabled
instore	Use built-in triplestore (no network access)	Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

• XSaiga-1.7.0.0.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• InBetweenNames

For package maintainers and hackage trustees

• edit package information

Candidates

• 1.0.0.0, 1.6.0.0