Initially, TS has been applied to the analyses of quantifier ambiguity, scoping islands and binding, crossover, topicalization, and inverse linking.
AACG1.pdf [263K]
Applicative Abstract Categorial Grammars in Full Swing
New Frontiers in Artificial Intelligence: JSAI-isAI 2015 Workshops, Kanagawa, Japan, November 16-18, 2015, Revised Selected Papers
Lecture Notes in Artificial Intelligence, v10091, pp. 66--78, 2017 doi:10.1007/978-3-319-50953-2_6
Although the paper refers to Applicative Abstract Categorial Grammars in the title, it is actually about TS. It is the first paper on TS.
NewLandscapes-talk.pdf [176K]
Gradually Transforming Syntax to Semantics
Talk at the workshop ``New Landscapes in Theoretical Computational Linguistics'', Ohio State University, October 16, 2016.
As befits its origins in Abstract Categorial Grammars, TS is implemented in the tagless-final style.
TS transformations are typically presented in papers as extended top-down tree transducers: that is, tree-rewriting rules that attempt to pattern-match on tree branches starting from the root. The rules' patterns are deep: they can match nodes appearing deeply inside the current branch. This context-sensitive matching and re-writing is actually implemented bottom-up, building the transformed tree up from the leaves of the original one.
Writing out the TS-transformed abstract-form term as the set-theoretic logical formula relies on extensible-effects. One obvious effect is generating fresh identifiers; the other is accumulating auxiliary formulas. The two effects together implement what may be called `let-insertion': giving a name to the relation defined by a logical formula -- in effect realizing set-comprehension.
Syntax.hs [<1K]
Term language for the surface syntax
Sem.hs [4K]
Syntax-semantics interface: the correspondence between the abstract form (with raised quantifiers) and logic formulas
Logic.hs [17K]
The language of meaning: First-order predicate logic. The logic formulas can be written out in the TPTP format, commonly used by first-order theorem provers
Quan.hs [15K]
Extending the abstract language with in-situ and raised quantifiers, and defining quantifier raising
Pronoun.hs [5K]
Extending the abstract language with pronouns and the transformations for anaphora resolution
Coord.hs [17K]
Coordination reduction transformations programmed in TS. The code includes all examples from the paper.
Overall TS proved just as capable as natural logic in inferences involving a variety of generalized quantifiers. Still open is the problem of mechanically dealing with bare plurals.
TreebankRun.hs [29K]
The main function of the FraCaS application: select a FraCAS problem,
transform its sentences into logical formulas,
which are then submitted to the E theorem prover
Treebank.hs [23K]
This code reads treebank-annotated parse trees and
converts them to the Haskell code that spells out the abstract form.
To be precise, it creates Template Haskell terms, to be type-checked and
transformed in TreebankRun.hs
Fracas.psd [89K]
FraCAS corpus (Part 1: quantifiers) annotated according to the Penn Historical Corpora system, very kindly provided by Alastair Butler
SExpParser.hs [4K]
The parser for the annotated tree bank
oleg-at-okmij.org
Your comments, problem reports, questions are very welcome!
Converted from HSXML by HSXML->HTML