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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_40 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153627808 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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