TTT: a tree transduction language for syntactic and semantic processing

Authors:
Adam Purtee;Lenhart Schubert
Affiliations:
University of Rochester;University of Rochester
Venue:
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Year:
2012

Citing 8
Cited 0

Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp

Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp
Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The SNOBOL 4 programming language

The SNOBOL 4 programming language
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Capturing practical natural language transformations

Machine Translation
Why synchronous tree substitution grammars?

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the tree to tree transduction language, TTT. We motivate the overall "template-to-template" approach to the design of the language, and outline its constructs, also providing some examples. We then show that TTT allows transparent formalization of rules for parse tree refinement and correction, logical form refinement and predicate disambiguation, inference, and verbalization of logical forms.