Impact of a restricted natural language interface on ease of learning and productivity

ABSTRACT

People process natural language in real time and with very limited short-term memories. This article describes a computational architecture for syntactic performance that also requires fixed finite resources.

REFERENCES

• 1: G. Edward Barton , Robert C. Berwick , Eric S. Ristad, Computational Complexity and Natural Language, MIT Press, Cambridge, MA, 1987
• 2: Bever, T., Garrett, M., and Hartig. R. The interaction of perceptual processes and ambiguous sentences. Memory and Cognition 1, 3 (1973}, 277-286.
• 3: Blank, G. Responsive system control using register vector grammar. In Proceedings of the IEEE International Symposium on Intelligent Control (Philadelphia, Penn., Jan. ~9-20, 1987), pp. 461-466.
• 4: Blank, G. Register vector grammar: A new kind of finite state automaton. In Proceedings of the Ninth International Conference on Artificial Intelligence (UCLA, Aug. 18-23, 1985), pp. 749--756.
• 5: Bresnan, J., Kaplan, R., Peters, S., and Zaenan, A. Cross-serial dependencies in Dutch. Linguistic Inquiry I3, 4 (1982!, 613-635.
• 6: Carrithers, C., and Bever, T. Eye-fixation patterns during reading confirm theories of language comprehension. Cog. Sci. 8, 2 {1984}, 157-172.
• 7: Chomsky, N. Syntactic structures. Mouton, The Hague, Netherlands, 1957.
• 8: Church, K. On memory limitations in natural language processing. IU Linguistics Club, Bloomington, Ind., 1982.
• 9: Cowper, E. Constraints on sentence complexity: A model for syntactic processing. Ph.D. dissertation, Brown University, 1976.
• 10: Jay Earley, An efficient context-free parsing algorithm, Communications of the ACM, v.13 n.2, p.94-102, Feb 1970 [doi>10.1145/362007.362035]
• 11: Frazier, L., and Fodor, J. The sausage machine: A new two-stage parsing model. Cognition 6, 4 (1978), 291-295.
• 12: Garrett, M., and Bever, T. The perceptual segmen'Iation of sentences. In The Structure and Psychology of Language, T. Bever and W. Weksel, Eds. Holt, Rinehart & Winston, New York, 1970.
• 13: Gazdar, G., Klein, E., Pullum, G., and Sag, I. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Mass., 1985.
• 14: Hale, K. On the position of Walpiri in a typology of the base. Indiana University Linguistics Club, Bloomington, Ind., 1981.
• 15: Kimball, J. Seven principles of surface structure parsing in natural language. Cognition 2, 1 (1973), 15-47.
• 16: Kunst, A. Petri net automata and the representation of natural languages. Unpublished MS.
• 17: Kunst, A., and Blank, G. Processing morphology: Words and cliches. In Computing in the Humanities, R.W. Bailey, Ed. North-Holland, The Hague {1982}, 123-131.
• 18: Langendoen, D. Finite-state parsing of phrase-structure languages and the status of readjustment rules in grammar. Linguistic Inquiry 6, 4 (1975), 533-554.
• 19: D. Terence Langendoen , Yedidyah Langsam, The representation of constituent structures for finite-state parsing, Proceedings of the 22nd annual meeting on Association for Computational Linguistics, p.24-27, July 02-06, 1984, Stanford, California
• 20: Mitchell P. Marcus, Theory of Syntactic Recognition for Natural Languages, MIT Press, Cambridge, MA, 1980
• 21: William A. Martin , Kenneth W. Church , Ramesh S. Patil, Preliminary analysis of a breadth-first parsing algorithm: theoretical and experimental results, Natural language parsing systems, Springer-Verlag, London, 1987
• 22: Miller, G., and Chomsky, N. Finitary models of language users. In Handbook of Mathematical Psychology, R. D. Luce et el., Eds. Wiley, New York, 1963.
• 23: Robert Milne, Resolving lexical ambiguity in a deterministic parser, Computational Linguistics, v.12 n.1, p.1-12, January-March 1986
• 24: Pullum, G, Syntactic and semantic parsability. In Proceedings of COLING84 (Stanford University, July 1984), pp. 112-122.
• 25: Reed, J. An efficient context-free parsing algorithm based on Register Vector Grammars. In Proceedings of the Third Annual IEEE Conference on Expert Systems in Government. (1987), pp. 34-40.
• 26: Reed, I. Compiling phrase structure rules into Register Vector Grammar. In Proceedings of the Fifth Annual IEEE Conference on AI Systems in Government. (1989).
• 27: Reich, P. The finiteness of natural language. Language 45, 4 (1969), 831-43.
• 28: Ross, I. Constraints on Variables in Syntax. Ph.D. dissertation, MIT, Cambridge, Mass., 1967.
• 29: Schegloff, E. The relevance of repair to syntax-for-conversation. In Syntax and Semantics, 12: Discourse and Syntax, Academic Press, New York, 1979, pp. 261-288.
• 30: Shieber, S. Direct parsing of ID/LP grammars. Ling. Phil. 7 {1984), 135-54.
• 31: Seidenberg, M., Tanenhaus, M. Leiman, Jr., and Bienkowski, M. Automatic access of the meaning of ambiguous words in context: Some limitations of knowledge-based processing. Cog. Psy. 14, 4 (1982), 489-537.
• 32: Masaru Tomita, Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems, Kluwer Academic Publishers, Norwell, MA, 1985
• 33: Wanner, E. The ATN and the sausage machine: Which one is baloney? Cog. 8 (1980), 209-225.
• 34: W. A. Woods, Transition network grammars for natural language analysis, Communications of the ACM, v.13 n.10, p.591-606, Oct. 1970 [doi>10.1145/355598.362773]
• 35: Yngve, V. A model and an hypothesis for language structure. In Proceedings of the American Philosophical Society 104 (1960), 444-466.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.1 MODELS AND PRINCIPLES

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.2 Design Tools and Techniques
          Subjects: User interfaces

  H. Information Systems
  H.4 INFORMATION SYSTEMS APPLICATIONS
      H.4.1 Office Automation

          Nouns: Lotus 1-2-3

General Terms:
Design, Experimentation, Human Factors, Performance