Artificial intelligence
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Regular look-ahead and look-back for lr parsers
Regular look-ahead and look-back for lr parsers
Context-freeness and the computer processing of human languages
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
Simultaneous-distributive coordination and context-freeness
Computational Linguistics
A finite and real-time processor for natural language
Communications of the ACM
On two recent attempts to show that English is not a CFL
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Strong generative capacity, weak generative capacity, and modern linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Copying in natural languages, context-freeness, and Queue Grammars
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Synchronous tags and French pronominal clitics
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A new kind of finite-state automaton: register vector grammar
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Weighted interaction of syntax and semantics in natural language analysis
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.02 |
This paper surveys some issues that arise in the study of the syntax and semantics of natural languages (NL's) and have potential relevance to the automatic recognition, parsing, and translation of NL's. An attempt is made to take into account the fact that parsing is scarcely ever thought about with reference to syntax alone; semantic ulterior motives always underly the assignment of a syntactic structure to a sentence. First I consider the state of the art with respect to arguments about the language-theoretic complexity of NL's: whether NL's are regular sets, deterministic CFL's, CFL's, or whatever. While English still appears to be a CFL as far as I can tell, new arguments (some not yet published) appear to show for the first time that some languages are not CFL's. Next I consider the question of how semantic filtering affects the power of grammars. Then I turn to a brief consideration of some syntactic proposals that employ more or less modest extensions of the power of context-free grammars.