Unification grammars and off-line parsability

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.
Keywords off-line parsability  parsing termination  unification grammars
Categories (categorize this paper)
DOI 10.1007/s10849-005-4511-1
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,178
Through your library
References found in this work BETA
Off-Line Parsability and the Well-Foundedness of Subsumption.Shuly Wintner & Nissim Francez - 1999 - Journal of Logic, Language and Information 8 (1):1-16.

Add more references

Citations of this work BETA
Highly Constrained Unification Grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Polyadic Dynamic Logics for Hpsg Parsing.Anders Søgaard & Martin Lange - 2009 - Journal of Logic, Language and Information 18 (2):159-198.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

22 ( #226,091 of 2,163,682 )

Recent downloads (6 months)

1 ( #348,043 of 2,163,682 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums