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 | |
| 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.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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver