Categorial Grammar Home Page Categorial Grammar Home Page subscribe cg firstname lastname
The mailing list is unmoderated. Address mail directly to the list at mailto:cg@ling.ohio-state.edu.
A somewhat out-of-date list of researchers on the mailing list is here .
This conference is dedicated to the use of logic in natural language analysis analysis and processing (for instance: Proof-theoretical aspects of the syntactical and semantical models of natural languages. Automatic proof-search techniques for syntactical analysis and generation. Grammars based on non-commutative linear logics. Relations between categorial grammars, context-free grammars and TAGs. Natural language interfaces for automatic provers). The introduction to the first volume gives a more detailed exposition of the topic of the conference: LACL: an introduction. (by P. Blackburn, M. Dymetman, A. Lecomte, A. Ranta, C. Retoré, E. Villemonte de la Clergerie) In LACL`96, LNAI 1328, Spinger, pp. 1--20.
The talks are selected on the basis of a 4 page abstract, and the papers are selected afterwards for publication in a volume published by Springer Verlag, in the subseries Lecture Notes in Artificial Intelligence of the series Lecture Notes in Computer Science.
This event happened in Nancy (96, 97) and the next one will take place in Grenoble (December 98).
For more details: have a look at the conference home page.
The Roma Workshops are oriented towards the exchange of scientific results in the logical analysis of natural language and are mainly addressed to the study of the interrelations between Proof Theory, Typed Lambda Calculus and Categorial Grammar, with a special consideration for the role played by Linear Logic and by some recent extensions of the Lambek Calculus.
The last Roma workshop was held on October 13--18, 1997. More information is available on the Roma 97 homepage.
The previous Roma Workshop was held on April 10-13, 1996. More information is available from the Roma 96 homepage.
Or you can write Claudia Casadio at mailto://casadio@unich.it
The CATLOG system is a theorem-prover for type-logical categorial grammars. It implements a range of logical constructors including the associative and non-associative slashes, an intensionality modality, binary and unary discontinuity operators, disjunction for polymorphism, etc. It is distributed with a sample grammar which includes quantifiers, gapping, discontinuous idioms, quantifiers, plurals, etc.
The CATLOG system was developed by Glyn Morrill.
Visit the CATLOG Home Page .
LexGram was developed by Esther König.
Visit the LexGram home page.
MCGTOOLS is a small system devoted to linguistic experimentation in the Lambek Grammar framework. MCGTOOLS allows you to develop and test grammar fragments by building only the dictionary entries. The analysis will offer for each well-formed input phrase its semantic form and prosodic (or syntactic) structure.
Size: 643 Kb zip file: 700 Kb program files + 6.5 Mb optional graphical demo.
Platform: PC, Windows 95 and Windows 3.1
License: freeware
Language: Spanish, also introductory texts in English
MCGTOOLS was developed by F. Xavier Llore mailto://xllore@mx3.redestb.es; the home page is here .
The Natural Deduction CG Parser is an interactive system for constructing natural deduction proofs in type-logical categorial grammars. The constructors include associative concatenation, unbounded dependencies, generalized quantifiers, agreement features, conjunction and disjunction constructors, non-boolean coordination for plurals, and generalized linguistic conjunction. The system is interactive in that the user must specify the location in the input string of hypothetical assumptions.
The Natural Deduction CG Parser was developed by Bob Carpenter .
Visit the Natural Deduction CG Parser Home Page , or jump straight to the frame-based WWW CG Parser for Netscape 2.0 or just plain WWW CG Parser for Any Other Navigator .
The Language Technology Group is pleased to announce the release of version
1.4beta of the diagram display engine and editor Thistle. Here are some of the
more conspicuous changes:
- New graphical primitives: dendrograms, fractions
and Cooper boxes.
- Step-time animation of sequences of diagrams
-
Subparts of diagrams may be `folded'
There have also been many minor improvements and corrections to programming errors, and enhancements or additions to existing diagram classes.
Descriptions of Thistle and many example pages are available here. Readers of this page will be most interested in the CG derivations.
The NLP Lab at POSTECH in (South) Korea works on CG descriptions of Korean, and has a beta-version Korean CCG parser freely available.