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

Mark Johnson

doi:10.3115/980845.980948

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

Mark Johnson

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

29 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 language	English
Title of host publication	36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics
Subtitle of host publication	Proceedings of the Conference
Publisher	Morgan Kaufmann
Pages	619-623
Number of pages	5
Volume	1
DOIs	https://doi.org/10.3115/980845.980948
Publication status	Published - 1998
Externally published	Yes
Event	Annual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998) - Universite de Montreal , Montreal, Canada Duration: 10 Aug 1998 → 14 Aug 1998

Conference

Conference	Annual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998)
Abbreviated title	COLING-ACL '98
Country/Territory	Canada
City	Montreal
Period	10/08/98 → 14/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.

Access to Document

10.3115/980845.980948Licence: CC BY-NC-SA

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

Cite this

@inproceedings{ecb406576ee74976bdbc73be33035efd,

title = "Finite-state approximation of unification grammars using left-corner grammar transforms",

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.",

author = "Mark Johnson",

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. ; Annual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998), COLING-ACL '98 ; Conference date: 10-08-1998 Through 14-08-1998",

year = "1998",

doi = "10.3115/980845.980948",

language = "English",

volume = "1",

pages = "619--623",

booktitle = "36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics",

publisher = "Morgan Kaufmann",

}

Johnson, M 1998, Finite-state approximation of unification grammars using left-corner grammar transforms. in 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics : Proceedings of the Conference. vol. 1, Morgan Kaufmann, pp. 619-623, Annual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998), Montreal, Canada, 10/08/98. https://doi.org/10.3115/980845.980948

Finite-state approximation of unification grammars using left-corner grammar transforms. / Johnson, Mark.
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics : Proceedings of the Conference. Vol. 1 Morgan Kaufmann, 1998. p. 619-623.

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

TY - GEN

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

AU - Johnson, Mark

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

PY - 1998

Y1 - 1998

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

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

U2 - 10.3115/980845.980948

DO - 10.3115/980845.980948

M3 - Conference proceeding contribution

VL - 1

SP - 619

EP - 623

BT - 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics

PB - Morgan Kaufmann

T2 - Annual Meeting of the Association for Computational Linguistics (36th : 1998) & International Conference on Computational Linguistics (17th : 1998)

Y2 - 10 August 1998 through 14 August 1998

ER -

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

Abstract

Conference

Bibliographical note

Access to Document

Fingerprint

Cite this