Abstract
We present an algorithm for approximating context-free languages with regular languages. The algorithm is based on a simple transformation that applies to any context-free grammar and guarantees that the result can be compiled into a finite automaton. The resulting grammar contains at most one new nonterminal for any nonterminal symbol of the input grammar. The result thus remains readable and if necessary modifiable. We extend the approximation algorithm to the case of weighted context-free grammars. We also report experiments with several grammars showing that the size of the minimal deterministic automata accepting the resulting approximations is of practical use for applications such as speech recognition.
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
Aho, A. V. & Ullman, J. D. (1973). The Theory of Parsing, Translation and Compiling,Prentice-Hall.
Carroll, J. A. (1993). Practical unification-based parsing of natural language, Technical Report No. 314, University of Cambridge, Computer Laboratory, England. PhD thesis.
Chomsky, N. (1959). On certain formal properties of grammars, Information and Control 2: 137–167.
Grimley Evans, E. (1997). Approximating context-free grammars with a finite-state calculus, 35th Annual Meeting of the ACL, pp. 452–459.
Hoperoft, J. E. & Ullman, J. D. (1979). Introduction to Automata Theory, Languages, and Computation,Addison-Wesley.
Johnson, M. (1998). Finite-state approximation of constraint-based grammars using left-corner grammar transforms, 36th Annual Meeting of the ACL and 17th International Conference on Computational Linguistics, Vol. 1, pp. 619–623.
Mohri, M. (2000). Weighted grammar tools: The GRM library, in J.-C. Junqua & G. van Noord (eds), Robustness in Language and Speech Technology, Kluwer Academic Publishers. This volume.
Mohri, M. & Pereira, E C. N. (1998). Dynamic compilation of weighted context-free grammars, 36th Annual Meeting of the ACL and 17th International Conference on Computational Linguistics, Vol. 2, pp. 891–897.
Nederhof, M.-J. (1997). Regular approximations of CFLs: A grammatical view, International Workshop on Parsing Technologies, Massachusetts Institute of Technology, pp. 159–170.
Nederhof, M.-J. (1998). Context-free parsing through regular approximation, Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, pp. 13–24.
Nederhof, M.-J. (2000). Practical experiments with regular approximation of context-free languages, Computational Linguistics 26 (1): 174.
Pereira, E C. N. & Wright, R. N. (1997). Finite-state approximation of phrase-structure grammars, in E. Roche & Y. Schabes (eds), Finite-State Language Processing, MIT Press, pp. 149–173.
Schoorl, J. J. & Belder, S. (1990). Computational linguistics at Delft: A status report, Report WTM/TT 90–09, Delft University of Technology, Applied Linguistics Unit.
Ullian, J. S. (1967). Partial algorithm problems for context free languages, Information and Control 11: 80–101.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Mohri, M., Nederhof, MJ. (2001). Regular Approximation of Context-Free Grammars through Transformation. In: Junqua, JC., van Noord, G. (eds) Robustness in Language and Speech Technology. Text, Speech and Language Technology, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9719-7_6
Download citation
DOI: https://doi.org/10.1007/978-94-015-9719-7_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5643-6
Online ISBN: 978-94-015-9719-7
eBook Packages: Springer Book Archive