Learning tree patterns for syntactic parsing

Hócza, András: Learning tree patterns for syntactic parsing. Acta cybernetica, (17) 3. pp. 647-659. (2006)

[img] Cikk, tanulmány, mű
Hocza_2006_ActaCybernetica.pdf

Download (124kB)

Abstract

This paper presents a method for parsing Hungarian texts using a machine learning approach. The method collects the initial grammar for a learner from an annotated corpus with the help of tree shapes. The PGS algorithm, an improved version of the RGLearn algorithm, was developed and applied to learning tree patterns with various phrase types described by regular expressions. The method also calculates the probability values of the learned tree patterns. The syntactic parser of learned grammar using the Viterbi algorithm performs a quick search for finding the most probable derivation of a sentence. The results were built into an information extraction pipeline.

Item Type: Article
Event Title: Conference on Hungarian Computational Linguistics, 2., 2004, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 3
Page Range: pp. 647-659
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika, Nyelvtudomány
Additional Information: Bibliogr.: p. 658-659.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:17
URI: http://acta.bibl.u-szeged.hu/id/eprint/12788

Actions (login required)

View Item View Item