Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
The logic of typed feature structures
The logic of typed feature structures
Restriction and termination in parsing with feature-theoretic grammars
Computational Linguistics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for 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
DISCO: an HPSG-based NLP system and its application for appointment scheduling
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
An HPSG-to-CFG approximation of Japanese
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Practical issues in compiling typed unification grammars for speech recognition
ACL '01 Proceedings of the 39th Annual Meeting on Association for 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
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
Backbone extraction and pruning for speeding up a deep parser for dialogue systems
ScaNaLU '06 Proceedings of the Third Workshop on Scalable Natural Language Understanding
Large-scale corpus-driven PCFG approximation of an HPSG
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
We present a simple and intuitive approximation method for turning unification-based grammars into context-free grammars. We apply our method to several grammars and report on the quality of the approximation. We also present several methods that speed up the approximation process and that might be interesting to other areas of unification-based processing. Finally, we introduce a novel disambiguation method for unification grammars which is based on probabilistic context-free approximations.