File:TAG-count-4-language-derviation-aabbccdd.svg
Summary
| Description |
Deutsch: Tree Adjoining Grammar (TAG, Baumadjunktionsgrammatik) für Count-4 Sprache Darstellung der Derviation für aabbccdd durch zwei Adjunktionsschritte, epsilon steht für das leere Wort, NA ist der Null Adjunktionsconstraint
English: Tree adjoining grammar (TAG) for count-4 language showing the two derivation steps (adjunction) to generate aabbccdd, the empty word is represented as epsilon, NA means null adjunction constraint |
| Date | |
| Source | Own work |
| Author | PlusMinuscule |
Created with LaTeX, TikZ and tikz-qtree
Some trees for the count-4 language can also be found:
- in Example 2, page 9 in Joshi and Shabes (1991): Tree-adjoining grammars and lexicalized grammars, Technical report MS-CIS-91-22, University of Pennsylvania
- elementary trees also in File:Anbncndn.jpg (different author)
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
