%A E.J. Weiner %T A knowledge representation approach to understanding metaphors %J Computational Linguistics %K compling, cl %V 10 %N 1 %D 1984 %P 1-14 %A G. Guida %A G. Mauri %T A formal basis for performance evaluation of natural language understanding systems %J Computational Linguistics %K compling, cl %V 10 %N 1 %D 1984 %P 15-30 %A B.W. Ballard %A N.L. Tinkham %T Phrase-structured grammatical framework for transportable natural language processing %J Computational Linguistics %K compling, cl %V 10 %N 2 %D 1984 %P 81-96 %A C.R. Perrault %T On the mathematical properties of linguistic theories %J Computational Linguistics %K compling, cl %V 10 %N 3-4 %D 1984 %P 165-176 %A P.M. Postal %A D.T. Langendoen %T English and the class of context-free languages %J Computational Linguistics %K compling, cl %V 10 %N 3-4 %D 1984 %P 177-181 %A G.K. Pullum %T On two recent attempts to show that English is not a CFL %J Computational Linguistics %K compling, cl %V 10 %N 3-4 %D 1984 %P 182-186 %A D.T. Langendoen %A P.M. Postal %T Comments on Pullum's criticisms %J Computational Linguistics %K compling, cl %V 10 %N 3-4 %D 1984 %P 187-188 %A R.C. Berwick %T Strong generative capacity, weak generative capacity, and modern linguistic theories %J Computational Linguistics %K compling, cl %V 10 %N 3-4 %D 1984 %P 189-202