Initially, TS has been applied to the analyses of quantifier ambiguity, scoping islands and binding, crossover, topicalization, and inverse linking.
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
Although the paper refers to Applicative Abstract Categorial Grammars in the title, it is actually about TS. It is the first paper on TS.
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.
Term language for the surface syntax
Syntax-semantics interface: the correspondence between the abstract form (with raised quantifiers) and logic formulas
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
Extending the abstract language with in-situ and raised quantifiers, and defining quantifier raising
Extending the abstract language with pronouns and the transformations for anaphora resolution
Extensible Effects are used in this project
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.
Talk at LENLS 2017, Tokyo, Japan, November 14, 2017
Poster presented at the Programming and Programming Languages Workshop (PPL2018), Yonago, Japan, March 6, 2018.
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
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
FraCAS corpus (Part 1: quantifiers) annotated according to the Penn Historical Corpora system, very kindly provided by Alastair Butler
The parser for the annotated tree bank