PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
An efficient implementation of the head-corner parser
Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd 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
Left-corner parsing and psychological plausibility
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Removing left recursion from context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Finite-state multimodal parsing and understanding
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Finite-state multimodal integration and understanding
Natural Language Engineering
Practical issues in compiling typed unification grammars for speech recognition
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Compounding and derivational morphology in a finite-state setting
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
Highly constrained unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Elements of a spoken language programming interface for robots
Proceedings of the ACM/IEEE international conference on Human-robot interaction
Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime
Proceedings of the first ACM SIGPLAN symposium on Haskell
Positive effects of redundant descriptions in an interactive semantic speech interface
Proceedings of the 14th international conference on Intelligent user interfaces
A unified syntactic model for parsing fluent and disfluent speech
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
A syntactic time-series model for parsing fluent and disfluent speech
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Toward a psycholinguistically-motivated model of language processing
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Positive results for parsing with a bounded stack using a model-based right-corner transform
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Word buffering models for improved speech repair parsing
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
Broad-coverage parsing using human-like memory constraints
Computational Linguistics
Typed Transformations of Typed Grammars: The Left Corner Transform
Electronic Notes in Theoretical Computer Science (ENTCS)
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Regular approximation of link grammar
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
| Hi-index | 0.00 |
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of grammar transforms, and is exact for left-linear and right-linear CFGs, and for trees up to a user-specified depth of center-embedding.