packages feed

Cabal revisions of XSaiga-1.0.0.0

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

revision 1
 homepage:            http://hafiz.myweb.cs.uwindsor.ca/proHome.html
 license:             BSD3
 license-file:        LICENSE
-author:              Dr. Rahmatullah Hafiz, Dr. Richard Frost, Shane Peelar, and Eric Matthews
+author:              Dr. Rahmatullah Hafiz, Dr. Richard Frost (rfrost@cogeco.ca), Shane Peelar, Paul Callaghan, and Eric Matthews
 maintainer:          peelar@uwindsor.ca
 -- copyright:           
 category:            Text
 build-type:          Simple
 cabal-version:       >=1.8
+x-revision:          1
 
 description:
-		This package contains an implementation of the X-SAIGA project's top-down polynomial-time parser which is suitable for natural language processing (NLP)
-		applications[1][2].  An example program "Solarman" is included which uses the parser to transform natural language queries about the solar system
-		into combinators which compute the correct answer.  Solarman uses event-based triplestore semantics[3] as the basis for the computation, using either
-		a SPARQL endpoint or an in-program triplestore as the source of information.  By default, the built-in triplestore is used.  Solarman conforms
-		to the CGI interface and can be put on any conforming webserver.  For more information about Solarman and the queries it supports, see [4].
+		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 [4] has been created so that readers can enter queries and find out more about Solarman.
 		.
-		\[1] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_10.pdf>
+		\[1] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_08.pdf>
 		.
-		\[2] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_08.pdf>
+		\[2] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/PADL_10.pdf>
 		.
 		\[3] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/ESWC_DEMO.pdf>
 		.
revision 2
 author:              Dr. Rahmatullah Hafiz, Dr. Richard Frost (rfrost@cogeco.ca), Shane Peelar, Paul Callaghan, and Eric Matthews
 maintainer:          peelar@uwindsor.ca
 -- copyright:           
-category:            Text
+category:            Parsing, Natural Language Processing, Memoization, Text 
 build-type:          Simple
 cabal-version:       >=1.8
-x-revision:          1
+x-revision: 2
 
 description:
 		This package contains a Haskell implementation of the X-SAIGA project's parser combinators. The combinators
revision 3
 author:              Dr. Rahmatullah Hafiz, Dr. Richard Frost (rfrost@cogeco.ca), Shane Peelar, Paul Callaghan, and Eric Matthews
 maintainer:          peelar@uwindsor.ca
 -- copyright:           
-category:            Parsing, Natural Language Processing, Memoization, Text 
+category:            Parsing, Natural Language Processing, Memoization, ParserCombinators, Attribute Grammars, Text 
 build-type:          Simple
 cabal-version:       >=1.8
-x-revision: 2
+x-revision: 3
 
 description:
 		This package contains a Haskell implementation of the X-SAIGA project's parser combinators. The combinators
revision 4
 category:            Parsing, Natural Language Processing, Memoization, ParserCombinators, Attribute Grammars, Text 
 build-type:          Simple
 cabal-version:       >=1.8
-x-revision: 3
+x-revision: 4
 
 description:
 		This package contains a Haskell implementation of the X-SAIGA project's parser combinators. The combinators
 		.
 		\[3] <http://cs.uwindsor.ca/~richard/PUBLICATIONS/ESWC_DEMO.pdf>
 		.
-		\[4] <http://speechweb2.cs.uwindsor.ca/solarman/demo_instore.html>
+		\[4] <http://speechweb2.cs.uwindsor.ca/solarman/demo_sparql.html>
 
 Library
   build-depends: base, pretty