Two Equivalent Regularizations for Tree Adjoining Grammars (Q3618604): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic structures as multi-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: IO and OI. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: IO and OI. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spinal-formed context-free tree grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: wMSO theories as grammar formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Equivalent Regularizations for Tree Adjoining Grammars / rank
 
Normal rank

Latest revision as of 11:15, 1 July 2024

scientific article
Language Label Description Also known as
English
Two Equivalent Regularizations for Tree Adjoining Grammars
scientific article

    Statements

    Two Equivalent Regularizations for Tree Adjoining Grammars (English)
    0 references
    0 references
    2 April 2009
    0 references
    0 references
    tree adjoining grammar
    0 references
    multi-dimensional trees
    0 references
    lifting
    0 references
    regularization
    0 references
    0 references