Foundations and applications of Montague grammar: 8M part 1: philosophy, framework, computer science
Foundations and applications of Montague grammar: 8M part 1: philosophy, framework, computer science
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
DIAGRAM: a grammar for dialogues
Communications of the ACM
Syntax and semantics in parsing: an application to montague grammar.
Syntax and semantics in parsing: an application to montague grammar.
Toward a computational theory of pragmatics--discourse, presupposition, and implicature
Toward a computational theory of pragmatics--discourse, presupposition, and implicature
Phrase structure trees bear more fruit than you would have thought
Computational Linguistics
From English to logic: context-free computation of "conventional" logical translation
Computational Linguistics
An application of montague grammar to English-Japanese machine translation
ANLC '83 Proceedings of the first conference on Applied natural language processing
Translating English into logical form
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Context-freeness and the computer processing of human languages
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Crossed serial dependencies: a low-power parseable extension to GPSG
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Formal constraints on metarules
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A framework for processing partially free word order
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Sentence disambiguation by a shift-reduce parsing technique
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Capturing linguistic generalizations with metarules in an annotated phrase-structure grammar
ACL '80 Proceedings of the 18th annual meeting on Association for Computational Linguistics
Chart parsing and rule schemata in PSG
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
A Lesniewskian version of Montague grammar
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
Machine translation based on logically isomorphic Montague grammars
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
An English-Japanese machine translation system based on formal semantics of natural language
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
An improved left-corner parsing algorithm
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
Report on the algorithmic language ALGOL 68
Report on the algorithmic language ALGOL 68
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Natural language information retrieval system using phrase structure grammar analysis for English
Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
Hi-index | 0.00 |
During most of the last two decades, computational linguists and AI researchers working on natural language have assumed that phrase structure grammars, despite their computational tractability, were unsatisfactory devices for expressing the syntax of natural languages, however, during the same period, they have come to realize that transformational grammars, whatever their linguistic merits, are computationally intractable as they stand. The assumption, unchallenged for many years, that PSG's were inadequate for natural languages is based on arguments originally advanced by transformational linguists in the late 1950''s and early 1960's. but recent work has shown that none of those arguments were valid. The present paper draws on that work to argue that (i) there is no reason, at the present time, to think that natural languages are not context-free languages, (ii) there are good reasons to think that the notations needed to capture significant syntactic generalizations will characterize phrase structure grammars or some minor generalization of them, and (iii) there are good reasons for believing that such grammars, and the monostratal representations they induce, provide the necessary basis for the semantic interpretation of natural languages. If these arguments are valid, then the prospects for a fruitful interaction between theoretical linguistics and AI are much brighter than they would otherwise be.