Richter:
Computational Semantics (SS 08)
General Information on the Course
Seminar Hand-outs and Slides
Software
- Patrick Blackburn & Johan Bos: Representation and Inference for Natural Language:
Software Requirements and Downloads
-
Small DCG grammar fragment of English with semantic representations in
FOL from Pereira and Shieber (1987, p. 102-103)
- Tar ball with files integrating
an extended version of Pereira and Shieber's DCG grammar of English
(with added constructions, tree output and slightly revised semantic
representations) with a slightly extended version of the model checker
of Blackburn and Bos. Syntactic structures are shown in a Java tree
viewer; the sentences are evaluated in a model provided in a
file in the tar ball.
- Usage: Compile pereira-shieber87.pl, start with parse/0
for reading input sentences from stdin. For syntactic
coverage, see program42-mod2.pl. Interface code written for
SICStus Prolog.
- If you prefer to work with SWI Prolog, here's a
top level file with glue code for
using
the Java tree viewer with SWI Prolog. Needs to be adjusted to integrate
the model checker and print the logical forms and the result of
interpreting the semantic representations in the model. The relevant
code can be copied from the SICStus version of this file
(pereira-shieber87.pl) in the tar ball above.
- lambdaGramBB.tar.bz2: Tar
ball with a modified version of the Chapter 2 grammar of English by Blackburn
and Bos (here called lambdaInt.pl). The tar ball contains only the
modified files
(plus one new file), the other necessary files can be taken directly from
Blackburn and Bos. Added features:
- Predicate interface/0: Reads sentences from the command line and
outputs the syntactic structure of the sentence in a separate tree viewer
window. Uses tv.jar from the Pereira and Shieber implementation
above; interface predicates to the tree viewer written for SICStus
Prolog, to be adapted for SWI as indicated in the previous package.
- Predicate pp_cat/2: Parses lists of words of any given category
and returns 1) their semantic representation as specified by the Blackburn
and Bos grammar and 2) the corresponding maximally beta reduced term.
Enumerates all parse results and indicates their syntactic analysis.
- Predicate part_parse/1: Like the previous predicate, but this one
does not require a category input; it will try to parse the input list
as any syntactic category in the grammar.
- cooperStorageIntSwi.pl.bz2:
Kilian Evang's adaptation of Blackburn and Bos' cooper storage
implementation. Integrates the java tree viewer. The interface
predicate is written in SWI Prolog, and is to be used together with
tv.jar.
- BLamB-2008-07-04.tar.gz:
Preliminary version of Johannes Dellert's Java tool for converting FOL (and lambda-) formulae
from the Blackburn and Bos format into a standard textbook format.
Student Presentations
A few relevant websites
on linguistics and on HPSG
- at the SfS:
- at the Universität Tübingen:
- elsewhere in the world:
on general resources useful for this course
Frank Richter