A Dependency-based Algorithm for Grammar Conversion

Alessandro Bahgat Shehata, Fabio Massimo Zanzotto

Abstract
In this paper we present a model to transfer a grammatical formalism in another. The model is applicable only on restrictive conditions. However, it is fairly useful for many purposes: parsing evaluation, researching methods for truly combining different parsing outputs to reach better parsing performances, and building larger syntactically annotated corpora for data-driven approaches. The model has been tested over a case study: the translation of the Turin Tree Bank Grammar to the Shallow Grammar of the CHAOS Italian parser.
Anthology ID:
L06-1180
Volume:
Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06)
Month:
May
Year:
2006
Address:
Genoa, Italy
Venue:
LREC
SIG:
Publisher:
European Language Resources Association (ELRA)
Note:
Pages:
Language:
URL:
http://www.lrec-conf.org/proceedings/lrec2006/pdf/314_pdf.pdf
DOI:
Bibkey:
Cite (ACL):
Alessandro Bahgat Shehata and Fabio Massimo Zanzotto. 2006. A Dependency-based Algorithm for Grammar Conversion. In Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06), Genoa, Italy. European Language Resources Association (ELRA).
Cite (Informal):
A Dependency-based Algorithm for Grammar Conversion (Shehata & Zanzotto, LREC 2006)
Copy Citation:
PDF:
http://www.lrec-conf.org/proceedings/lrec2006/pdf/314_pdf.pdf
PDF Search