FSG and PSG QUESTIONS WITH CORRECT ANSWERS

FSG and PSG QUESTIONS WITH CORRECT ANSWERS Generative grammar system of grammatical rules that allow speakers to create possible sentences in a language Well formed sentences only Finite State Grammar (FSG) "the simplest type of grammar which, with a finite amount of apparatus, can generate an infinite number of sentences , is a finite state or Markov-process grammar. " Chomsky,1957:24 generates strings in a fixed order past to future Chomsky 1958:92 FSG is a machine The machine has a number of states and the capacity to change from one state to another as it registers different symbols. Among these states one is the initial state S0 and there is at least one final state SF." Allerton,1979;63 FSG summary Based on states language produced is linear linearity based on states, language is not linear Modified by loops FSG weaknesses -will produce non-sentences as well as well-formed -limited in its generative capacities -Too many loops can't accommodate pre/post modifiers, not recursive -Based on linearity, language isn't linear -Can't account for active and passive voice Phrase structure grammar (PSG) Based on categories (Det N V Adj Adv Deg) S = Np Vp etc PSG incorporates these constraints so has a greater explanatory adequacy than FSG Relations Paradigmatic and syntagmatic Paradigmatic Relates to a system and the ability of an item to be substituted with another item within the system -choice relations -context free Syntagmatic Relates to the sequential arrangement of items to form meaningful and acceptable expressions. -chain relations -context sensitive -positional relations -structure and sequence rather than system -how we combine phonemes, morphemes and words structurally - a determiner is followed by a noun and a noun phrase - The house NOT house the Recursive Repetition or loops "Given any sentence of English, we can always form a longer one by adding another Adjective, Prepositional Phrase, Clause, Adverb, Conjunction, etc" Radford,1998:23 PSG recognises the recursive ability of language S aX X aXb X b S1 aaXb S2 aaaXbb S3 aaa aXb bb S4 aaa a aXb b bb S5 aaa a a aXb b b bb S6 Rules ....Remain Recursive until X is replaced by "b" Chomsky, 1957 PSG is represented by phrase structure rules = tree diagrams PSG is able to show recursive ability because it is able to generate string with an underlying recursively-embedded, hierarchal structure Fedor 2012 PSG strengths Illustrates recursive nature of language. Greater generative capacities. Hierarchal "automatically achieving descriptive adequacy through their automatic linking of rules and tree diagrams (via derivations)" Allerton,1979:79 More restrictive - Allerton,1979:79 says suits human speech better