Routledge Dictionary of Language and Linguistics.pdf

A-Z 1211ReferencesChomsky, N. 1973. Conditions on transformations. In S.R.Anderson and P.Kiparsky (eds). Festschriftfor Morris Halle. New York. 232–86.——1975. Reflections on language. New York.——1976. Conditions on rules of grammar. LingA 2. 303–51.Chomsky, N. and H.Lasnik. 1977. Filters and control. LingI 8. 425–504.——and——1978. A remark on contraction. LingI 9. 268–74.Fiengo, R.W. 1974. Semantic conditions on surface structure. Dissertation, MIT, Cambridge, MA.Lightfoot, D. 1977. On traces and conditions on rules. In P.W.Culicover, T.Wasow, andA.Akmajian (eds), Formal syntax. New York. 207–47.Postal, P.M. and G.K.Pullum. 1978. Traces and the description of English complementizercontraction. LingI 9. 1–29.Pullum, G.K. and R.D.Borsley. 1980. Comments on the two central claims of ‘trace theory.’Linguistics 18. 73–104.transformational grammartractableAn algorithm is tractable if it provides a solution to a problem in time and spaceproportional to some polynomial function of the length of the problem ( complexity).For example, context-free languages may be parsed in time proportional to n 3 where n isthe length of the input string ( parsing). Derivatively, a problem is tractable if thereexists a tractable algorithm solving it. Intractable problems (those for which nopolynomial time/space algorithm exists) are felt to be too costly—in general—forcomputation. For example, checking the satisfiability of a propositional formula requireschecking an exponential number of combinations of the atoms which occur in it.ReferenceGarey, M. and D.Johnson. 1979. Computers and intractability: a guide to the theory of NPcompleteness. New York.trade language1 Spoken colloquial language of the late Middle Ages, in contrast to the written languageof the bureaucracies.