Publication Details

Incremental Parser for Czech

SMRŽ Pavel and KADLEC Vladimír. Incremental Parser for Czech. In: 4th International Symposium on Information and Communication Technologies (WISICT05). Cape Town: Association for Computing Machinery, 2005, pp. 117-122. ISBN 0-9544145-6.
Czech title
Incremental Parser for Czech
Type
conference paper
Language
english
Authors
Smrž Pavel, doc. RNDr., Ph.D. (DCGM FIT BUT)
Kadlec Vladimír, Mgr. (FI MUNI)
Keywords

parsing

Abstract

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.

Published
2005
Pages
117-122
Proceedings
4th International Symposium on Information and Communication Technologies (WISICT05)
Conference
International Symposium on Information and Communication Technologies, Cape Town, ZA
ISBN
0-9544145-6
Publisher
Association for Computing Machinery
Place
Cape Town, ZA
BibTeX
@INPROCEEDINGS{FITPUB7674,
   author = "Pavel Smr\v{z} and Vladim\'{i}r Kadlec",
   title = "Incremental Parser for Czech",
   pages = "117--122",
   booktitle = "4th International Symposium on Information and Communication Technologies (WISICT05)",
   year = 2005,
   location = "Cape Town, ZA",
   publisher = "Association for Computing Machinery",
   ISBN = "0-9544145-6",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7674"
}
Back to top