W. A. Woods
Abstract
The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing. The advantages of this model for natural language analysis are discussed in detail and illustrated by examples. An implementation of an experimental parsing system for transition network grammars is briefly described.
- 1 BOBROW, D. G., AND FRASER, J.B. An augmented state transition network analysis procedure. Proc. Internat. Joint Conf. on Artificial Intelligence, Washington, D.C., 1969, pp. 557-567.Google Scholar
- 2 BOBROW, D. G., MURPHY, D., AND TEITELMAN, W. BBN LISP System. Bolt, Beranek and Newman Inc., Cambridge, Mass., 1968.Google Scholar
- 3 BOOK, R., EVEN, S., GREIBACH, S., AND OTT, G. Ambiguity in graphs and expressions. Mimeo. rep., Aiken Computat. Lab., Harvard U., Cambridge, Mass., 1969. IEEE Trans Comp (to appear).Google Scholar
- 4 CHEATHAM, T. E., AND SATTLEY, K. Syntax-directed compiling. Proc. AFIPS 1964 Spring Joint Comput. Conf., Vol. 25, Spartan Books, New York, pp. 31-57.Google Scholar
- 5 CHOMSKY, N. Formal properties of grammars. In Handbook of Mathematical Psychology, Vol. 2, R. D. Lace, R. R. Bush, and E. Galanter (Eds.). Wiley, New York, 1963.Google Scholar
- 6 --. A transformational approach to syntax. In The Structure of Language, J. A. Fodor, and J. J. Katz (Eds.), Prentice-Hall, Englewood Cliffs, N. J., 1964.Google Scholar
- 7 --. Aspects of the Theory of Syntaz. MIT Press, Cambridge, Mass., 1965.Google Scholar
- 8 CONWAY, M. E. Design of a separable transition-diagram compiler. Comm. ACM 6, 7 (July 1963), 396-408. Google ScholarDigital Library
- 9 EARLEY, J. An efficient context-free parsing algorithm. Ph.D.th. Dep. Computer Sci., Carnegie-Mellon U., Pittsburgh, Pa., 1968. Google ScholarDigital Library
- 10 EARLEY, J. An efficient context-free parsing algorithm. Comm. ACM 13, 2, (Feb. 1970), 94-102. Google ScholarDigital Library
- 11 FILLMORE, C.J. The case for case. In Universals in Linguistic Theory, E. Bach, and R. Harms (Eds.), Holt, Rinehart and Winston, New York, 1968.Google Scholar
- 12 GINSBURG, S. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966. Google ScholarDigital Library
- 13 GREIBACH, SHEILA A. A simple proof of the standard-form theorem for context-free grammars. In Mathematical linguistics and automatic translation, Rep. NSE-18, Comput. Lab., Harvard U., Cambridge, Mass., 1967.Google Scholar
- 14 HERRINGER, J., WEILER, M., AND HURD, E. The immediate constituent analyzer. In Rep. NSF-17, Aiken Comput. Lab., Harvard U., Cambridge, Mass., 1966.Google Scholar
- 15 KASAI, T. An efficient recognition and syntax-analysis algorithm for context-free languages. Sci. Rep. AFCRL- 65-558, Air Force Cambridge Res. Lab., Bedford, Mass., 1965.Google Scholar
- 16 KASAMI, T. A note on computing time for recognition of languages generated by linear grammars. Inform. Contr., 10 (1964), 209-214.Google ScholarCross Ref
- 17 KNUTH, D. E. On the translation of languages from left to right. Inf. Contr. 8 (1965), 607-639.Google ScholarCross Ref
- 18 KUNO, S. "A system for transformational analysis. In Rep. NSF-15, Comput. Lab. Harvard U., Cambridge, Mass, 1965.Google Scholar
- 19 AND OETTINGER, A. G. Multiple path syntactic analyzer. In Information Processing 1062, North-Holland Publishing Co., Amsterdam, 1963.Google Scholar
- 20 MCCARTHY, J., ET AL. LISP 1.5 programmer's manual. MIT Comput. Center, Cambridge, Mass., 1962. Google ScholarDigital Library
- 21 McCAWLEY, J. D. Meaning and the description of languages. In Kotoba No Ucho, TEC Co. Ltd., Tokyo, 1968.Google Scholar
- 22 McNAUGHTON, R. F., AND YAMADA, H. Regular expressions and state graphs for automata. IRE Trans. EC-9 (Mar. 1960), 39-47.Google Scholar
- 23 MATTHEWS, G. H. Analysis by synthesis of natural languages. Proc. 1961 Internal. Conf. on Machine Translation and Applied Language Analysis. Her Majesty's Stationery Office, London, 1962.Google Scholar
- 24 MITRE. English preprocessor manual, Rep. SR-132, The Mitre Corp., Bedford, Mass., 1964.Google Scholar
- 25 OTT, G., AND FEINSTEIN, N. H. Design of sequential machines from their regular expressions," J. ACM 8, 4 (Oct. 1961), 585-600. Google ScholarDigital Library
- 26 PETRICK, S. R. A recognition procedure for transformational grammars. Ph.D. th., Dep. Modern Languages, MIT, Cambridge, Mass., 1965.Google Scholar
- 27 POSTAL, P. M. Limitations of phrase structure grammars. In The Structure of Language, J. A. Fodor and J. J. Katz (Eds.), Prentice-Hall, Englewood Cliffs, N.J., 1964.Google Scholar
- 28 SCHWARTZ, R. M. Steps toward a model of linguistic performance: A preliminary sketch. Mechanical Translation 10 (1967), 39-52.Google Scholar
- 29 THORNE, J., BRATLEY, P., AND DEWAR, H. The syntactic analysis of English by machine. In Machine Intelligence 8 D. Michie (Ed.), American Elsevier, New York, 1968.Google Scholar
- 30 WOODS, W. A. Semantics for a question-answering system. Ph.D. th., Rep NSF-19, Aiken Comput. Lab., Harvard U., Cambridge, Mass., 1967.Google Scholar
- 31 --. Procedural semantics for a question-answering machine. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. 33, Pt. 1, MDI Publications, Wayne, Pa., pp. 457-471.Google Scholar
- 32 --. Augmented transition networks for natural language analysis. Rep. CS-1, Comput. Lab., Harvard U., Cambridge, Mass., 1969.Google Scholar
- 33 YOVNGER, D. H. Context free language processing in time n. G. E. Res. and Devel. Center, Schenectady, N.Y., 1966.Google Scholar
Index Terms
- Transition network grammars for natural language analysis
Recommendations
The restriction language for computer grammars of natural language
Over the past few years, a number of systems for the computer analysis of natural language sentences have been based on augmented context-free grammars: a context-free grammar which defines a set of parse trees for a sentence, plus a group of ...
A Formal Syntax of Natural Languages and the Deductive Grammar
Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (II)This paper presents a formal syntax framework of natural languages for computational linguistics. The abstract syntax of natural languages, particularly English, and their formal manipulations are described. On the basis of the abstract syntax, a ...
Generating parsers for affix grammars
Affix grammars are two-level grammars which are similar to van Wijngaarden's two-level grammars used in the definition of Algol 68. Affix grammars are shown by Koster to be equal in power to van Wijngaarden grammars. They are much more suited to parsing ...
Comments