Formal basis of a language universal
M Stanojević, M Steedman - Computational Linguistics, 2021 - direct.mit.edu
Steedman proposes as a formal universal of natural language grammar that grammatical
permutations of the kind that have given rise to transformational rules are limited to a class …
permutations of the kind that have given rise to transformational rules are limited to a class …
[图书][B] Syntax und Valenz: zur Modellierung kohärenter und elliptischer Strukturen mit Baumadjunktionsgrammatiken
T Lichte - 2015 - library.oapen.org
Diese Arbeit untersucht das Verhältnis zwischen Syntaxmodell und lexikalischen
Valenzeigenschaften anhand der Familie der Baumadjunktionsgrammatiken (TAG) und …
Valenzeigenschaften anhand der Familie der Baumadjunktionsgrammatiken (TAG) und …
Recursion in Language: Is It Indirectly Constrained?
AK Joshi - Recursion: Complexity in cognition, 2014 - Springer
Recursion is a key aspect of formal theories of language. In this chapter we have presented
a new perspective on recursion in language, claiming that recursion in language is indirectly …
a new perspective on recursion in language, claiming that recursion in language is indirectly …
[PDF][PDF] Creating a tree adjoining grammar from a multilayer treebank
We propose a method for the extraction of a Tree Adjoining Grammar (TAG) from a
dependency treebank which has some representative examples annotated with phrase …
dependency treebank which has some representative examples annotated with phrase …
[PDF][PDF] LTAG and Raising to Subject in Breton
R Hendrick - lingbuzz.net
Breton is a Celtic VSO language that contains a process of raising to subject and a verb
second requirement for main clauses. This paper shows that raised subjects must also be …
second requirement for main clauses. This paper shows that raised subjects must also be …
Lexicalized non-local MCTAG with dominance links is NP-complete
L Champollion - Journal of Logic, Language and Information, 2011 - Springer
An NP-hardness proof for non-local Multicomponent Tree Adjoining Grammar (MCTAG) by
Rambow and Satta (1st International Workshop on Tree Adjoining Grammers 1992), based …
Rambow and Satta (1st International Workshop on Tree Adjoining Grammers 1992), based …
Formal Basis of a Language Universal
M Steedman - Computational Linguistics, 2021 - submissions.cljournal.org
Steedman 2018 proposes as a formal universal of natural language grammar that
grammatical permutations of the kind that have given rise to transformational rules are …
grammatical permutations of the kind that have given rise to transformational rules are …
Trainable English generation with modifier and adjunct ordering
H Zhong - 2009 - search.proquest.com
Natural language generation involves the automatic formulation of natural language
sentences. The ultimate goal in NLG is for the computer to produce language that is as …
sentences. The ultimate goal in NLG is for the computer to produce language that is as …