Incremental parser for Czech
Pages 117 - 122
Abstract
The presented 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.
References
[1]
{AU72} A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation and Compiling, volume I: Parsing. Prentice-Hall, Englewood Cliffs, N.J., 1972.]]
[2]
{BBR87} G. E. Barton, R. C. Berwick, and E. S. Ristad. Computational complexity and natural language. MIT Press, Cambridge, Massachusetts, 1987.]]
[3]
{Bre85} J. Bresnan. The mental representation of gramatical relations. MIT Press, Cam-bridge, Massachusetts, 1985.]]
[4]
{CSH02} Robert Corbett, Richard Stallman, and Wilfred Hansen. Bison parser generator, user manual, version 1.35, 2002. (http://www.gnu.org/software/bison/bison.html).]]
[5]
{Ear70} J. Earley. An efficient context-free parsing algorithm. In Communications of the ACM, volume 13, pages 94--102, 1970.]]
[6]
{GKPS85} G Gazdar, E. Klein, G. Pullum, and I. Sag. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Massachusetts, 1985.]]
[7]
{HKS02} A. Horák, V. Kadlec, and P. Smrž. Enhancing best analysis selection and parser comparison. In Text, Speech and Dialogue: Proceedings of the 5th International Workshop TSD 2002, Brno, Czech Republic, 2002. Springer Verlag, Lecture Notes in Artificial Intelligence, Volume 2448.]]
[8]
{Kas65} T. Kasami. An efficient recognition and syntax analysis algorithm for context-free languages. In Technical report AF CRL-65-758, Bedford, Massachusetts, 1965. Air Force Cambridge Research Laboratory.]]
[9]
{Kay89a} M. Kay. Algorithm schemata and data structures in syntactic processing. In Report CSL-80-12, Palo Alto, California, 1989. Xerox PARC.]]
[10]
{Kay89b} M. Kay. Head driven parsing. In Proceedings of International Workshop on Parsing Technologies, Pittsburg, 1989.]]
[11]
{Mea83} Y. Matsumoto and et al. Bup: A bottom-up parser embedded in prolog. In New Generation Computating, volume 1, pages 145--158, 1983.]]
[12]
{SH99} P. Smrž and A. Horák. Implementation of efficient and portable parser for Czech. In Text, Speech and Dialogue: Proceedings of the Second International Workshop TSD'1999, Pilsen, Czech Republic, 1999. Springer Verlag, Lecture Notes in Computer Science, Volume 1692.]]
[13]
{SH00} P. Smrž and A. Horák. Large scale parsing of Czech. In Proceedings of Efficiency in Large-Scale Parsing Systems Workshop, COLING'2000, pages 43--50, Saarbrucken: Universitaet des Saarlandes, 2000.]]
[14]
{SodA93} K. Sikkel and R. op den Akker. Predictive head-corner parsing. In Proceedings of IWPT'1993, pages 267--276, Tilburg/Durbuy, 1993.]]
[15]
{SS89} G. Satta and O. Stock. Head-driven bidirectional parsing: A tabular method. In Proceedings of IWPT'1989, pages 43--51, Pitsburg, 1989.]]
[16]
{Tom86} M. Tomita. Efficient Parsing for Natural Languages: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Boston, MA, 1986.]]
[17]
{You67} D. H. Younger. Recognition of context-free languages in time n3. Inf. Control, 10(2):189--208, 1967.]]
Index Terms
- Incremental parser for Czech
Index terms have been assigned to the content through auto-classification.
Recommendations
A statistical parser for Czech
ACL '99: Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational LinguisticsThis paper considers statistical parsing of Czech, which differs radically from English in at least two respects: (1) it is a <i>highly inflected</i> language, and (2) it has relatively <i>free word order</i>. These differences are likely to pose new ...
Incremental parser generation for Tree Adjoining Grammars
ACL '96: Proceedings of the 34th annual meeting on Association for Computational LinguisticsThis paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy ...
Incremental parsing without a parser
This article describes an algorithm for incremental parsing of expressions in the context of syntax-directed editors for programming languages. Since a syntax-directed editor represents programs as trees and statements and expressions as nodes in trees, ...
Comments
Information & Contributors
Information
Published In
Publisher
Trinity College Dublin
Publication History
Published: 03 January 2005
Check for updates
Qualifiers
- Article
Conference
WISICT '05
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 71Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in