Topics in Artificial Intelligence 1976
DOI: 10.1007/978-3-7091-4358-2_5
|View full text |Cite
|
Sign up to set email alerts
|

Formal Grammars and the Natural Language User: A Review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1990
1990
2012
2012

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…In particular, it seems that, when the theory of transformational grammar is properly formulated, any such grammar must meet formal conditions that restrict it to the enumeration of recursive sets." Levelt (1974) is more explicit. He equates descriptive adequacy of a theory with providing linguistic grammars that stay within recursive grammars, and explanatory adequacy with providing primitive recursive grammars, i.e.…”
Section: P a B C Dmentioning
confidence: 98%
See 1 more Smart Citation
“…In particular, it seems that, when the theory of transformational grammar is properly formulated, any such grammar must meet formal conditions that restrict it to the enumeration of recursive sets." Levelt (1974) is more explicit. He equates descriptive adequacy of a theory with providing linguistic grammars that stay within recursive grammars, and explanatory adequacy with providing primitive recursive grammars, i.e.…”
Section: P a B C Dmentioning
confidence: 98%
“…What makes them decidable is a meta-theoretical question, but it would not lead to a theory of language if it fails to engage substantive constraints in a linguistic theory. Levelt (1974) suggests that one such constraint is the learnability-in-principle, which amounts to saying that acquirable grammars are the primitive recursive ones. This is one of the running themes of this book, and it requires a closer look at substantive constraints on grammars, which we will narrow down to a theory of possible lexical categories.…”
Section: Infinitude and Learnability-in-principlementioning
confidence: 99%