Finite-state approximation of unification grammars using left-corner grammar transforms

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

2 Downloads (Pure)

Abstract

This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of grammar transforms, and is exact for left-linear and right-linear CFGs, and for trees up to a user-specified depth of center-embedding.
Original languageEnglish
Title of host publication36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics
Subtitle of host publicationProceedings of the Conference
PublisherMorgan Kaufmann
Pages619-623
Number of pages5
Volume1
DOIs
Publication statusPublished - 1998
Externally publishedYes
EventAnnual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998) - Universite de Montreal , Montreal, Canada
Duration: 10 Aug 199814 Aug 1998

Conference

ConferenceAnnual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998)
Abbreviated titleCOLING-ACL '98
CountryCanada
CityMontreal
Period10/08/9814/08/98

Bibliographical note

Copyright the Publisher 1998. 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.

Fingerprint Dive into the research topics of 'Finite-state approximation of unification grammars using left-corner grammar transforms'. Together they form a unique fingerprint.

Cite this