Extended Abstract

Quantifier-free tree transductions

---

Abstract

This work aims to extend quantifier-fee (QF) logical transductions, which over strings are equivalent to Input Strictly Local functions, to trees. While QF string transductions are defined with predecessor or successor functions and copy sets, we define QF tree transductions with parent functions and copy trees and consider transductions that preserve the asymmetric c-command relation. QF tree transductions are useful in capturing some transductions as exemplified by tier-construction for case assignment in Vu et al. (2019). Interestingly, they are incomparable to existing tree transducer classes such as bottom-up or top-down tree transducers.

Keywords: tree transductions, syntax, logical transductions

How to Cite:

Ikawa, S., Ohtaka, A. & Jardine, A., (2020) “Quantifier-free tree transductions”, Society for Computation in Linguistics 3(1), 455-458. doi: https://doi.org/10.7275/k1gj-bq24