Přístupnostní navigace
E-application
Search Search Close
Publication detail
SMRŽ, P., KADLEC, V.
Original Title
Incremental Parser for Czech
Type
conference paper
Language
English
Original Abstract
The paper deals with an efficient implementation of incrementalbottom-up chart parser for Czech. We shortly introduce the system based on ametagrammar that generates a context-free backbone supplemented by contextualconstraints. The main part of the paper focuses on the way the pruningconstraints are evaluated in the incremental parsing mode. The algorithm takesadvantage 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 theconstraints. Instead of pruning the original packed share forest, the parserbuilds a new forest of values resulting from the evaluation. The describedmethod enables efficient parsing even for extremely ambiguous grammars typicalfor free word order languages.
Keywords
parsing
Authors
Released
10. 2. 2005
Publisher
Association for Computing Machinery
Location
Cape Town
ISBN
0-9544145-6
Book
4th International Symposium on Information and Communication Technologies (WISICT05)
Pages from
117
Pages to
122
Pages count
6
BibTex
@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" }