Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

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.

Sadeghzadeh Mohammad Bagher; Razzazi Mohammad reza; GHAYOOMI MASOOD

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2019 | Volume:16 | Issue:3 (41) Page(s): 23-35

Download Full-Text

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

Persian Verion

View:

464

Download:

Cites:

Information Journal Paper

Title

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

Author(s)

Sadeghzadeh Mohammad Bagher | Razzazi Mohammad reza | GHAYOOMI MASOOD | Issue Writer Certificate

Keywords

Probabilistic context free grammarQ1

parserQ1

tree bankQ1

conjunction phrasesQ1

parent annotationQ1

child annotationQ1

part of speech tagsQ1

Abstract

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. For example, annotated tree bank data has been crucial in syntactic research to test linguistic theories of sentence structure against large quantities of naturally occurring examples. The natural language parser consists of two basic parts, POS tagger and the syntax parser. A Part-Of-Speech Tagger (POS Tagger) is a piece of software that reads text in some languages and assigns parts of speech to each word (and other token), such as noun, verb, adjective, etc., although generally computational applications use more fine-grained POS tags like 'noun-plural'. A natural language parser is a program that works out the grammatical structure of sentences, for instance, which groups of words go together (as "phrases") and which words are the subject or object of a verb. Probabilistic parsers use knowledge of language gained from hand-parsed sentences to try to produce the most likely analysis of new sentences. These statistical parsers still make some mistakes, but commonly work rather well. Inaccurate design of context-free grammars and using bad structures such as Chomsky normal form can reduce accuracy of probabilistic context-free grammar parser. Weak independence assumption is one of the problems related to CFG. We have tried to improve this problem with parent and child annotation, which copies the label of a parent node onto the labels of its children, and it can improve the performance of a PCFG. In grammar, a conjunction (conj) is a part of speech that connects words, phrases, or clauses that are called the conjuncts of the conjunctions. In this study, we examined the conjunction phrases in the Persian tree bank. The results of this study show that adding structural dependencies to grammars and modifying the basic rules can remove conjunction ambiguity and increase accuracy of probabilistic context-free grammar parser. When a part-of-speech (PoS) tagger assigns word class labels to tokens, it has to select from a set of possible labels whose size usually ranges from fifty to several hundred labels depending on the language. In this study, we have investigated the effect of fine and coarse grain POS tags and merging non-terminals on Persian PCFG parser.

Cites

No record.

References

No record.

Cite

APA: Copy

Sadeghzadeh, Mohammad Bagher, Razzazi, Mohammad reza, & GHAYOOMI, MASOOD. (2019). Studying impressive parameters on the performance of Persian probabilistic context free grammar parser. SIGNAL AND DATA PROCESSING, 16(3 (41) ), 23-35. SID. https://sid.ir/paper/160770/en

Vancouver: Copy

Sadeghzadeh Mohammad Bagher, Razzazi Mohammad reza, GHAYOOMI MASOOD. Studying impressive parameters on the performance of Persian probabilistic context free grammar parser. SIGNAL AND DATA PROCESSING[Internet]. 2019;16(3 (41) ):23-35. Available from: https://sid.ir/paper/160770/en

IEEE: Copy

Mohammad Bagher Sadeghzadeh, Mohammad reza Razzazi, and MASOOD GHAYOOMI, “Studying impressive parameters on the performance of Persian probabilistic context free grammar parser,” SIGNAL AND DATA PROCESSING, vol. 16, no. 3 (41) , pp. 23–35, 2019, [Online]. Available: https://sid.ir/paper/160770/en

Related Journal Papers