Abstract
Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w ∈ L(G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP), were suggested, such that the recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP and discuss their interrelations, proving that some of the OLP variants are indeed undecidable. We then present a novel, decidable OLP constraint which is more liberal than the existing decidable ones.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berwick, R. C., 1987, “Computational complexity, mathematical linguistics, and linguistic theory,” pp. 1–17 in Mathematics of Language, A. Manaster-Ramer, ed., Amsterdam/Philadelphia: John Benjamins.
Carpenter, Bob., 1992, The Logic of Typed Feature Structures, Cambridge Tracts in Theoretical Computer Science, Cambridge, U.K.: Cambridge University Press.
Chomsky, N., 1975, “Remarks on nominalization,” pp. 262–289 in D. Davidson and G.H. Harman, eds. The Logic of Grammar, Encino, CA: Dickenson Publishing Co.
Gazdar, G. and Pullum, G.K., 1985, “Computationally relevant properties of natural languages and their grammars,” New Generation Computing 3, 273–306.
Gazdar, G.E., Ewan, K., Pullum, J.K., and Sag, I.A., 1985, Generalized Phrase Structure Grammar, Cambridge, MA: Harvard University Press.
Haas, A., 1989, “A parsing algorithm for unification grammar,” Computational Linguistics 15, 219–232.
Hopcroft, J.E. and Ullman, J.D., 1979, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Series in Computer Science, Reading, MA: Addison-Wesley Publishing Company.
Jaeger, E., Francez, N., and Wintner, S., 2002, “Guaranteeing parsing termination of unification grammars,” pp. 397–403, in Proceedings of COLING’02.
Johnson, M., 1988, Attribute-Value Logic and the Theory of Grammar, CSLI Lecture Notes, Vol. 29, Stanford, CA: CSLI.
Kaplan, R. and Bresnan, J., 1982, “Lexical functional grammar: A formal system for grammatical representation,” pp. 173–281 in The Mental Representation of Grammatical Relations, J. Bresnan, ed., Cambridge, MA: MIT Press.
Kuhn, J., 1999, “Towards a simple architecture for the structure-function mapping,” in The Proceedings of the LFG ‘99 Conference, M. Butt and T.H. King, eds., Stanford: CSLI Publications.
Pereira, F.C.N. and Warren, D.H.D., 1983, “Parsing as deduction,” pp. 137–144, in Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics.
Shieber, S.M., 1992, Constraint-Based Grammar Formalisms, Cambridge, MA: MIT Press.
Torenvliet, L. and Trautwein, M., 1995, “A note on the complexity of restricted attribute-value grammars,” ILLC Research Report and Technical Notes Series CT-95-02, Amsterdam: University of Amsterdam.
Wintner, S. and Francez, N., 1999, “Off-line parsability and the well-foundedness of subsumption,” Journal of Logic, Language and Information 8, 1–16.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jaeger, E., Francez, N. & Wintner, S. Unification Grammars and Off-Line Parsability. J Logic Lang Inf 14, 199–234 (2005). https://doi.org/10.1007/s10849-005-4511-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10849-005-4511-1