NotesFAQContact Us
Collection
Advanced
Search Tips
ERIC Number: ED012894
Record Type: RIE
Publication Date: 1967
Pages: 1
Abstractor: N/A
Reference Count: N/A
ISBN: N/A
ISSN: N/A
A SIMPLE DESCRIPTION OF AN ALGORITHM FOR TRANSFORMATIONAL ANALYSIS OF ENGLISH SENTENCES. TRANSFORMATIONS AND DISCOURSE ANALYSIS PAPERS, NUMBER 67, UNIVERSITY OF PENNSYLVANIA.
HIZ, DANUTA; JOSHI, ARAVIND K.
PRESENTED IN THIS PAPER IS A SIMPLIFIED DESCRIPTION OF AN ALGORITHM FOR TRANSFORMATIONAL ANALYSIS OF ENGLISH SENTENCES. IT IS NEITHER ASSUMED NOR IMPLIED IN THIS ALGORITHM THAT ANY KIND OF PRIOR ANALYSIS (EITHER STRING OR CONSTITUENT ANALYSIS) IS REQUIRED AS A PREREQUISITE. IN ORDER TO DEFINE THE SET OF ALL TRANSFORMS, THE AUTHORS FIRST DEFINE A SET OF SEQUENCES OF CLASS MARKS WITH THREE SUBSETS. CORRESPONDING TO THESE SUBSETS AND THEIR MUTUAL EMBEDDING RULES ARE THREE SETS OF STRINGS OR PROGRAMS WHICH CONSTITUTE THE MAJOR PORTION OF GRAMMATICAL MATERIAL IN THIS ALGORITHM. FINALLY, A DICTIONARY FOR TRANSFORMATIONAL GRAMMAR IS POSTULATED TO PROVIDE THE ADDITIONAL GRAMMATICAL INFORMATION NECESSARY TO THE ALGORITHM. FOUR EXAMPLES OF DECOMPOSITION (TRANSFORMATIONAL ANALYSIS) OBTAINED BY THIS ALGORITHM ARE GIVEN. THE PROCESS OF ANALYZING A SENTENCE BEGINS IN POSTULATING ALL THOSE STRINGS IN THE GRAMMAR WHICH MAY OCCUR AT THE BEGINNING OF A SENTENCE. EACH VERIFIED POSTULATE FORCES OTHER POSTULATES AS ITS CONSEQUENCES UNTIL THE TERMINAL PERIOD OF THE SENTENCE IS FOUND WHICH IS CONSISTENT WITH A HYPOTHESIS. (JD)
Publication Type: N/A
Education Level: N/A
Audience: N/A
Language: N/A
Sponsor: N/A
Authoring Institution: Pennsylvania Univ., Philadelphia.
Identifiers: N/A