Mixed computation: grammar up and down the Chomsky hierarchy
Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
John Benjamins Publishing Company
2021
|
| _version_ | 1826286382575779840 |
|---|---|
| author | Krivochen, DG |
| author_facet | Krivochen, DG |
| author_sort | Krivochen, DG |
| collection | OXFORD |
| description | Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure rules or via recursive combinatorics and structure is assumed to be uniform: binary branching trees all the way down. In this work we will analyse natural language constructions for which such a rigid conception of phrase structure is descriptively inadequate and propose a solution for the problem of phrase structure grammars assigning too much or too little structure to natural language strings: we propose that the grammar can oscillate between levels of computational complexity in local domains, which correspond to elementary trees in a lexicalised Tree Adjoining Grammar. |
| first_indexed | 2024-03-07T01:42:55Z |
| format | Journal article |
| id | oxford-uuid:9778cf3b-c73f-46fb-a6ef-428ff9736ef2 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T01:42:55Z |
| publishDate | 2021 |
| publisher | John Benjamins Publishing Company |
| record_format | dspace |
| spelling | oxford-uuid:9778cf3b-c73f-46fb-a6ef-428ff9736ef22022-03-26T23:59:49ZMixed computation: grammar up and down the Chomsky hierarchyJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:9778cf3b-c73f-46fb-a6ef-428ff9736ef2EnglishSymplectic ElementsJohn Benjamins Publishing Company2021Krivochen, DGProof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure rules or via recursive combinatorics and structure is assumed to be uniform: binary branching trees all the way down. In this work we will analyse natural language constructions for which such a rigid conception of phrase structure is descriptively inadequate and propose a solution for the problem of phrase structure grammars assigning too much or too little structure to natural language strings: we propose that the grammar can oscillate between levels of computational complexity in local domains, which correspond to elementary trees in a lexicalised Tree Adjoining Grammar. |
| spellingShingle | Krivochen, DG Mixed computation: grammar up and down the Chomsky hierarchy |
| title | Mixed computation: grammar up and down the Chomsky hierarchy |
| title_full | Mixed computation: grammar up and down the Chomsky hierarchy |
| title_fullStr | Mixed computation: grammar up and down the Chomsky hierarchy |
| title_full_unstemmed | Mixed computation: grammar up and down the Chomsky hierarchy |
| title_short | Mixed computation: grammar up and down the Chomsky hierarchy |
| title_sort | mixed computation grammar up and down the chomsky hierarchy |
| work_keys_str_mv | AT krivochendg mixedcomputationgrammarupanddownthechomskyhierarchy |