Skip to main content
SpringerLink
Log in

Some Grammars and Recognizers for Formal and Natural Languages

  • Chapter
Advances in Information Systems Science

Abstract

Language as an instrument of communication and carrier of information is a very complex phenomenon. It is a psychophysical entity, because the performance of a language is surely as much dependent on its physical environment as on the mental nuances of its users. Historical factors, emotions, and all other elements which constitute the complex structure and workings of the human mind and human institutions have significant roles in the usage and development of languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. A. Trakhtenbrot, “Algorithms and Automatic Computing Machines,” D. C. Heath and Company, Lexington, Massachusetts (1963).

    Google Scholar 

  2. A. M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. 2–42, 230–65 (1936); A correction, Proc. London Math. Soc. 43, 544–546 (1937).

    Article  Google Scholar 

  3. N. Chomsky, Three models for the description of language, IRT Trans. Inf. Theory IT-2 (3), 113–124 (1956).

    Article  Google Scholar 

  4. N. Chomsky, Formal properties of grammars, in “Handbook of Mathematical Psychology” (D. Luce, R. Bush, and E. Galanter, eds.), Wiley, New York (1963), Vol. II, pp. 323–418.

    Google Scholar 

  5. N. Chomsky, On certain formal properties of grammars, Information and Control 2, 137–167 (1959).

    Article  Google Scholar 

  6. J. W. Backus, The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference, in “Proc. Int. Conf. Inf. Processes” UNESCO, Paris (1959); R. Oldenbourg, Munich; Butterworths, London, (1960), pp. 125–132.

    Google Scholar 

  7. M. Gross and A. Lentin, “Introduction to Formal Grammars,” Springer-Verlag, New York-Heidelberg-Berlin (1970).

    Google Scholar 

  8. J. E. Hopcroft and J. D. Ullman, “Formal Language and their Relation to Automata,” Addison-Wesley, Reading, Massachusetts (1969).

    Google Scholar 

  9. C. F. Hockett, A manual of phonology, Int. J. Am. Linguistics, Publ. 11 (1955).

    Google Scholar 

  10. N. Chomsky, “Syntactic Structures,” Mouton & Co., The Hague (1957).

    Google Scholar 

  11. S. C. Kleene, Representation of events in nerve nets and finite automata, in “Automata Studies” (C. E. Shannon and J. McCarthy, eds.), Princeton University Press, Princeton, New Jersey (1956), pp. 3–41.

    Google Scholar 

  12. N. Chomsky and G. A. Miller, Finite state languages, Information and Control 1, 91–112(1958).

    Article  Google Scholar 

  13. N. Chomsky and M. P. Schützenberger, The algebraic theory of context-free languages, in “Studies in Logic and Foundations of Mathematics” (L. E. J. Brouwer, E. W. Beth, and A. Heyting, eds.), North-Holland, Amsterdam (1963), pp. 118–161.

    Google Scholar 

  14. Y. Bar-Hillel, M. Perles, and E. Shamir, On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachwiss. und Kommunikationsforsch. 14, 143 – 172 (1961).

    Google Scholar 

  15. Y. Bar-Hillel, “Language and Information,”Addison-Wesley, Reading, Massachusetts (1964), pp. 116–150.

    Google Scholar 

  16. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3, 114–125 (1959).

    Article  Google Scholar 

  17. in “Sequentional Machines: Selected Papers” (E. F. Moore, ed.) Addison. Wesley, Reading, Massachusetts (1964), pp. 63–91.

    Google Scholar 

  18. J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res. Develop. 3, 198–200 (1959).

    Article  Google Scholar 

  19. R. J. Evey, “The Theory and Applications of Pushdown Store Machines,” PhD Thesis, Harvard University, 1963; published as Report No. NSF-10, The Comp. Lab. of Harvard University, 1963.

    Google Scholar 

  20. N. Chomsky, Context-free grammars and pushdown storage, QPR (MIT, Cambridge, Massachusetts), No. 65 (1962).

    Google Scholar 

  21. S. Rosen, Electronic computers: a historical survey, Computing Surveys 1 (1), 7–36 (1969).

    Article  Google Scholar 

  22. M. Minsky, “Computation: Finite and Infinite Machines,” Prentice-Hall, Englewood Cliffs, New Jersey (1967).

    Google Scholar 

  23. P. S. Landweber, Three theorems on phrase structure grammars of type 1, Inf. and Control 6 (2), 131–136 (1963).

    Article  Google Scholar 

  24. S. Y. Kuroda, Classes of languages and linear-bounded automata, Inf. and Control 7 (2), 207–223 (1964).

    Article  Google Scholar 

  25. M. A. Harrison, “Introduction to Switching and Automata Theory,” McGraw-Hill, New York (1965).

    Google Scholar 

  26. R. J. Nelson, “Introduction to Automata,” Wiley, New York (1968).

    Google Scholar 

  27. R. S. Wells, Immediate constituents, Language 23, 81–117 (1947).

    Article  Google Scholar 

  28. J. A. Moyne, A flow-charting approach to IC analysis, Methodos XIII (49/50), 113–119 (1961).

    Google Scholar 

  29. L. Bloomfield, The Menomini language, in “Proc. 21st Inter. Cong. Americanists, The Hague (1924), pp. 336–43.

    Google Scholar 

  30. Z. S. Harris, From morpheme to utterance, Language 22, 161–183 (1946).

    Article  Google Scholar 

  31. in “Readings in Linguistics” (M. Joos, ed.), Am. Council of Learned Societies, Washington (1957), pp. 142–153.

    Google Scholar 

  32. Z. S. Harris, “Structural Linguistics,” Phoenix Books, Chicago (1951).

    Google Scholar 

  33. B. Bloch, Studies in colloquial Japanese II: syntax, Language 22, 200–248 (1946).

    Article  Google Scholar 

  34. B. Bloch, Studies in colloquial Japanese II: syntax, in “Readings in Linguistics” (M. Joos, ed.) (1957), pp. 154–185.

    Google Scholar 

  35. P. Postal, Constituent structures: a study of contemporary models of syntactic description, Int. J. Am. Ling. Pub.l 30 (1964).

    Google Scholar 

  36. P. M. Postal, Limitations of phrase structure grammars, in “The Structure of Language” (J. A. Fodor and J. J. Katz, eds.), Prentice-Hall, Englewood Cliffs, New Jersey (1964), pp. 137–151.

    Google Scholar 

  37. C. F. Hockett, Sound change, Language 41, 185–204 (1965).

    Google Scholar 

  38. Z. S. Harris, Co-occurrence and transformation in linguistic structure, Language 33, 283–340 (1957).

    Article  Google Scholar 

  39. Z. S. Harris, Co-occurrence and transformation in linguistic structure, in “The Structure of Language” (J. A. Fodor and J. J. Katz, eds.) (1964), pp. 155–210.

    Google Scholar 

  40. Z. S. Harris, Discourse analysis, Language 28, 1–30 (1952).

    Article  Google Scholar 

  41. Z. S. Harris, Discourse analysis,in “The Structure of Language” (J. A. Fodor and J. J. Katz, eds.), (1964), pp. 355–383.

    Google Scholar 

  42. Z. S. Harris, Transformational theory, Language 41, 363–401 (1965).

    Article  Google Scholar 

  43. Z. S. Harris, “Mathematical Structures of Language,” Wiley, New York (1968).

    Google Scholar 

  44. H. Hiz, Steps toward grammatical recognition, in “Int. Conf. for Standards on a Common Language for Machine Searching and Translation,” Cleveland, Ohio (1959).

    Google Scholar 

  45. H. Hiż, Congrammaticality, batteries of transformations and grammatical categories, in “Structure of Language and its Mathematical Aspects” (R. Jakobson, ed.). AMS, Providence, Rhode Island (1961); pp. 43–50.

    Google Scholar 

  46. N. Chomsky, “Cartesian Linguistics,” Harper and Row, New York (1966).

    Google Scholar 

  47. C. Lancelot and A. Arnauld, Grammaire générale et raisonnèe (1660), The Scolar Press Ltd., Menston (1967).

    Google Scholar 

  48. R. Lakoff, review of Ref. 41, Language 45, 343–364 (1969).

    Article  Google Scholar 

  49. N. Chomsky, Remarks on nominalization, in “Readings in English Transformational Grammar” (R. A. Jacobs and P. S. Rosenbaum, eds.), Ginn and Co., Waltham, Massachusetts (1970), pp. 184–221.

    Google Scholar 

  50. N. Chomsky, “Aspects of the Theory of Syntax,” The MIT Press, Cambridge, Massachusetts (1965).

    Google Scholar 

  51. J. J. Katz and P. Postal, “An Integrated Theory of Linguistic Descriptions,” The MIT Press, Cambridge, Massachusetts (1964).

    Google Scholar 

  52. J. R. Ross, “Constraints on Variables in Syntax,” PhD Thesis, MIT, Cambridge, Massachusetts (1967).

    Google Scholar 

  53. D. M. Perlmutter, “Deep and Surface Structure Constraints in Syntax,” PhD Thesis, MIT, Cambridge, Massachusetts (1968).

    Google Scholar 

  54. J. A. Moyne, An introduction to transformational grammars, Int. J. Computer Math. 2, 169–181 (1968).

    Article  Google Scholar 

  55. C. J. Fillmore, The case for case, in “Universals in Linguistic Theory” (E. Bach and R. T. Harms, eds.), Holt, Rinehart and Winston, New York (1968), pp. 1–88.

    Google Scholar 

  56. G. H. Matthews, Le cas échéant, unpublished paper, Parts I and II, MIT, Cambridge, Massachusetts (1968).

    Google Scholar 

  57. N. Chomsky, Deep structure, surface structure, and semantic interpretation, in “Studies in General and Oriental Linguistics” (R. Jacobson and S. Kawamoto, eds.), TEC Co. Ltd., Tokyo (1970), pp. 52–91.

    Google Scholar 

  58. R. S. Jackendoff, “Some Rules of Semantic Interpretation for English,” PhD Thesis, MIT, Cambridge, Massachusetts (1969).

    Google Scholar 

  59. J. A. Moyne, Reflexive and emphatic, Language 47, 141–163 (1971).

    Article  Google Scholar 

  60. J. A. Moyne, The dilemma of the emphatic placement rule, unpublished.

    Google Scholar 

  61. J. J. Katz, Interpretive semantics vs. generative semantics, Found. Language 6, 220–259 (1970).

    Google Scholar 

  62. J. J. Katz, “Semantic Theory,” Harper and Row, New York (in press).

    Google Scholar 

  63. P. S. Rosenbaum, “English Grammar II,” IBM research report, Yorktown Heights, New York (1968).

    Google Scholar 

  64. R. P. Stockwell, P. Schachter, and B. H. Partee, “Integration of Transformational Theories on English Syntax,” ESD-TR-68–419, Vols. I and II, UCLA (1968).

    Google Scholar 

  65. N. Chomsky, “Current Issues in Linguistic Theory,” Mouton and Co., The Hague (1964).

    Google Scholar 

  66. N. Chomsky, “Topics in the Theory of Generative Grammar,” Mouton and Co. The Hague (1966).

    Google Scholar 

  67. J. D. McCawley, Meaning and the description of languages, Kotoba No Uchu (Tokyo) 2 (9–11) (1967).

    Google Scholar 

  68. J. D. McCawley, The role of semantics in a grammar, in “Universals in Linguistic Theory” (E. Bach and R. T. Harms, eds.), Holt, Rinehart and Winston, New York (1968).

    Google Scholar 

  69. G. P. Lakoff, Instrumental adverbs and the concept of deep structure, Found. Language 4, 4–29 (1968).

    Google Scholar 

  70. G. Lakoff, Global rules, Language 46, 627–639 (1970).

    Article  Google Scholar 

  71. G. Lakoff and J. R. Ross, Is deep structure necessary?, unpublished paper, MIT (1967).

    Google Scholar 

  72. R. B. Lees, The grammar of English nominalization, Int. J. Am. Linguistics Publ. 12 (1960).

    Google Scholar 

  73. G. Lakoff, “Irregularity in Syntax,” Holt, Rinehart and Winston, New York (1970).

    Google Scholar 

  74. N. Chomsky, A transformational approach to syntax, in “Proc. Third Texas Conf. on Problems of Linguistic Analysis in English” (A. A. Hill. ed.), University of Texas Press (1962), pp. 124–158.

    Google Scholar 

  75. J. H. Greenberg (Ed.), “Universals of Language,” The MIT Press, Cambridge. Massachusetts (1966).

    Google Scholar 

  76. E. Bach and R. T. Harms (eds.), “Universals in Linguistic Theory,” Holt, Rinehart and Winston, New York (1968).

    Google Scholar 

  77. J. J. Katz and J. A. Fodor, The structure of a semantic theory, Language 39, 170–210 (1963).

    Article  Google Scholar 

  78. J. J. Katz and J. A. Fodor, The structure of a semantic theory, in “The Structure of Language” (J. A. Fodor and J. J. Katz, eds.), Prentice-Hall, Englewood Cliffs, New Jersey (1964).

    Google Scholar 

  79. D. Bolinger, The atomization of meaning, Language 41, 555–573 (1965).

    Article  Google Scholar 

  80. U. Weinreich, Explorations in semantic theory, in “Current Trends in Linguistics” (T. A. Sebeok, ed.), Mouton and Co. (1966), Vol. III, pp. 395–477.

    Google Scholar 

  81. J. J. Katz, Recent issues in semantic theory, Found. Language 3, 150–158 (1967).

    Google Scholar 

  82. M. Bierwisch, On certain problems of semantic representation, Found. Language 5, 153–184 (1969).

    Google Scholar 

  83. T. G. Bever and P. Rosenbaum, Two studies on syntax and semantics, MITRE Technical Report, Bedford, Massachusetts.

    Google Scholar 

  84. N. Chomsky and M. Halle, “The Sound Pattern of English,” Harper and Row, New York (1968).

    Google Scholar 

  85. S. Peters and R. Ritchie, On the generative capacity of transformational grammars, to appear in Inf. Sci.

    Google Scholar 

  86. S. Peters and R. W. Ritchie, On restricting the base component of transformational grammars, Inf. and. Control 18, 483–501 (1971).

    Article  Google Scholar 

  87. G. H. Matthews, Analysis by synthesis of sentences in a natural language, in “Int. Conf. on Machine Translation and Applied Lang. Analysis” H. M. Stationary Office, London (1962).

    Google Scholar 

  88. N. Chomsky and G. A. Miller, Introduction to the formal analysis of natural languages, in “Handbook of Mathematical Psychology” (R. R. Bush, E. H. Galanter, and R. D. Luce, eds.), Wiley, New York (1963), Vol. 2, pp. 269–321.

    Google Scholar 

  89. D. E. Walker and J. M. Bartlett, The structure of language for man and computer: Problems in formalization, in “First Congress on the Information Sciences,” Cambridge, Massachusetts (1962).

    Google Scholar 

  90. S. R. Petrick, “A Recognition Procedure for Transformational Grammars,” PhD Thesis, MIT, Cambridge, Massachusetts (1965).

    Google Scholar 

  91. MITRE Corporation, “English Preprocessor Manual,” The MITRE Corporation, Bedford, Massachusetts (1964).

    Google Scholar 

  92. I. Rhodes, A new approach to the mechanical syntactic analysis of Russian, Mechanical Translation 6 (November) (1961).

    Google Scholar 

  93. S. Kuno and A. G. Oettinger, “Multiple-Path Syntactic Analyzer,” Report NSF-8, The Computation Laboratory, Harvard University (1963).

    Google Scholar 

  94. S. Kuno, “A System for Transformational Analysis,” Report NSF-15, Comp. Lab., Harvard University (1965).

    Google Scholar 

  95. S. Kuno, Computer analysis of natural languages, in “Proc. of Symp. in Appl. Math.,” Vol. 19, “Mathematical Aspects of Computer Science,” AMS (1967).

    Google Scholar 

  96. R. W. Floyd, The syntax of programming languages—A survey, IEEE Trans. Elec. Computers EC-13, 346–353 (1964).

    Article  Google Scholar 

  97. T. E. Cheatham, “The Theory and Construction of Compilers,” Computer Associates, Wakefield, Massachusetts (1966).

    Google Scholar 

  98. J. A. N. Lee, “The Anatomy of a Compiler,” Reinhold, New York (1967).

    Google Scholar 

  99. D. G. Cantor, On the ambiguity problem of Backus systems, J. ACM 9, 477–479 (1962).

    Article  Google Scholar 

  100. R. W. Floyd, On ambiguity in phrase-structure languages, CACM 5, 526–534 (1962).

    Google Scholar 

  101. J. A. Moyne, A transformational approach to compiler construction, unpublished.

    Google Scholar 

  102. D. E. Knuth, On the translation of languages from left to right, Inf. and Control 8, 607–639 (1965).

    Article  Google Scholar 

  103. J. A. Moyne, Information retrieval and natural language, in “Proc. Am. Soc. Inf. Sci. (1969), Vol. 6, pp. 259–263.

    Google Scholar 

  104. B. F. Green, A. K. Wolf, C. Chomsky, and K. Laughery, Baseball: an automatic question answering, in “Computer and Thought” (E. A. Figenbaum and J. Feldman, eds.), McGraw-Hill, New York (1963), pp. 207–216.

    Google Scholar 

  105. D. G. Bobrow, Natural language input for a computer problem-solving system, in “Proc. AFIPS Conf.,” Vol. 26, Spartan, Baltimore, Maryland (1964).

    Google Scholar 

  106. R. F. Simmons, Answering English questions by computer: A survey, CACM 8, 53–70 (1965).

    Google Scholar 

  107. J. A. Moyne, “Proto-RELADES: A Restrictive Natural Language System,” IBM, BPC Tech Report 3 (October 1967).

    Google Scholar 

  108. W. A. Woods, “Semantics for a Question-Answering System,” Report NSF-19, Comp. Lab., Harvard University (1967).

    Google Scholar 

  109. Deacon Project, “Phrase-Structure Oriented Targeting Query Language,” RM65 TMP-64, TEMPO, General Electric Co., Santa Barbara, California (1965).

    Google Scholar 

  110. B. H. Dostert and F. B. Thompson, How features resolve syntactic ambiguity, in “Proc. Symp. Inf. Storage and Ret.” University of Maryland (1971), pp. 19–32.

    Google Scholar 

  111. D. G. Bobrow, Syntactic analysis of English by computer—A survey, in “Proc. AFIPS, FJCC,” 24, Spartan, Washington, D.C. (1963), Vol. 24, pp. 365–387.

    Google Scholar 

  112. M. Pacak and A. W. Pratt, The function of semantics in automated language processing, in “Proc. Symp. Inf. Storage and Ret.” University of Maryland (1971), pp. 5–18.

    Google Scholar 

  113. A. G. Oettinger and S. Marks, “Run, Computer, Run,” Harvard University Press, Cambridge, Massachusetts (1969).

    Google Scholar 

  114. L. Gross, “Design for Computer Program to Simulate the Phonological Component of a Generative Grammar,” MITRE Corporation, Bedford, Massachusetts (1966).

    Google Scholar 

  115. D. G. Bobrow and J. B. Fraser, A phonological rule tester, Commun. ACM 11, 766–772 (1968).

    Article  Google Scholar 

  116. M. Kay, “From Semantics to Syntax,” RAND Corporation Publ. No. P-3746; in “Progress in Linguistics” (M. Bierwisch and K. E. Heidolph, eds.), Mouton, The Hague (1970), pp. 114–126.

    Google Scholar 

  117. J. Friedman, “A Computer Model of Transformational Grammar,” American Elsevier, New York (1971).

    Google Scholar 

  118. D. G. Hays, “Dependency Theory: A Formalization and some Observations,” The RAND Corporation, Report RM 4087-PR, Santa Monica, California (1963)

    Google Scholar 

  119. S. R. Petrick, On the use of syntax-based translators for symbolic and algebraic manipulation, in “Proc. Second Symp. on Symbolic and Algebraic Manip.” (S. R. Petrick, ed.), Los Angeles, California (1971), pp. 224–237.

    Chapter  Google Scholar 

  120. P. Culicover, J. Kimball, C. Lewis, D. Loveman, and J. Moyne, “An Automated Recognition Grammar for English,” IBM, FSC69–5007. Cambridge, Massachusetts (1969).

    Google Scholar 

  121. D. B. Loveman, J. A. Moyne, and R. G. Tobey, CUE: A processor system for restricted, natural English, in “Proc. Symp. Inf. Storage and Retrieval” University of Maryland (1971), pp. 47–49.

    Google Scholar 

  122. W. A. Woods, Transition network grammars for natural language analysis,” Commun. ACM 13, 591–606 (1970).

    Article  Google Scholar 

  123. N. Lindgren, Machine recognition of human language, Parts I—III, IEEE Spectrum 2 (3), 114–136 (1965).

    Article  Google Scholar 

  124. N. Lindgren, Machine recognition of human language, Parts I—III, IEEE Spectrum 2 (4), 44–59 (1965).

    Google Scholar 

  125. N. Lindgren, Machine recognition of human language, Parts I—III, IEEE Spectrum 2 (5), 104–116 (1965).

    Article  Google Scholar 

