Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
SMRŽ, P., KADLEC, V.
Originální název
Incremental Parser for Czech
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
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.
Klíčová slova
parsing
Autoři
Vydáno
10. 2. 2005
Nakladatel
Association for Computing Machinery
Místo
Cape Town
ISBN
0-9544145-6
Kniha
4th International Symposium on Information and Communication Technologies (WISICT05)
Strany od
117
Strany do
122
Strany počet
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" }