A RULE-BASED APPROACH IN CONVERTING A DEPENDENCY PARSE TREE INTO PHRASE STRUCTURE PARSE TREE 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.

SOLTANZADEH FATEMEH; BAHRANI MOHAMMAD; ESLAMI MOHARAM

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

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2015 | Volume:- | Issue:4 (SERIAL 26) Page(s): 95-115

Download Full-Text

Persian Verion

View:

1,333

Download:

Cites:

Information Journal Paper

Title

A RULE-BASED APPROACH IN CONVERTING A DEPENDENCY PARSE TREE INTO PHRASE STRUCTURE PARSE TREE FOR PERSIAN

Author(s)

SOLTANZADEH FATEMEH | BAHRANI MOHAMMAD | ESLAMI MOHARAM | Issue Writer Certificate

Keywords

CONVERSIONQ2

DEPENDENCY GRAMMARQ2

PHRASE STRUCTURE GRAMMARQ2

NATURAL LANGUAGE PROCESSINGQ2

TREEBANKQ2

PERSIANQ2

Abstract

In this paper, an automatic method in converting a dependency parse tree into its equivalent phrase structure one is introduced for the PERSIAN language. In the first step, a rule-based algorithm is designed. Then, PERSIAN specific dependency-to-phrase structure CONVERSION rules merge to the algorithm. Subsequently, the PERSIAN dependency TREEBANK with about 30,000 sentences is used as an input for the algorithm and an equivalent phrase structure TREEBANK is extracted. Finally, the statistical Stanford parser is trained using the resulting TREEBANK. Experimental results show a F1 of 96.05% for the CONVERSION algorithm and an F1 of 86.01% for PERSIAN factored model parser.

Cites

No record.

References

No record.

Cite

APA: Copy

SOLTANZADEH, FATEMEH, BAHRANI, MOHAMMAD, & ESLAMI, MOHARAM. (2015). A RULE-BASED APPROACH IN CONVERTING A DEPENDENCY PARSE TREE INTO PHRASE STRUCTURE PARSE TREE FOR PERSIAN. SIGNAL AND DATA PROCESSING, -(4 (SERIAL 26)), 95-115. SID. https://sid.ir/paper/160748/en

Vancouver: Copy

SOLTANZADEH FATEMEH, BAHRANI MOHAMMAD, ESLAMI MOHARAM. A RULE-BASED APPROACH IN CONVERTING A DEPENDENCY PARSE TREE INTO PHRASE STRUCTURE PARSE TREE FOR PERSIAN. SIGNAL AND DATA PROCESSING[Internet]. 2015;-(4 (SERIAL 26)):95-115. Available from: https://sid.ir/paper/160748/en

IEEE: Copy

FATEMEH SOLTANZADEH, MOHAMMAD BAHRANI, and MOHARAM ESLAMI, “A RULE-BASED APPROACH IN CONVERTING A DEPENDENCY PARSE TREE INTO PHRASE STRUCTURE PARSE TREE FOR PERSIAN,” SIGNAL AND DATA PROCESSING, vol. -, no. 4 (SERIAL 26), pp. 95–115, 2015, [Online]. Available: https://sid.ir/paper/160748/en

Related Journal Papers