Abstract
We investigate two related techniques, Quick Check and Generalised Reduction, that contribute significantly to speeding up parsing with large-scale typed-unification grammars. The techniques take advantage of the properties of two particular classes of feature paths. Quick check is concerned with paths that most often lead to unification failure, whereas generalised reduction takes advantage of paths that do not (or only seldom) contribute to unification failure. Both sets of paths are obtained empirically by parsing a training corpus. We experiment with the two techniques, using a compilation-based parsing system on a large-scale grammar of English. The combined improvement in parsing speed we obtained is 56%.
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.
References
Aït-Kaci, H. and Di Cosmo, R. (1993). Compiling order-sorted feature term unification. Technical report, Digital Paris Research Laboratory. PRL Technical Note 7, downloadable from http://www.isg.sfu.ca/life/.
Aït-Kaci, H. and Podelski, A. (1993). Towards a meaning of LIFE. Journal of Logic Programming, 16:195–234.
Aït-Kaci, H., Podelski, A., and Goldstein, S. (1997). Order-sorted feature theory unification. Journal of Logic, Language and Information, 30:99–124.
Callmeier, U. (2000). PET — a platform for experimentation with efficient HPSG processing techniques. Natural Language Engineering, 6 (1) (Special Issue on Efficient Processing with HPSG):99–108.
Carpenter, B. (1992). The Logic of Typed Feature Structures — with applications to unification grammars, logic programs and constraint resolution. Cambridge University Press.
Ciortuz, L. (2001 a). Compilation of head-corner bottom-up chart-based parsing with unification grammars. In Proceedings of the IWPT 2001 International Workshop on Parsing Technologies, pages 209–212, Beijing, China.
Ciortuz, L. (2001b). On compilation of the Quick-Check filter for feature structure unification. In Proceedings of the IWPT 2001 International Workshop on Parsing Technologies, pages 90–100, Beijing, China.
Ciortuz, L. (2002a). Learning attribute values in typed-unification grammars: On generalised rule reduction. In Proceedings of the 6th Conference on Natural Language Learning (CoNLL-2002), Taipei, Taiwan. Morgan Kaufmann Publishers and ACL.
Ciortuz, L. (2002b). LIGHT — a constraint language and compiler system for typed-unification grammars. In Proceedings of the 25th German Conference on Artificial Intelligence (KI-2002), Aachen, Germany. Springer-Verlag.
Ciortuz, L. (2002c). LIGHT — another abstract machine for feature structure unification. In Flickinger, D., Oepen, S., Tsujii, J., and Uszkoreit, H., editors, Collaborative Language Engineering. CSLI Publications, The Center for studies of Language, Logic and Information, Stanford University.
Ciortuz, L. (2002d). Towards inductive learning of typed-unification grammars. In Proceedings of the 17th Workshop on Logic Programming. Dresden Technical University.
Flickinger, D. P., Copestake, A., and Sag, I. A. (2000). HPSG analysis of English. In Wahlster, W., editor, Verbmobil: Foundations of Speech-to-Speech Translation, Artificial Intelligence, pages 254–263. Springer-Verlag, Berlin Heidelberg New York.
Gerdemann, D. (1995). Term encoding of typed feature structures. In Proceedings of the 4th International Workshop on Parsing Technologies, pages 89–97, Prague, Czech Republik.
Kaplan, R. M. and Bresnan, J. (1983). Lexical-functional grammar: A formal system for grammatical representation. In Bresnan, J., editor, The Mental Representation of Grammatical Relations, pages 173–381. MIT Press.
Kay, M. (1989). Head driven parsing. In Proceedings of the 1st Workshop on Parsing Technologies, pages 52–62, Pittsburg.
Kiefer, B., Krieger, H.-U., Carroll, J., and Malouf, R. (1999). A bag of useful techniques for efficient and robust parsing. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 473–480.
Krieger, H.-U. and Schäfer, U. (1994). TDL — A Type Description Language for HPSG. Research Report RR-94-37, German Research Center for Artificial Intelligence (DFKI).
Malouf, R., Carroll, J., and Copestake, A. (2000). Efficient feature structure operations without compilation. Natural Language Engineering, 6 (1) (Special Issue on Efficient Processing with HPSG):29–46.
Maxwell III, J. and Kaplan, R. (1993). The interface between phrasal and functional constraints. Computational Linguistics, 19, Number 4:571–590.
Mitsuishi, Y., Torisawa, K., and Tsujii, J. (1998). HPSG-Style Underspecified Japanese Grammar with Wide Coverage. In Proceedings of the 17th International Conference on Computational Linguistics (COLING), pages 867–880.
Miyao, Y., Makino, T., Torisawa, K., and Tsujii, J. (2000). The LiLFeS abstract machine and its evaluation with the LinGO grammar. Natural Language Engineering, 6 (1) (Special Issue on Efficient Processing with HPSG):47–61.
Muggleton, S. and Raedt, L. D. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19,20:629–679.
Müller, S. (1999). Deutsche Syntax deklarativ. Head-Driven Phrase Structure Grammar für das Deutsche. Number 394 in Linguistische Arbeiten. Max Niemeyer Verlag, Tübingen.
Nagata, M. (1992). An empirical study on rule granularity and unification interleaving: toward an efficient unification-based parsing system. In Proceedings of COLING-92, pages 177–183.
Ninomiya, T., Makino, T., and Tsujii, J. (2002). An indexing scheme for typed feature structures. In Proceedings of the 19th International Conference on Computational Linguistics: COLING-2002.
Oepen, S. and Callmeier, U. (2000). Measure for measure: Parser cross-fertilization. Towards increased component comparability and exchange. In Proceedings of the International Workshop on Parsing Technologies IWPT-2000, pages 183–194, Trento, Italy.
Oepen, S. and Carroll, J. (2000). Performance profiling for parser engineering. Natural Language Engineering, 6 (1) (Special Issue on Efficient Processing with HPSG: Methods, Systems, Evaluation):81–97.
Pereira, F. (1985). A structure-sharing representation for unification-based grammar formalisms. In Proceedings of the 23rd meeting of the Association for Computational Linguistics, pages 137–144, Chicago, Illinois.
Pollard, C. and Sag, I. (1994). Head-driven Phrase Structure Grammar. CSLI Publications, Stanford.
Shieber, S. (1985). Using restriction to extend parsing algorithms for complex feature-based formalisms. In Proceedings of the 23rd Annual Meeting of the ACL, pages 145–152, Chicago, Illinois.
Shieber, S. M., Uszkoreit, H., Pereira, F. C., Robinson, J., and Tyson, M. (1983). The formalism and implementation of PATR-II. In Bresnan, J., editor, Research on Interactive Acquisition and Use of Knowledge. SRI International, Menlo Park, Calif.
Siegel, M. (2000). HPSG analysis of Japanese. In Verbmobil: Foundations of Speech-to-Speech Translation, pages 264–279. Springer Verlag.
Sikkel, N. (1997). Parsing Schemata. Springer Verlag.
Tomabechi, H. (1992). Quasi-destructive graph unification with structure sharing. In Proceedings of COLING-92, pages 440–446, Nantes, France.
Uszkoreit, H. (1986). Categorial Unification Grammar. In International Conference on Computational Linguistics (COLING’92), pages 498–504, Nancy, France.
Wintner, S. and Francez, N. (1999). Efficient implementation of unification-based grammars. Journal of Language and Computation, 1(1):53–92.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Ciortuz, L. (2004). On Two Classes of Feature Paths in Large-Scale Unification Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds) New Developments in Parsing Technology. Text, Speech and Language Technology, vol 23. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2295-6_10
Download citation
DOI: https://doi.org/10.1007/1-4020-2295-6_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2293-7
Online ISBN: 978-1-4020-2295-1
eBook Packages: Humanities, Social Sciences and Law