Resolving lexical ambiguity in a deterministic parser
Computational Linguistics
Preliminary analysis of a breadth-first parsing algorithm: theoretical and experimental results
Natural language parsing systems
An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Computational Complexity and Natural Language
Computational Complexity and Natural Language
The representation of constituent structures for finite-state parsing
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Syntactic and semantic parsability
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Partial parsing via finite-state cascades
Natural Language Engineering
Finite-State Registered Automata for Non-Concatenative Morphology
Computational Linguistics
Left-corner unification-based natural language processing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Efficient heuristic natural language parsing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
| Hi-index | 48.22 |
People process natural language in real time and with very limited short-term memories. This article describes a computational architecture for syntactic performance that also requires fixed finite resources.