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

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.

[1]  M. Garrett,et al.  The interaction of perceptual processes and ambiguous sentences , 1973, Memory & cognition.

[2]  Caroline Carrithers,et al.  Eye‐Fixation Patterns During Reading Confirm Theories of Language Comprehension , 1984 .

[3]  J. H. Reed.  Compiling phrase structure grammar rules into register vector grammar , 1989, [1989] Proceedings. The Annual AI Systems in Government Conference.

[4]  G. A. Miller,et al.  Finitary models of language users , 1963 .

[5]  Mitchell P. Marcus,et al.  A theory of syntactic recognition for natural language , 1979 .

[6]  William A. Woods,et al.  Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[7]  Stuart M. Shieber,et al.  Direct parsing of ID/LP grammars , 1984 .

[8]  Kenneth Ward Church,et al.  PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS , 1987 .

[9]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[10]  Linda J. Weldon,et al.  An Experimental Comparison of Natural and Structured Query Languages , 1983 .

[11]  Andrew Singer,et al.  The natural language of interactive systems , 1980, CACM.

[12]  Emanuel A. Schegloff,et al.  The Relevance of Repair to Syntax-for-Conversation in Discourse and Syntax. , 1979 .

[13]  Marie Bienkowski,et al.  Automatic access of the meanings of ambiguous words in context: Some limitations of knowledge-based processing , 1982, Cognitive Psychology.

[14]  Stanley Peters,et al.  Cross-Serial Dependencies in Dutch , 1982 .

[15]  Victor H. Yngve,et al.  A model and an hypothesis for language structure , 1960 .

[16]  Ben Shneiderman,et al.  Designing the User Interface: Strategies for Effective Human-Computer Interaction , 1998 .

[17]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[18]  E. Wanner.  The ATN and the sausage machine: Which one is baloney? , 1980, Cognition.

[19]  Robert Milne,et al.  Resolving Lexical Ambiguity in a Deterministic Parser , 1986, CL.

[20]  J. Kimball.  Seven principles of surface structure parsing in natural language , 1973 .

[21]  William C. Ogden,et al.  Query languages for the casual user: Exploring the middle ground between formal and natural languages , 1983, CHI '83.

[22]  Hauptmann Alexanderg.,et al.  A comparison of command, menu-selection and natural-language computer programs , 1983 .

[23]  Geoffrey K. Pullum,et al.  Syntactic and Semantic Parsability , 1984, ACL.

[24]  Robert C. Berwick,et al.  Computational complexity and natural language , 1987 .

[25]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[26]  Masaru Tomita,et al.  Efficient parsing for natural language , 1985 .

[27]  P. A. Reich.  The Finiteness of Natural Language , 1969 .

[28]  Michael J. Coombs,et al.  Designing for Human-Computer Communication , 1983 .

[29]  John Robert Ross,et al.  Constraints on variables in syntax , 1967 .

[30]  Elizabeth Cowper,et al.  Constraints on sentence complexity : a model for syntactic processing , 1976 .

[31]  Janet D. Fodor,et al.  The sausage machine: A new two-stage parsing model , 1978, Cognition.

[32]  K. W. Church.  On memory limitations in natural language processing , 1982 .

[33]  D. Terence Langendoen,et al.  The Representation Of Constituent Structures For Finite-State Parsing , 1984, COLING.