Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 4 August 2011

Rule Based Shallow Parser for Arabic Language

Mona Ali Mohammed & Nazlia Omar

Journal of Computer Science, Volume 7, Issue 10, pp. 1505–1514 · doi.org/10.3844/jcssp.2011.1505.1514

7,183 accesses10,633 downloads9 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: One of language processing approaches that compute a basic analysis of sentence structure rather than attempting full syntactic analysis is shallow syntactic parsing. It is an analysis of a sentence which identifies the constituents (noun groups, verb groups, prepositional groups), but does not specify their internal structure, nor their role in the main sentence. The only technique used for Arabic shallow parser is Support Vector Machine (SVM) based approach. The problem faced by shallow parser developers is the boundary identification which is applied to ensure the generation of high accuracy system performance. Approach: The specific objective of the research was to identify the entire Noun Phrases (NPs), Verb Phrases (VPs) and Prepositional Phrases (PPs) boundaries in the Arabic language. This study discussed various idiosyncrasies of Arabic sentences to derive more accurate rules to detect start and the end boundaries of each clause in an Arabic sentence. New rules were proposed to the shallow parser features up to the generation of two levels from full parse-tree. We described an implementation and evaluate the rule-based shallow parser that handles chunking of Arabic sentences. This research was based on a critical analysis of the Arabic sentences architecture. It discussed various idiosyncrasies of Arabic sentences to derive more accurate rules to detect the start and the end boundaries of each clause in an Arabic sentence. Results: The system was tested manually on 70 Arabic sentences which composed of 1776 words, with the length of the sentences between 4-50 words. The result obtained was significantly better than state of the art Arabic published results, which achieved F-scores of 97%. Conclusion: The main achievement includes the development of Arabic shallow parser based on rule-based approaches. Chunking which constitutes the main contribution is achieved on two successive stages that include grouped sequences of adjacent words on the basis of linguistic properties.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2011 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Mohammed, M. A. & Omar, N. (2011). Rule Based Shallow Parser for Arabic Language. Journal of Computer Science, 7(10), 1505–1514. https://doi.org/10.3844/jcssp.2011.1505.1514

Licence
© Science Publications
Issue
Volume 7, Issue 10
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Rule Based Shallow Parser for Arabic LanguageJournal of Computer Science · Volume 7, Issue 10 · pp. 1505–1514 · © Science PublicationsDownload