Natural Language Based Information Management Systems

作者: Stanley R. Petrick

DOI: 10.1016/B978-0-12-404970-3.50019-7

关键词:

摘要: Publisher Summary The TQA System, formerly called the REQUEST is an experimental transformational-grammar-based English question-answering system suitable for interfacing with large relational data bases. parser started out fully general. Its principal early extension was to allow binary features on nonterminal and terminal nodes make transformations sensitive capable of altering those features. To deal full trees at each transformational step, a surface structure CF grammar derived constituent grammar, both potential slack, were used. Forward continued be written invoked, but style in writing not introduce slack inverse then eliminate that forward transformations, rather true inverses their counterparts. Building deep structures from top sentence embedding levels down reminiscent analysis, constitutes portion basis often made claim it possible perform analysis by means augmented transition network.

参考文章(37)
Daniel G. Bobrow, Bruce Eraser, An augmented state transition network analysis procedure international joint conference on artificial intelligence. pp. 557- 567 ,(1969)
Fred J. Damerau, Advantages of a transformational grammar for question answering international joint conference on artificial intelligence. pp. 192- 192 ,(1977)
Timothy V. Griffiths, Stanley R. Petrick, Top-down versus bottom-up analysis. ifip congress. pp. 437- 443 ,(1968)
Stanley Roy Petrick, A recognition procedure for transformational grammars. Massachusetts Institute of Technology. ,(1965)
Fred J. Damerau, Operating statistics for the transformational question answering system Computational Linguistics. ,vol. 7, pp. 30- 42 ,(1981) , 10.5555/972881.972884
Frederick B. Thompson, Bozena Henisz Thompson, Practical Natural Language Processing: The REL System as Prototype Advances in Computers. ,vol. 13, pp. 109- 168 ,(1975) , 10.1016/S0065-2458(08)60657-9
Donald E. Knuth, Semantics of context-free languages Theory of Computing Systems \/ Mathematical Systems Theory. ,vol. 2, pp. 127- 145 ,(1968) , 10.1007/BF01692511
Daniel H. Younger, Recognition and parsing of context-free languages in time n3* Information & Computation. ,vol. 10, pp. 189- 208 ,(1967) , 10.1016/S0019-9958(67)80007-X
Robert F. Simmons, John F. Burger, Robert M. Schwarcz, A computational model of verbal understanding national computer conference. pp. 441- 456 ,(1968) , 10.1145/1476589.1476652
T. V. Griffiths, S. R. Petrick, On the relative efficiencies of context-free grammar Communications of the ACM. ,vol. 8, pp. 289- 300 ,(1965) , 10.1145/364914.364943