research-article

Free access

The mitre syntactic analysis procedure for transformational grammars

Authors:

Arnold M. Zwicky,

Joyce Friedman,

Barbara C. Hall,

Donald E. WalkerAuthors Info & Claims

AFIPS '65 (Fall, part I): Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I

Pages 317 - 326

https://doi.org/10.1145/1463891.1463928

Published: 30 November 1965 Publication History

PDF eReader

Abstract

A solution to the analysis problem for a class of grammars appropriate to the description of natural languages is essential to any system which involves the automatic processing of natural language inputs for purposes of man-machine communication, translation, information retrieval, or data processing. The analysis procedure for transformational grammars described in this paper was developed to explore the feasibility of using ordinary English as a computer control language.

References

[1]

"English Preprocessor Manual," SR-132, MITRE Corp. 1964, rev. 1965.

Google Scholar

[2]

N. Chomsky, Syntactic Structures, Mouton, The Hague, 1957.

Google Scholar

[3]

N. Chomsky, Aspects of the Theory of Syntax, M.I.T. Press, Cambridge, Mass., 1965.

Google Scholar

[4]

N. Chomsky, "Formal Properties of Grammars," Handbook of Mathematical Psychology, R. D. Luce, R. R. Bush and E. Galanter, eds., Wiley, New York, 1963, vol. 2, pp. 323--418.

Google Scholar

[5]

N. Chomsky and G. A. Miller, "Introduction to the Formal Analysis of Natural Languages," ibid., pp. 269--321.

Google Scholar

[6]

N. Chomsky and G. A. Miller, "Finitary Models of Language Users," ibid., pp. 419--491.

Google Scholar

[7]

T. V. Griffiths and S. R. Petrick, "On the Relative Efficiencies of Context-Free Grammar Recognizers," Comm. ACM, vol. 8, pp. 289--300 (1965).

Digital Library

Google Scholar

[8]

T. V. Griffiths, "Turing machine recognizers for general rewriting systems. IEEE Symp. Switching Circuit Theory and Logical Design. Princeton, N. J., November, 1965, pp. 47--56.

Digital Library

Google Scholar

[9]

G. H. Matthews, "Analysis by Synthesis of Sentences of Natural Languages," 1961 International Conference on Machine Translation and Applied Language Analysis, HM Stationery Office, London, 1962, vol. 2, pp. 531--540.

Google Scholar

[10]

S. R. Petrick, "A Recognition Procedure for Transformational Grammars," Ph.D. thesis, M.I.T., 1965.

Google Scholar

[11]

S. Kuno, "A System for Transformational Analysis," paper presented at the 1965 International Conference on Computational Linguistics, New York City, May 20, 1965.

Digital Library

Google Scholar

Cited By

View all

(1988)Towards Natural Language UnderstandingComputers and Languages - Theory and Practice10.1016/B978-0-444-70463-4.50018-9(301-342)Online publication date: 1988
https://doi.org/10.1016/B978-0-444-70463-4.50018-9
Hobbs JGrishman R(1975)The automatic transformational analysis of english sentences: An implementationInternational Journal of Computer Mathematics10.1080/002071676088031175:1-4(267-283)Online publication date: Jan-1975
https://doi.org/10.1080/00207167608803117
Chandrasekaran B(1975)Artificial Intelligence—The Past DecadeAdvances in Computers Volume 1310.1016/S0065-2458(08)60658-0(169-232)Online publication date: 1975
https://doi.org/10.1016/S0065-2458(08)60658-0
Show More Cited By

The mitre syntactic analysis procedure for transformational grammars

Recommendations

Parsing expression grammars: a recognition-based syntactic foundation
POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Bayesian symbol-refined tree substitution grammars for syntactic parsing
ACL '12: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1

We propose Symbol-Refined Tree Substitution Grammars (SR-TSGs) for syntactic parsing. An SR-TSG is an extension of the conventional TSG model where each nonterminal symbol can be refined (subcategorized) to fit the training data. We aim to provide a ...
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04

For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AFIPS '65 (Fall, part I): Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I

November 1965

1119 pages

ISBN:9781450378857

DOI:10.1145/1463891

Conference Chair:
Robert W. Rector

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 November 1965

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
198
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)8

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

(1988)Towards Natural Language UnderstandingComputers and Languages - Theory and Practice10.1016/B978-0-444-70463-4.50018-9(301-342)Online publication date: 1988
https://doi.org/10.1016/B978-0-444-70463-4.50018-9
Hobbs JGrishman R(1975)The automatic transformational analysis of english sentences: An implementationInternational Journal of Computer Mathematics10.1080/002071676088031175:1-4(267-283)Online publication date: Jan-1975
https://doi.org/10.1080/00207167608803117
Chandrasekaran B(1975)Artificial Intelligence—The Past DecadeAdvances in Computers Volume 1310.1016/S0065-2458(08)60658-0(169-232)Online publication date: 1975
https://doi.org/10.1016/S0065-2458(08)60658-0
Walker D(1969)Computational linguistic techniques in an on-line system for textual analysisProceedings of the 1969 conference on Computational linguistics10.3115/990403.990480(1-3)Online publication date: 1-Sep-1969
https://dl.acm.org/doi/10.3115/990403.990480
Londe DSchoene W(1968)TGTProceedings of the April 30--May 2, 1968, spring joint computer conference10.1145/1468075.1468132(385-393)Online publication date: 30-Apr-1968
https://dl.acm.org/doi/10.1145/1468075.1468132
Morrill C(1967)Computer-Aided Instruction as Part of a Management Information SystemHuman Factors: The Journal of the Human Factors and Ergonomics Society10.1177/0018720867009003059:3(251-256)Online publication date: 1-Jun-1967
https://doi.org/10.1177/001872086700900305
Jonas R(1967)Generalized translation of programming languagesProceedings of the November 14-16, 1967, fall joint computer conference10.1145/1465611.1465686(570-580)Online publication date: 14-Nov-1967
https://dl.acm.org/doi/10.1145/1465611.1465686
Rosenkrantz D(1967)Programmed grammars A new device for generating formal languagesProceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)10.1109/FOCS.1967.28(14-20)Online publication date: 18-Oct-1967
https://dl.acm.org/doi/10.1109/FOCS.1967.28

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Parsing expression grammars: a recognition-based syntactic foundation

Bayesian symbol-refined tree substitution grammars for syntactic parsing

Parsing expression grammars: a recognition-based syntactic foundation