An efficient context-free parsing algorithm
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
Computational Complexity and Natural Language
Computational Complexity and Natural Language
An efficient implementation of a new DOP model
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Shallow parsing on the basis of words only: a case study
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
New Methods for Pruning and Ordering of Syntax Parsing Trees
TSD '08 Proceedings of the 11th international conference on Text, Speech and Dialogue
Mining Phrases from Syntactic Analysis
TSD '09 Proceedings of the 12th International Conference on Text, Speech and Dialogue
Dependency and phrasal parsers of the Czech language: a comparison
TSD'07 Proceedings of the 10th international conference on Text, speech and dialogue
Effective parsing using competing CFG rules
TSD'11 Proceedings of the 14th international conference on Text, speech and dialogue
Time dimension in the dolphin nick knowledge base using transparent intensional logic
TSD'11 Proceedings of the 14th international conference on Text, speech and dialogue
Exploitation of the verbalex verb valency lexicon in the syntactic analysis of czech
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
Enhancing czech parsing with verb valency frames
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
| Hi-index | 0.02 |
In this paper, we present and summarize the latest development of the Czech sentence parsing system synt. The presented system uses the meta-grammar formalism, which enables to define the grammar with a maintainable number of meta-rules. At the same time, these meta-rules are translated into rules for efficient and fast head driven chart parsing supplemented with evaluation of additional contextual constraints. The paper includes a comprehensive description of the meta-grammar constructs as well as actual running times of the system tested on corpus data.