USING A TREE-ADJOINING GRAMMAR IN TRANSLATING ENGLISH INTO 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.

FEILI H.; GHASEM SANI GH.R.

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

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2005 | Volume:3 | Issue:1 (a) Page(s): 21-31

Download Full-Text

Persian Verion

View:

15,768

Download:

Cites:

Information Journal Paper

Title

USING A TREE-ADJOINING GRAMMAR IN TRANSLATING ENGLISH INTO PERSIAN

Author(s)

FEILI H. | GHASEM SANI GH.R. | Issue Writer Certificate

Keywords

NATURAL LANGUAGE PROCESSINGQ2

MACHINE TRANSLATIONQ2

TREE-ADJOINING-GRAMMARSQ4

LEXICALIZED GRAMMARQ4

ENGLISH-PERSIAN TRANSLATIONQ4

DECISION-TREEQ4

Abstract

Increasing the domain of locality by using TREE-ADJOINING-GRAMMARS (TAG) encouraged some researchers to use TAGs in applications such as MACHINE TRANSLATION, especially in the disambiguation process. Successful experiments of applying a TAG to French-English and Korean- English translation encouraged us to use it for another language pairs with very divergent properties, i.e., English and Persian. By using a Synchronous TAG (S-TAG) for this pair of languages, we can benefit from syntactic and semantic features of these languages. In this paper, we report on our successful experiments of automatic translation of English into Persian. We also present a computational model for disambiguation of lexical selection, based on a decision tree approach. Finally, a new automatic method for learning a decision tree from a sample data set is introduced

Cites

No record.

References

No record.

Cite

APA: Copy

FEILI, H., & GHASEM SANI, GH.R.. (2005). USING A TREE-ADJOINING GRAMMAR IN TRANSLATING ENGLISH INTO PERSIAN. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 3(1 (a)), 21-31. SID. https://sid.ir/paper/70694/en

Vancouver: Copy

FEILI H., GHASEM SANI GH.R.. USING A TREE-ADJOINING GRAMMAR IN TRANSLATING ENGLISH INTO PERSIAN. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2005;3(1 (a)):21-31. Available from: https://sid.ir/paper/70694/en

IEEE: Copy

H. FEILI, and GH.R. GHASEM SANI, “USING A TREE-ADJOINING GRAMMAR IN TRANSLATING ENGLISH INTO PERSIAN,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 3, no. 1 (a), pp. 21–31, 2005, [Online]. Available: https://sid.ir/paper/70694/en

Related Journal Papers