المرجع الالكتروني للمعلوماتية
المرجع الألكتروني للمعلوماتية

English Language
عدد المواضيع في هذا القسم 6105 موضوعاً
Grammar
Linguistics
Reading Comprehension

Untitled Document
أبحث عن شيء أخر
تنفيذ وتقييم خطة إعادة الهيكلة (إعداد خطة إعادة الهيكلة1)
2024-11-05
مـعاييـر تحـسيـن الإنـتاجـيـة
2024-11-05
نـسـب الإنـتاجـيـة والغـرض مـنها
2024-11-05
المـقيـاس الكـلـي للإنتاجـيـة
2024-11-05
الإدارة بـمؤشـرات الإنـتاجـيـة (مـبادئ الإنـتـاجـيـة)
2024-11-05
زكاة الفطرة
2024-11-05

متى يحرم البيع يوم الجمعة ومن المشمول بالحرمة
2024-10-22
Clausen Formula
13-6-2019
أهمية التمويل والتسليف الزراعي
28-7-2022
البوتاسيوم في التربة
7-7-2019
Second Fundamental Theorem of Calculus
25-8-2018
Photography of star fields
6-9-2020

recursive (adj.)  
  
684   04:17 مساءً   date: 2023-11-06
Author : David Crystal
Book or Source : A dictionary of linguistics and phonetics
Page and Part : 405-18


Read More
Date: 2023-09-26 789
Date: 2023-07-11 653
Date: 5-8-2022 1506

recursive (adj.)

A term used in GENERATIVE LINGUISTICS to refer to RULES which are capable of application to their own output in generating a SENTENCE, to the STRUCTURES thus generated, and to the languages characterized by such rules. There is no limit, for example, to the number of ADJECTIVES which may be used before a NOUN in English, or the number of ADVERBS which may MODIFY a VERB. Such sequences would be introduced by the repeated (‘recursive’) application of the appropriate adjective- or adverb-insertion rules in the relevant section of the GRAMMAR. The importance of recursion (or recursiveness) is that recursive rules are the main FORMAL means of accounting for the CREATIVITY of LANGUAGE: by using this device, an infinite set of sentences can be generated from a finite set of rules. A simple illustration of how this can be formalized is in the following rules:

 

These rules say, in effect, that there is in principle no limit to the number of PREPOSITIONAL PHRASES which may occur following a noun in a noun phrase, e.g. the man in a coat with a collar . . . The phenomenon is also known as ‘iteration’. The term has also been used to define an extension of TRANSITION NETWORK GRAMMARS – recursive transition networks (RTNs). In highly FORMAL discussion, the term may be used in its general mathematical sense to indicate a FUNCTION which can be modelled as an ALGORITHM. A recursive language is one whose characteristic function is recursive in this sense; the language and its complement must both be RECURSIVELY ENUMERABLE.