IBM Journal of Research and Development
A finite and real-time processor for natural language
Communications of the ACM
Impact of a restricted natural language interface on ease of learning and productivity
Communications of the ACM
Parsing with flexibility, dynamic strategies, and idioms in mind
Computational Linguistics
A parsing algorithm for unification grammar
Computational Linguistics
Languages generated by two-level morphological rules
Computational Linguistics
Systemic classification and its efficiency
Computational Linguistics
Modularity and information content classes in principle-based parsing
Computational Linguistics
Generating referring expressions: boolean extensions of the incremental algorithm
Computational Linguistics
Context in the Study of Human Languages and Computer Programming Languages: A Comparison
CONTEXT '01 Proceedings of the Third International and Interdisciplinary Conference on Modeling and Using Context
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
The interface between phrasal and functional constraints
Computational Linguistics
Computing with features as formulae
Computational Linguistics
Computational Linguistics - Special issue on word sense disambiguation
Optimality theory and the generative complexity of constraint violability
Computational Linguistics
Finite state morphology and information retrieval
Natural Language Engineering
On the generative power of two-level morphological rules
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A fast partial parse of natural language sentences using a connectionist method
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Computational Linguistics
Machine translation with a stochastic grammatical channel
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the succinctness properties of unordered context-free grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Revised generalized phrase structure grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Parsing free word order languages in the Paninian framework
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Principle-based parsing without overgeneration
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A polynomial-time algorithm for statistical machine translation
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Partial descriptions and systemic grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Linear encodings of linguistic analyses
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Complexity, Two-Level Morphology and Finnish
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Island parsing and bidirectional charts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A freely available wide coverage morphological analyzer for English
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Uniform recognition for acyclic context-sensitive grammars is NP-complete
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
A freely available wide coverage morphological analyzer for English
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Computational complexity of probabilistic disambiguation by means of tree-grammars
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Bottom-Up Filtering: a parsing strategy for GPSG
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
WISICT '05 Proceedings of the 4th international symposium on Information and communication technologies
Generation as dependency parsing
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A measure of semantic complexity for natural language systems
NAACL-ANLP-SSCNLPS '00 Proceedings of the 2000 NAACL-ANLP Workshop on Syntactic and semantic complexity in natural language processing systems - Volume 1
Artificial Intelligence
Highly Constrained Unification Grammars
Journal of Logic, Language and Information
Control strategies for parsing with freer word-order languages
CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
A measure of semantic complexity for natural language systems
NLPComplexity '00 NAACL-ANLP 2000 Workshop: Syntactic and Semantic Complexity in Natural Language Processing Systems
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
On the complexity of alignment problems in two synchronous grammar formalisms
SSST '09 Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation
Computational linguistics and generative linguistics: the triumph of hope over experience
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
Getting serious about parsing plans: a grammatical analysis of plan recognition
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
An on-line computational model of human sentence interpretation
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Semantic evaluation as constraint network consistency
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars
Machine Translation
Linguistic estimation of topic difficulty in cross-language image retrieval
CLEF'05 Proceedings of the 6th international conference on Cross-Language Evalution Forum: accessing Multilingual Information Repositories
New meta-grammar constructs in czech language parser synt
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
Journal of Logic, Language and Information
Journal of Logic, Language and Information
| Hi-index | 0.03 |
From the Publisher:Computational Complexity and Natural Language heralds an entirely new way of looking at grammatical systems. It applies the recently developed computer science tool of complexity theory to the study of natural language. A unified and coherent account emerges of how complexity theory can probe the information-processing structure of grammars, discovering why a grammar is easy or difficult to process and suggesting where to look for additional grammatical constraints. For the linguist or cognitive scientist, the book presents a nontechnical introduction to complexity theory and discusses its strengths, its weaknesses, and how it can be used to study grammars. For the computer scientist, it offers a more sophisticated and efficient computational analysis of linguistic theories. Given the variety of new techniques rising from complexity theory, the authors foresee a developing cooperation among linguists, cognitive scientists, and computer scientists toward understanding the nature of human language. The book also describes a set of case studies that use complexity theory to analyze grammatical problems. And it examines several grammatical systems currently of interest to computational linguists - including spelling-change/dictionary lookup and morphological analysis, agreement processes in natural language, and lexical-functional grammar - demonstrating how complexity analysis can illuminate and improve each one. All of the authors are at the MIT Artificial Intelligence Laboratory. Robert C. Berwick is an Associate Professor in the Department of Electrical Engineering and Computer Science. A Bradford Book.