Memoization of coroutined constraints

Mark Johnson, Jochen Dörre

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

6 Citations (Scopus)
15 Downloads (Pure)


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 languageEnglish
Title of host publicationProceedings of the 33rd Annual Meeting of the Association for Computational Linguistics
Place of PublicationSan Francisco
PublisherAssociation for Computational Linguistics (ACL)
Number of pages8
Publication statusPublished - 1995
Externally publishedYes
EventAnnual Meeting of the Association for Computational Linguistics (33rd : 1995) - Massachusetts Institute of Technology, Cambridge, United States
Duration: 26 Jun 199530 Jun 1995


ConferenceAnnual Meeting of the Association for Computational Linguistics (33rd : 1995)
Country/TerritoryUnited States

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.


Dive into the research topics of 'Memoization of coroutined constraints'. Together they form a unique fingerprint.

Cite this