data structure Project 1 Mini Project Parser based on List implementations Project Description Write a simple Parser in Java, that is capable of deciding, whether a simple Arabic or English sentence is syntactic correct or not A possible Grammar for such sentences can be defined as follows a the some certain like likes I speak speaks study studies 2) Alternatively, you can use the following Pattern for your sentences (for English) or Verb (for Arabic) See My Lecture Notes and Pervious Students projects Eexamples Based on the above grammar, the following sentences are correct The, baby, speaks, English) The, boy, studies, English) and even The, boy, study, English) a, boy, studies, a, school) However (speaks, English, baby, aj (study, a, English, like) are not Hints A correct sentence can be regarded as a list the, student, likes, English containing sub lists and word object at specific order (the, student), represents a List of a Nominal Phrase (NP)and likes, English) represents a List of a Verbal Phrase (VP) Appending a List of VP to a List of NP yields a valid Sentence This apply also to a List of a Determiner like (the) and a list of Noun like (student) etc A possible solution To create a parser for such sentences, we need at least the following lists as lexicon 1 Determiner a list of determiner such a, the, some 2 Noun a list of nouns such as (student, baby, ) 3 Verb a list of verbs such that (speak, speaks, study, 4 However, the Lists Nominal Phrase Verbal Phrase Sentence represent Lists containing sub lists, for example The Noun Phrase list will contain a concatenation of the Determiner and Noun Lists in that order, and the Verbal Phrase list will contain a concatenation of the Verb and NP list, etc The final list will be called Sentence, and it will be composed of the concatenation of NP), VP Final Remake In an advanced stage, you can improve your Parser by Using more advanced Data Structures such as a Dictionaries or tables instead of lists on the word levels Generating a Parse Trees of each correct sentence to optimize the search, you can also employ graph based search such as Depth First operating on graph (Stack based search) or Breath first Search (based on a queue) Projects (Details found in the Lecture Notes) Notes on the Projects Project 1 Simple Passer for checking NLP word order (English, Arabic) Details see Slides and Lecture notes website Project 2 write a Java Program that is capable of Matching tags in an HTML document select any HTML Document that contains Arabic Texts) You can apply your checker to cheek Java based syntax programs or Arithmetic Expressions with Braces Hint import Util StringTokenizer Use our Stack implementation or Java class Stack Project (Optional Projects) 1 Create a telephone directory using a Dictionary 2 Create an index containing the Frequencies of words in a big text file 3 Word Index (which words in which lines dictionary) 4 Any Application related to Information Retrieval (needs approving)

The Answer is in the image, click to view ...

Question: data structure Project-1: Mini-Project Parser based on List implementations Project Description: Write a simple Parser in Java, that is capable of deciding, whether a simple

data structure data structure Project-1: Mini-Project Parser based on List implementations Project Description:

Write a simple Parser in Java, that is capable of deciding, whether

a simple Arabic or English sentence is syntactic correct or not. A

possible Grammar for such sentences can be defined as follows: :: ::

Project-1: Mini-Project Parser based on List implementations Project Description: Write a simple Parser in Java, that is capable of deciding, whether a simple Arabic or English sentence is syntactic correct or not. A possible Grammar for such sentences can be defined as follows: :: :: :: :: a the some certain .... <: boy student dog ischool baby boys students data structure>: like likes I speak speaks study studies ... 2) Alternatively, you can use the following Pattern for your sentences ::

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

ADT-LIST Project-1: Mini-Project Parser based on List implementations Project Description: Write a simple Parser in Java, that is capable of deciding, whether a simple Arabic or English sentence is...

in java PRoJecTs Dr Bassam Haddad ADT-LIST Project-1: Mini-Project Parser based on List implementations 1 Project Description: - Write a simple Parser in Java, that is capable of deciding, whether a...

write a datastrcture code in java Project-1: Mini-Project Parser based on List implementations 2 Project Description: - Write a simple Parser in Java, that is capable of deciding, whether a simple...

Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...

The new line character is utilized solely as the last person in each message. On association with the server, a client can possibly (I) question the situation with a client by sending the client's...

Please scan the SEC Plain English that I've attached. Please visit to this link.http://www.sec.gov/Archives/edgar/data/320193/000119312513416534/d590790d10k.htm#toc590790_9 Please read pages 25...

Represent multisets using binary trees. Compare the representations (a), (b) and (c), stating the advantages and drawbacks of each. [Answers need not contain ML code. You may refer to algorithms and...

can someone solve this Modern workstations typically have memory systems that incorporate two or three levels of caching. Explain why they are designed like this. [4 marks] In order to investigate...

Predictive text entry systems are familiar on touch screens and mobile phones. This question asks you to consider how the same principles might be used in a programming editor for creating Java code....

ttth Suppose that the sequence of bags {Bn | n N} is recursively enumerated by the computable function e(n, x) = fn(x), [7 marks] Hence prove that the set of all recursive bags cannot be recursively...

Compute cash flows from financing activities using the following company information. Additional short-term borrowings . . . . . . . . . . $88,000 Purchase of short-term investments . . . . . . . ....

A US-based multinational that frequently imports raw materials from Canada. These products are generally billed in Canadian dollars and you are concerned that the Canadian dollar will appreciate in...

The value of a bond is affected by the coupon rate of the bond, the maturity date of the bond, and the discount rate ( yield to maturity ) . True False

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

After Column and Data Types have been set in the Mining Structure, what is the next step?

What needs to occur after any Structural or Variable setting change in SSAS Mining Structures?

For the highest GS Pay Grade Group (1115) in the Federal Government, what are the chances of Females being included? Do Females have longer service statistics in that Group?