Finite-state approximations of grammars
HLT '90 Proceedings of the workshop on Speech and Natural Language
Linguistic computation with state space trajectories
Emergent neural computational architectures based on neuroscience
Linguistic Computation with State Space Trajectories
Emergent Neural Computational Architectures Based on Neuroscience - Towards Neuroscience-Inspired Computing
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
Localizing expression of ambiguity
ANLC '88 Proceedings of the second conference on Applied natural language processing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Simplifying deterministic parsing
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Dealing with conjunctions in a machine translation environment
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Control structures and theories of interaction in speech understanding systems
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Parsing conjunctions deterministically
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A finite-state parser for use in speech recognition
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A constraint-based approach to linguistic performance
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Two principles of parse preference
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
REXTOR: a system for generating relations from natural language
RANLPIR '00 Proceedings of the ACL-2000 workshop on Recent advances in natural language processing and information retrieval: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 11
Dependency propagation: a unified theory of sentence comprehension and generation
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper proposes a welcome hypothesis: a computationally simple device is sufficient for processing natural language. Traditionally it has been argued that processing natural language syntax requires very powerful machinery. Many engineers have come to this rather grim conclusion; almost all working parsers are actually Turing Machines (TM). For example, Woods specifically designed his Augmented Transition Networks (ATN''s) to be Turing Equivalent. If the problem is really as hard as it appears, then the only solution is to grin and bear it. Our own position is that parsing acceptable sentences is simpler because there are constraints on human performance that drastically reduce the computational requirements (time and space bounds). Although ideal linguistic competence is very complex, this observation may not apply directly to a real processing problem such as parsing. By including performance factors, it is possible to simplify the computation. We will propose two performance limitations, bounded memory and deterministic control, which have been incorporated in a new parser YAP.