2 |
Phase theory and Tree Adjoining Grammar
|
|
|
|
In: http://www.cog.jhu.edu/faculty/frank/papers/phase-paper-revised.pdf (2005)
|
|
BASE
|
|
Show details
|
|
3 |
From Regular To Context-Free To Mildly Context-Sensitive Tree Rewriting Systems: The Path Of Child Language Acquisition
|
|
|
|
In: http://hebb.cog.jhu.edu/faculty/frank/././_pdf/frank/revised-tagws.pdf (2000)
|
|
BASE
|
|
Show details
|
|
4 |
From regular to context free to mildly context sensitive tree rewriting systems: The path of child language acquisition
|
|
|
|
In: http://arxiv.org/pdf/cmp-lg/9411012v1.pdf (2000)
|
|
BASE
|
|
Show details
|
|
5 |
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar. Grammars
|
|
|
|
In: http://www.ling.umd.edu/~alxndrw/tagreadings/fkvj00.pdf (2000)
|
|
BASE
|
|
Show details
|
|
6 |
Primitive C-Command
|
|
|
|
In: http://hebb.cog.jhu.edu/pdf/frank/Primitive_C_Command.pdf (1999)
|
|
BASE
|
|
Show details
|
|
7 |
C-Command and Extraction in Tree Adjoining Grammar
|
|
|
|
In: ftp://ftp.cis.upenn.edu/pub/skulick/mol99-jim.ps.gz (1999)
|
|
BASE
|
|
Show details
|
|
8 |
Primitive c-command
|
|
|
|
In: http://www.cog.jhu.edu/faculty/frank/papers/cc-2001.pdf (1998)
|
|
BASE
|
|
Show details
|
|
9 |
Primitive C-Command
|
|
|
|
In: http://www.cogsci.jhu.edu/faculty/./rfrank/cc.ps (1998)
|
|
BASE
|
|
Show details
|
|
10 |
Optimality theory and the generative complexity of constraint violability
|
|
|
|
In: http://acl.ldc.upenn.edu/J/J98/J98-2006.pdf (1998)
|
|
Abstract:
It has been argued that rule-based phonological descriptions can uniformly be expressed as map-pings carried out by finite-state transducers, and therefore fall within the class of rational relations. If this property of generative capacity is an empirically correct characterization of phonological mappings, it should hold of any sufficiently restrictive theory of phonology, whether it utilizes con-straints or rewrite rules. In this paper, we investigate the conditions under which the phonological descriptions that are possible within the view of constraint interaction embodied in Optimality Theory (Prince and Smolensky 1993) remain within the class of rational relations. We show that this is true when GEN is itself a rational relation, and each of the constraints distinguishes among finitely many regular sets of candidates. 1.
|
|
URL: http://acl.ldc.upenn.edu/J/J98/J98-2006.pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.6026
|
|
BASE
|
|
Hide details
|
|
11 |
tructural Complexity and the Time Course of Grammatical Development
|
|
|
|
In: http://web.jhu.edu/cogsci/people/faculty/Frank/papers/revised-cognition-2up.pdf (1998)
|
|
BASE
|
|
Show details
|
|
12 |
TAG Derivation as Monotonic C-Command
|
|
|
|
In: http://www.cis.upenn.edu/~ircs/mol/papers/frank_vijay.ps (1998)
|
|
BASE
|
|
Show details
|
|
13 |
On the Use of Triggers in Parameter Setting
|
|
|
|
In: http://www.cis.udel.edu/~rfrank/./ps-papers/triggers.ps (1996)
|
|
BASE
|
|
Show details
|
|
14 |
On the Use of Triggers in Parameter Setting
|
|
|
|
In: http://hebb.cog.jhu.edu/faculty/frank/././_pdf/frank/useof_triggers_parameter.pdf (1996)
|
|
BASE
|
|
Show details
|
|
15 |
Generalized Transformations and the Theory of Grammar
|
|
|
|
In: http://web.jhu.edu/cogsci/people/faculty/frank/papers/glow-final.pdf (1995)
|
|
BASE
|
|
Show details
|
|
16 |
Nominal Structures and Structural Recursion
|
|
|
|
In: ftp://babel.ling.upenn.edu/papers/faculty/tony_kroch/papers/gerunds.ps (1994)
|
|
BASE
|
|
Show details
|
|
17 |
Nominal Structures and Structural Recursion
|
|
|
|
In: http://www.cogsci.jhu.edu/faculty/./rfrank/gerunds.ps (1994)
|
|
BASE
|
|
Show details
|
|
18 |
Using motivational factors and learning strategies to predict academic success.
|
|
|
|
BASE
|
|
Show details
|
|
19 |
Computation and Linguistic Theory: A Government Binding Theory Parser Using Tree Adjoning Grammar
|
|
|
|
BASE
|
|
Show details
|
|
20 |
Primitive Asymmetric C-Command Derives X-Theory
|
|
|
|
In: http://www.cog.jhu.edu/faculty/frank/papers/nels-acc.pdf
|
|
BASE
|
|
Show details
|
|
|
|