Detail výsledku
Incremental Parser for Czech
Kadlec Vladimír
The paper deals with an efficient implementation of incremental
bottom-up chart parser for Czech. We shortly introduce the system based on a
metagrammar that generates a context-free backbone supplemented by contextual
constraints. The main part of the paper focuses on the way the pruning
constraints are evaluated in the incremental parsing mode. The algorithm takes
advantage of a special form of feature structures employed in our grammar,
namely the limited number of values that can be produced for each type of the
constraints. Instead of pruning the original packed share forest, the parser
builds a new forest of values resulting from the evaluation. The described
method enables efficient parsing even for extremely ambiguous grammars typical
for free word order languages.
parsing
@inproceedings{BUT21443,
author="Pavel {Smrž} and Vladimír {Kadlec}",
title="Incremental Parser for Czech",
booktitle="4th International Symposium on Information and Communication Technologies (WISICT05)",
year="2005",
pages="117--122",
publisher="Association for Computing Machinery",
address="Cape Town",
isbn="0-9544145-6"
}