Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Implementation of Efficient and Portable Parser for Czech
TSD '99 Proceedings of the Second International Workshop on Text, Speech and Dialogue
The interface between phrasal and functional constraints
Computational Linguistics
An efficient implementation of the head-corner parser
Computational Linguistics
Enhancing Best Analysis Selection and Parser Comparison
TSD '02 Proceedings of the 5th International Conference on Text, Speech and Dialogue
WISICT '05 Proceedings of the 4th international symposium on Information and communication technologies
Best analysis selection in inflectional languages
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Integrating natural language processing into e-learning: a case of Czech
eLearn '04 Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning
How many dots are really needed for head-driven chart parsing?
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
New meta-grammar constructs in czech language parser synt
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
| Hi-index | 0.00 |
Syntactical analysis of free word order languages poses a big challenge for natural language parsing. In this paper, we describe our approach to feature agreement fulfilment that uses an automatically expanded grammar. We display the insides of the implemented system with its three consecutively produced phases --- the core meta-grammar, a generated grammar and an expanded grammar. We present a comparison of parsing with those grammar forms in terms of the parser running time and the number of resulting edges in the chart, and show the need of a shared bank of testing grammars for general parser evaluation.