Memoization of coroutined constraints

Mark Johnson; Jochen Dörre

doi:10.3115/981658.981672

Memoization of coroutined constraints

Mark Johnson, Jochen Dörre

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

6 Citations (Scopus)

37 Downloads (Pure)

Abstract

Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our technique to Bouma and van Noord's (1994) categorial grammar analysis of Dutch is provided.

Original language	English
Title of host publication	Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics
Place of Publication	San Francisco
Publisher	Association for Computational Linguistics (ACL)
Pages	100-107
Number of pages	8
DOIs	https://doi.org/10.3115/981658.981672
Publication status	Published - 1995
Externally published	Yes
Event	Annual Meeting of the Association for Computational Linguistics (33rd : 1995) - Massachusetts Institute of Technology, Cambridge, United States Duration: 26 Jun 1995 → 30 Jun 1995

Conference

Conference	Annual Meeting of the Association for Computational Linguistics (33rd : 1995)
Country/Territory	United States
City	Cambridge
Period	26/06/95 → 30/06/95

Bibliographical note

Copyright the Publisher 1995. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Access to Document

10.3115/981658.981672

Publisher version (open access)Final published version, 680 KBLicence: CC BY-NC-SA

Cite this

@inproceedings{5d2c36731f7b41be893c7eca4483e0ac,

title = "Memoization of coroutined constraints",

abstract = "Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our technique to Bouma and van Noord's (1994) categorial grammar analysis of Dutch is provided.",

author = "Mark Johnson and Jochen D{\"o}rre",

note = "Copyright the Publisher 1995. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher. ; Annual Meeting of the Association for Computational Linguistics (33rd : 1995) ; Conference date: 26-06-1995 Through 30-06-1995",

year = "1995",

doi = "10.3115/981658.981672",

language = "English",

pages = "100--107",

booktitle = "Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics",

publisher = "Association for Computational Linguistics (ACL)",

}

Johnson, M & Dörre, J 1995, Memoization of coroutined constraints. in Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics (ACL), San Francisco, pp. 100-107, Annual Meeting of the Association for Computational Linguistics (33rd : 1995), Cambridge, Massachusetts, United States, 26/06/95. https://doi.org/10.3115/981658.981672

TY - GEN

T1 - Memoization of coroutined constraints

AU - Johnson, Mark

AU - Dörre, Jochen

N1 - Copyright the Publisher 1995. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

PY - 1995

Y1 - 1995

N2 - Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our technique to Bouma and van Noord's (1994) categorial grammar analysis of Dutch is provided.

AB - Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our technique to Bouma and van Noord's (1994) categorial grammar analysis of Dutch is provided.

UR - https://www.scopus.com/pages/publications/85121265107

U2 - 10.3115/981658.981672

DO - 10.3115/981658.981672

M3 - Conference proceeding contribution

SP - 100

EP - 107

BT - Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics

PB - Association for Computational Linguistics (ACL)

CY - San Francisco

T2 - Annual Meeting of the Association for Computational Linguistics (33rd : 1995)

Y2 - 26 June 1995 through 30 June 1995

ER -

Memoization of coroutined constraints

Abstract

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this