Abstract TAGs were recently shown not to be closed under strong lexicalization but to be strongly lexicalizable by context-free tree grammars of rank 2. This paper presents an alternative lexicalization procedure that builds on an earlier generalization of TAGs to multi-dimensional trees. A previous theorem that every Tree Substitution grammar is strongly lexicalized by a corresponding TAG is lifted to higher dimensions to show that for every d-dimensional TAG there exists a (d+1)-dimensional TAG that strongly lexicalizes it. A similar lifting reveals that d-dimensional TAGs are not closed under strong lexicalization, so for arbitrary TAGs an increase in dimensionality is an unavoidable consequence of strong lexicalization.

More Output

An Alternate View on Strong Lexicalization in TAG

Fri 01 July 2016 | in Presentations |
| Tree Adjoining grammar | lexicalization | multi-dimensional trees | generative capacity |

De Santo, Aniello, Alëna Aksënova, and Thomas Graf

Abstract TAGs were recently shown not to be closed under strong lexicalization but to be strongly lexicalizable by context-free tree grammars of rank 2. This paper presents an alternative lexicalization procedure that builds on an earlier generalization …
read more
Some Interdefinability Results for Syntactic Constraint Classes

Fri 01 January 2010 | in Papers |
| constraints | transderivationality | reference-set computation | model-theoretic syntax | multi-dimensional trees | optimality theory |

Graf, Thomas

Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …
read more
Locality in Flux —- Reducibility Results for Syntactic Constraints

Thu 27 August 2009 | in Presentations |
| constraints | locality | transderivationality | reference-set computation | multi-dimensional trees | model-theoretic syntax | optimality theory |

Graf, Thomas

Abstract Müller and Sternefeld (2000) propose a locality hierarchy of syntactic constraints such that {representational, derivational} < global < translocal < transderivational. We use formal methods to demonstrate that their hierarchy correctly assumes that higher constraint classes are more powerful, but we also show that for …
read more
Some Interdefinability Results for Syntactic Constraint Classes

Thu 20 August 2009 | in Presentations |
| constraints | transderivationality | reference-set computation | model-theoretic syntax | multi-dimensional trees | optimality theory |

Graf, Thomas

Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …
read more
Ein Modelltheoretischer Blick Auf Syntaktische Constraints
Sun 04 May 2008 | in Presentations |
| constraints | model-theoretic syntax | multi-dimensional trees |

Graf, Thomas

Abstract My very first talk *nostalgia*. It’s a very early attempt at developing a general, model-theoretic meta-theory of linguistic constraints, which came to full fruition in my UCLA PhD thesis. Beware: it’s all in German.

Files [pdf] [code]
```
@Misc{Graf08GGStalk,
  author …
```
read more

More Output

links

contact