Ács Evelin and Holló-Szabó Ákos and Recski Gábor: Parsing noun phrases with interpreted regular tree grammars.
Preview |
Cikk, tanulmány, mű
msznykonf_015_301-313.pdf Download (603kB) | Preview |
Abstract
Several common tasks in natural language processing (NLP) involve graph transformation, in particular those that handle syntactic trees, dependency structures such as Universal Dependencies (UD) [1], or semantic graphs such as AMR [2] and 4lang [3]. Interpreted Regular Tree Grammars (IRTGs) [4] encode the correspondence between sets of such structures and have in recent years been used to perform both syntactic and semantic parsing. In this paper we introduce our tool that is capable of automatic IRTG generation. Our IRTG covers 83% of noun phrases (NPs) from the Wall Street Journal section of the Penn Treebank and a pilot experiment had also been made for retrieving surface realizations from UD graphs using independent data. We also describe this generated IRTG which allows for simultaneous generation of structures of various types and can be used for semantic parsing, generation, and semanticsdriven translation.
Item Type: | Conference or Workshop Item |
---|---|
Journal or Publication Title: | Magyar Számítógépes Nyelvészeti Konferencia |
Date: | 2019 |
Volume: | 15 |
ISBN: | 978-963-315-393-2 |
Page Range: | pp. 301-313 |
Event Title: | Magyar Számítógépes Nyelvészeti Konferencia (15.) (2019) (Szeged) |
Related URLs: | http://acta.bibl.u-szeged.hu/58556/ |
Uncontrolled Keywords: | Nyelvészet - számítógép alkalmazása |
Additional Information: | Bibliogr.: p. 311-312. ; összefoglalás angol nyelven |
Date Deposited: | 2019. Jul. 03. 13:40 |
Last Modified: | 2022. Nov. 08. 11:49 |
URI: | http://acta.bibl.u-szeged.hu/id/eprint/59094 |
Actions (login required)
![]() |
View Item |