Unification grammars and off-line parsability

Efrat Jaeger; Nissim Francez; Shuly Wintner

doi:10.1007/s10849-005-4511-1

Unification grammars and off-line parsability

Efrat Jaeger, Nissim Francez, Shuly Wintner

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	199-234
Number of pages	36
Journal	Journal of Logic, Language and Information
Volume	14
Issue number	2
DOIs	https://doi.org/10.1007/s10849-005-4511-1
State	Published - Mar 2005

Bibliographical note

Funding Information:
The work of Nissim Francez was partially funded by the Vice-President’s fund for the promotion of research at the Technion. The work of Shuly Wintner was supported by the Israeli Science Foundation (grant no. 136/01).

Keywords

Off-line parsability
Parsing termination
Unification grammars

ASJC Scopus subject areas

Computer Science (miscellaneous)
Philosophy
Linguistics and Language

Access to Document

10.1007/s10849-005-4511-1

Cite this

@article{3deb7475cd524769afc56c5f1a24ac90,

title = "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",

author = "Efrat Jaeger and Nissim Francez and Shuly Wintner",

note = "Funding Information: The work of Nissim Francez was partially funded by the Vice-President{\textquoteright}s fund for the promotion of research at the Technion. The work of Shuly Wintner was supported by the Israeli Science Foundation (grant no. 136/01).",

year = "2005",

month = mar,

doi = "10.1007/s10849-005-4511-1",

language = "English",

volume = "14",

pages = "199--234",

journal = "Journal of Logic, Language and Information",

issn = "0925-8531",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Unification grammars and off-line parsability

AU - Jaeger, Efrat

AU - Francez, Nissim

AU - Wintner, Shuly

N1 - Funding Information: The work of Nissim Francez was partially funded by the Vice-President’s fund for the promotion of research at the Technion. The work of Shuly Wintner was supported by the Israeli Science Foundation (grant no. 136/01).

PY - 2005/3

Y1 - 2005/3

N2 - 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.

AB - 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.

KW - Off-line parsability

KW - Parsing termination

KW - Unification grammars

UR - http://www.scopus.com/inward/record.url?scp=18244405040&partnerID=8YFLogxK

U2 - 10.1007/s10849-005-4511-1

DO - 10.1007/s10849-005-4511-1

M3 - Article

AN - SCOPUS:18244405040

SN - 0925-8531

VL - 14

SP - 199

EP - 234

JO - Journal of Logic, Language and Information

JF - Journal of Logic, Language and Information

IS - 2

ER -

Unification grammars and off-line parsability

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this