Abstract
In this paper, we present and summarize the latest development of the Czech sentence parsing system synt. The presented system uses the meta-grammar formalism, which enables to define the grammar with a maintainable number of meta-rules. At the same time, these meta-rules are translated into rules for efficient and fast head driven chart parsing supplemented with evaluation of additional contextual constraints. The paper includes a comprehensive description of the meta-grammar constructs as well as actual running times of the system tested on corpus data.
This work has been partly supported by Czech Science Foundation under the project 201/05/2781 and by Grant Agency of the Academy of Sciences of CR under the project 1ET400300414.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bod, R.: An efficient implementation of a new dop model. In: EACL 2003, pp. 19–26 (2003)
Collins, M., Duffy, N.: New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In: ACL 2002, pp. 263–270 (2002)
van den Bosch, A., Buchholz, S.: Shallow parsing on the basis of words only: A case study. In: ACL 2002, pp. 433–440 (2002)
Horák, A.: The Normal Translation Algorithm in Transparent Intensional Logic for Czech. PhD thesis, Faculty of Informatics, Masaryk University, Brno (2002)
Smrž, P., Horák, A.: Large scale parsing of Czech. In: Proceedings of Efficiency in Large- Scale Parsing SystemsWorkshop, COLING 2000, Saarbrucken: Universitaet des Saarlandes, pp. 43–50 (2000)
Earley, J.: An efficient context-free parsing algorithm. In: Communications of the ACM, vol. 13, pp. 94–102 (1970)
Kay, M.: Algorithm schemata and data structures in syntactic processing. In: Report CSL- 80-12, Palo Alto, California, Xerox PARC (1989)
Tomita, M.: Efficient Parsing for Natural Languages: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Boston (1986)
Horák, A., Hlaváèková, D.: Transformation of wordnet czech valency frames into augmented vallex-1.0 format. In: Proceedings of LTC 2005, Poznan, Poland (2005) (accepted for publication)
Barton, G.E., Berwick, R.C., Ristad, E.S.: Computational complexity and natural language. MIT Press, Cambridge (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horák, A., Kadlec, V. (2005). New Meta-grammar Constructs in Czech Language Parser synt . In: Matoušek, V., Mautner, P., Pavelka, T. (eds) Text, Speech and Dialogue. TSD 2005. Lecture Notes in Computer Science(), vol 3658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551874_11
Download citation
DOI: https://doi.org/10.1007/11551874_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28789-6
Online ISBN: 978-3-540-31817-0
eBook Packages: Computer ScienceComputer Science (R0)