CONVERTING DEPENDENCY TREEBANK TO CONSTITUENCY TREEBANK FOR PERSIAN

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

POURAMINI AHMAD; GHAYOOMI MASOOD; NASERI AMINE

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2018 | Volume:14 | Issue:4 (SERIAL 34) Page(s): 79-96

Download Full-Text

Persian Verion

View:

690

Download:

Cites:

Information Journal Paper

Title

CONVERTING DEPENDENCY TREEBANK TO CONSTITUENCY TREEBANK FOR PERSIAN

Author(s)

POURAMINI AHMAD | GHAYOOMI MASOOD | NASERI AMINE | Issue Writer Certificate

Keywords

NATURAL LANGUAGE PROCESSINGQ2

TREEBANKSQ1

DEPENDENCY STRUCTUREQ2

PHRASE STRUCTUREQ2

Abstract

There are two major types of TREEBANKS: dependency-based and constituency-based. Both of them have applications in NATURAL LANGUAGE PROCESSING and computational linguistics. Several dependency TREEBANKS have been developed for Persian. However, there is no available big size constituency treebank for this language. In this paper, we aim to propose an algorithm for automatic conversion of a dependency treebank to a constituency treebank for Persian. Our method is based on an existing method. However, we make modification to enhance its accuracy. The base algorithm constructs a constituency structure according to a set of conversion rules. Each rule maps a dependency relation to a constituency subtree. The constituency structure is built by combining these subtrees. We investigate the effects of the order in which dependency relations are processed on the output constituency structure. We show that the best order depends on the charactersitics of the target language. We also make modification in the algorithm for matching the conversion rules. To match a dependency relation to a conversion rule, we start with detailed infromation and if no match was found, we decrease the details and also change the method for matching. We also make modification in the algorithm used for combining the constituency subtrees. We use statistical data derived from a treebank to find a proper position for attaching a constituency subtree to the projection chain of the head. The expremental results show that these modifications provide an improvement of 16. 48% in the accuracy of the conversion algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

POURAMINI, AHMAD, GHAYOOMI, MASOOD, & NASERI, AMINE. (2018). CONVERTING DEPENDENCY TREEBANK TO CONSTITUENCY TREEBANK FOR PERSIAN. SIGNAL AND DATA PROCESSING, 14(4 (SERIAL 34) ), 79-96. SID. https://sid.ir/paper/160833/en

Vancouver: Copy

POURAMINI AHMAD, GHAYOOMI MASOOD, NASERI AMINE. CONVERTING DEPENDENCY TREEBANK TO CONSTITUENCY TREEBANK FOR PERSIAN. SIGNAL AND DATA PROCESSING[Internet]. 2018;14(4 (SERIAL 34) ):79-96. Available from: https://sid.ir/paper/160833/en

IEEE: Copy

AHMAD POURAMINI, MASOOD GHAYOOMI, and AMINE NASERI, “CONVERTING DEPENDENCY TREEBANK TO CONSTITUENCY TREEBANK FOR PERSIAN,” SIGNAL AND DATA PROCESSING, vol. 14, no. 4 (SERIAL 34) , pp. 79–96, 2018, [Online]. Available: https://sid.ir/paper/160833/en

Related Journal Papers