Abstract
We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.
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
Baker, T. (1981). Extending lookahead for LR parsers. Journal of Computer and System Sciences, 22:243–259.
Bermudez, M. and Schimpf, K. (1990). Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230–250.
Chomsky, N. (1959a). A note on phrase structure grammars. Information and Control 2:393–395.
Chomsky, N. (1959b). On certain formal properties of grammars. Information and Control, 2:137–167.
Church, K. and Patil, R. (1982). Coping with syntactic ambiguity or how to put the block in the box on the table. American Journal of Computational Linguistics, 8:139–149.
Grimley Evans, E. (1997). Approximating context-free grammars with a finite-state calculus. In 35th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 452–459, Madrid, Spain.
Harrison, M. (1978). Introduction to Formal Language Theory. Reading, MA: Addison-Wesley.
Herz, J. and Rimon, M. (1991). Local syntactic constraints. In Proc. of the Second International Workshop on Parsing Technologies, pp. 200–209, Cancun, Mexico.
Hopcroft, J. and Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley.
Johnson, M. (1998). Finite-state approximation of constraint-based grammars using left-corner grammar transforms. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 1, pp. 619–623, Montreal, Quebec, Canada.
Krauwer, S. and des Tombe, L. (1981). Transducers and grammars as theories of language. Theoretical Linguistics, 8:173–202.
Langendoen, D. (1975). Finite-state parsing of phrase-structure languages and the status of readjustment rules in grammar. Linguistic Inquiry, 6(4):533–554.
Langendoen, D. and Langsam, Y. (1987). On the design of finite transducers for parsing phrase-structure languages. In Manaster-Ramer, A., ed., Mathematics of Language, pp 191–235. Amsterdam: Benjamins.
Meyer, A. and Fischer, M. (1971). Economy of description by automata, grammars, and formal systems. In IEEE Conference Record of the 12th Annual Symposium on Switching and Automata Theory, pp. 188–191.
Mohri, M. and Pereira, F. (1998). Dynamic compilation of weighted context-free grammars. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 2, pp. 891–897, Montreal, Quebec, Canada.
Nederhof, M.J. (1994a). Linguistic Parsing and Program Transformations. PhD thesis, University of Nijmegen.
Nederhof, M.-J. (1994b). An optimal tabular parsing algorithm. In 32nd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 117–124, Las Cruces, New Mexico, USA.
Nederhof, M.-J. (1998). Context-free parsing through regular approximation. In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pp. 13–24, Ankara, Turkey.
Nederhof, M.-J. (2000). Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1). In press.
Nederhof, M.-J. and Satta, G. (1996). Efficient tabular LR parsing. In 34th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 239–246, Santa Cruz, California, USA.
Pereira, F. and Wright, R. (1997). Finite-state approximation of phrase-structure grammars. In Roche, E. and Schabes, Y. (eds.), Finite-State Language Processing, pp. 149–173. MIT Press.
Pulman, S. (1986). Grammars, parsers, and memory limitations. Language and Cognitive Processes, 1(3): 197–225.
Rimon, M. and Herz, J. (1991). The recognition capacity of local syntactic constraints. In Fifth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pp 155–160, Berlin, Germany.
Rood, C. (1996). Efficient finite-state approximation of context free grammars. In Kornai, A., editor, Extended Finite State Models of Language, Proceedings of the ECAI’96 workshop, pp. 58–64, Budapest University of Economic Sciences.
Rosenkrantz, D. and Lewis II, P. (1970). Deterministic left corner parsing. In IEEE Conference Record of the 11th Annual Symposium on Switching and Automata Theory, pp. 139–152.
Sippu, S. and Soisalon-Soininen, E. (1990). Parsing Theory, Vol. II: LR(k) and LL(k) Parsing, volume 20 of EATCS Monographs on Theoretical Computer Science. Berlin: Springer.
Stearns, R. (1967). A regularity test for pushdown machines. Information and Control, 11:323–340.
Stolcke, A. and Segal, J. (1994). Precise iV-gram probabilities from stochastic context-free grammars. In 32nd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 74–79, Las Cruces, New Mexico, USA.
Ullian, J. (1967). Partial algorithm problems for context free languages. Information and Control, 11:80–101.
Valiant, L. (1975). Regularity and related problems for deterministic pushdown automata. Journal of the ACM, 22(1): 1–10.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nederhof, MJ. (2000). Regular Approximation of CFLS: A Grammatical View. In: Bunt, H., Nijholt, A. (eds) Advances in Probabilistic and Other Parsing Technologies. Text, Speech and Language Technology, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9470-7_12
Download citation
DOI: https://doi.org/10.1007/978-94-015-9470-7_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5579-8
Online ISBN: 978-94-015-9470-7
eBook Packages: Springer Book Archive