Additional references

  1. M. A. Arbib, “Algebraic Theory of Machines, Languages and Semigroups,” Academic Press, New York (1968).

    Google Scholar 

  2. T. L. Booth, “Sequential Machines and Automata Theory,” Wiley, New York (1967).

    Google Scholar 

  3. J. T. Tou (ed.), “Applied Automata Theory,” Academic Press, New York (1963).

    Google Scholar 

  4. A. A. Markov, The theory of algorithms, Works of the Mathematics Institute Imeni Steklov 38, 176–189 (1951) [English transi. Trans. AMS, Series 2, 15, 1–14 (1960)].

    Google Scholar 

  5. S. C. Kleene, “Introduction to Metamathematics,” Van Nostrand, Princeton, New Jersey (1952).

    Google Scholar 

  6. A. Gill, “Introduction to the Theory of Finite-State Machines,” McGraw-Hill, New York (1962).

    Google Scholar 

  7. C. E. Shannon, Computers and automata, Proc. IRE 41, 1234–1241 (1953).

    Article  Google Scholar 

  8. R. McNaughton, The theory of automata, a survey, in “Advances in Computers” (F. Alt, ed.), Academic Press, New York (1961).

    Google Scholar 

  9. S. Ginsburg, “An Introduction to Mathematical Machine Theory,” Addison-Wesley, Reading, Massachusetts (1962).

    Google Scholar 

  10. S. Ginsburg, “The Mathematical Theory of Context-Free Languages,” McGraw-Hill, New York (1966).

    Google Scholar 

  11. M. P. Schützenberger, On context-free languages and pushdown automata, Inf. and Control 6, 246–264 (1963).

    Article  Google Scholar 

  12. S. A. Greibach, A new normal-form theorem for context-free phrase-structure grammars, J. ACM 12, 42–52 (1965).

    Article  Google Scholar 

  13. S. A. Greibach, “Inverses of Phrase Structure Generators,” Harvard PhD Thesis. Report NSF-11, Comp. Lab. Harvard University (1963).

    Google Scholar 

  14. A. G. Oettinger, Automatic syntactic analysis and the pushdown store, in “Proc. Symp. on Appl. Math.,” AMS (1961), Vol. 12.

    Google Scholar 

  15. S. C. Kleene, General recursive functions of natural numbers, Math. Annalen 112, 727–742 (1936).

    Article  Google Scholar 

  16. A. Church, An unsolvable problem of elementary number theory, Am. J. Math. 58, 345–363 (1936).

    Article  Google Scholar 

  17. E. Post, Finite Combinatory processes, formulation I, J. Symbolic Logic 1, 103–105 (1936).

    Article  Google Scholar 

  18. E. Post, A variant of recursively unsolvable problem, Bull. AMS 52, 264–268 (1946).

    Article  Google Scholar 

  19. M. Davis, “Computability and Unsolvability,” McGraw-Hill, New York (1958).

    Google Scholar 

  20. P. C. Fisher, Multiple and infinite state automata—A survey, Commun. ACM 8, 799–805 (1965).

    Article  Google Scholar 

  21. C. E. Shannon, A universal Turing machine with two internal states, in “Automata Studies” (C. E. Shannon and J. McCarthy, eds.), Princeton University Press, Princeton, New Jersey (1956).

    Google Scholar 

  22. J. Myhill, “Linear Bounded Automata,” WADD Tech. Note, 60–165, Wright Patterson Air Force Base, Ohio (1960).

    Google Scholar 

  23. E. Bach, “An Introduction to Transformational Grammars,” Holt, Pinehart and Winston, New York (1946).

    Google Scholar 

  24. D. A. Reibel and S. A. Schane, “Modern Studies in English: Readings in Transformational Grammar,” Prentice-Hall, Englewood Cliffs, New Jersey (1969).

    Google Scholar 

  25. C. J. Fillmore and D. T. Langendoen (Eds.), “Studies in Linguistic Semantics,” Holt, Rinehart and Winston, New York (1971).

    Google Scholar 

  26. W. L. Chafe, “Meaning and the Structure of Language,” University of Chicago Press, Chicago (1970).

    Google Scholar 

  27. J. Lyons, “Structural Semantics,” Basil Blackwell, Oxford (1967).

    Google Scholar 

  28. K. Kiefer (Ed.), “Studies in Syntax and Semantics,” D. Reidel, Dordrecht, Holland (1970).

    Google Scholar 

  29. N. Chomsky, Some general properties of phonological rules, Language, 43, 102–128 (1967).

    Article  Google Scholar 

  30. M. Halle, Phonology in generative grammar, Word 18, 54–72 (1962).

    Google Scholar 

  31. M. Halle, On the bases of phonology, in “The Structure of Language” (J. A. Fodor and J. J. Katz, eds.), Prentice-Hall, Englewood Cliffs, New Jersey (1964), pp. 324–333.

    Google Scholar 

  32. R. Jakobson, “Selected Writings I,” Mouton, The Hague (1962).

    Google Scholar 

  33. N. S. Trubetzkoy, “Grundzüge der Phonologie,” Vandenhoeck and Ruprecht, Göttingen (1958).

    Google Scholar 

  34. P. M. Postal, “Aspects of Phonological Theory,” Harper and Row, New York (1968).

    Google Scholar 

  35. S. Ginsburg and B. Partee, A mathematical model of transformational grammars, Inf. and Control 15, 297–334 (1969).

    Article  Google Scholar 

  36. A. Salomaa, The generative capacity of transformational grammars of Ginsburg and Partee,” Inf. and Control 18, 227–232 (1971).

    Article  Google Scholar 

  37. H. Putnam, Some issues in the theory of grammar, in “Structure of Language and its Mathematical Aspects” (R. Jakobson, ed.), AMS, Providence, Rhode Island (1961).

    Google Scholar 

  38. E. Irons, A syntax directed compiler for algol 60, Comm. ACM 4, 1 (1961).

    Article  Google Scholar 

  39. P. Naur, Report on the algorithmic language algol 60, Comm. ACM, 3, 299–314 (1960).

    Article  Google Scholar 

  40. K. E. Iverson, “Formalism in Programming Languages,” IBM Research Report RC-992, Yorktown Heights, New York (1963).

    Google Scholar 

  41. K. E. Iverson, “A Programming Language,” Wiley, New York (1962).

    Google Scholar 

  42. R. E. Stearns and P. M. Lewis, Property grammars and table machines, Inf. and Control 14, 524–549 (1969).

    Article  Google Scholar 

  43. D. E. Knuth, “The Art of Computer Programming,” Addison-Wesley, Reading Massachusetts (1968).

    Google Scholar 

  44. J. McCarthy, A basis for a mathematical theory of computation, in Computer Programming and Formal Systems, North-Holland, Amsterdam (1963), pp. 33–70.

    Chapter  Google Scholar 

  45. J. E. Sammet, “Programming Languages: History and Fundamentals,” Prentice-Hall, Englewood Cliffs, New Jersey (1969).

    Google Scholar 

  46. J. W. de Bakker, “Formal Definition of Programming Languages,” Mathematisch Centrum, Amsterdam (1967).

    Google Scholar 

  47. H. Borko (Ed.), “Computer Applications in the Behavioral Sciences,” Prentice-Hall, Englewood Cliffs, New Jersey (1962).

    Google Scholar 

  48. D. G. Hays, “Introduction to Computational Linguistics,” American Elsevier, New York (1967).

    Google Scholar 

  49. P. L. Garvin (Ed.), “Natural Language and the Computer,” McGraw-Hill, New York (1963).

    Google Scholar 

  50. W. Plath, Mathematical linguistics, in “Trends in European and American Linguistics,” Spectrum, Utrecht (1961), pp. 21–57.

    Google Scholar 

  51. J. Robinson, “Preliminary Codes and Rules for the Automatic Parsing of English,” RAND Corp. RM-3339-PR, Santa Monica, California (1962).

    Google Scholar 

  52. V. Yngve, A model and a hypothesis for language structure, Proc. Am. Phil. Sod. 104, 444–446 (1960).

    Google Scholar 

  53. N. Rochester, The use of English for communicating with a computer, in “Proc. Inf. Systems Symp.,” IBM, Washington, D.C. (1968), pp. 195–202.

    Google Scholar 

  54. W. J. Plath, “Specifications and Utilization of Transformational Grammars,” Clearing House for Fed. Sci. and Tech. Inf., AD 679–633, Springfield, Virginia (IBM Sci. Report 3, July 1968).

    Google Scholar 

  55. N. Rochester and R. Goldfinger (Eds.), Special issue on computer languages, IEEE Trans. EC-13 (4) (August 1964).

    Google Scholar 

  56. S. Kuno and A. Oettinger, Multiple-path syntactic analysis, in “Proc. IFIP Cong”, Munich (1962).

    Google Scholar 

  57. H. Dewar, P. Bratley, and J. P. Thorne, A program for the syntactic analysis of English sentences, Commun. ACM 8 , 416–419 (1969).

    Google Scholar 

  58. M. R. Quillian, The teachable language comprehender: a simulation program and theory of language, Commun. ACM 8, 459–476 (1969).

    Article  Google Scholar 

  59. S. J. Keyser, “Machine Recognition of Transformational Grammars,” AFCRL Doc. 67–0316, Brandeis University (1967).

    Google Scholar 

  60. G. Salton and M. E. Lesk, The SMART automatic document retrieval system—An illustration, Commun. ACM 8, 391–398 (1965).

    Article  Google Scholar 

  61. H. Borko (Ed.), “Automated Language Processing,” Wiley, Sons, New York (1967).

    Google Scholar 

  62. D. G. Hays and R. Ma, “Computational Linguistics: Bibliography,” 1964, RAND Corp, RM-4523-PR, Santa Monica, California (1965).

    Google Scholar 

  63. Robert M. Schwarcz, John F. Burger, and Robert F. Simmons, “A deductive question-answerer for natural language inference,” Commun. ACM 13, 167–183 (1970).

    Article  Google Scholar 

  64. M. A. Rahimi, “Keyword Index Bibliography of Automata, Formal Languages and Computability Theory,” ACM, SIGACT, 5 (May 1970).

    Google Scholar 

  65. A. H. Roberts (Ed.), Language and Automation, An international reference publication (Journal).

    Google Scholar 

  66. Linguistics in Documentation (Current abstract of papers and publications on linguistics and computational linguistics), Fédération internationale de documentation (periodical).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queens College of the City University of New York, Flushing, New York, USA

    J. A. Moyne

Authors
  1. J. A. Moyne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Informatics Research, University of Florida, Gainesville, Florida, USA

    Julius T. Tou

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Plenum Press, New York

About this chapter

Cite this chapter

Moyne, J.A. (1974). Some Grammars and Recognizers for Formal and Natural Languages. In: Tou, J.T. (eds) Advances in Information Systems Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-8246-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-8246-5_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4615-8248-9

  • Online ISBN: 978-1-4615-8246-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation