Existential construction - artificial intelligence, Computer Engineering

Assignment Help:

The English existential construction involves so-called there-sentences such as these:

(1)  There is a dog in the yard

(2)  There were no children at the party

(3)  There are three cars available

 NPs with weak quantifiers can be the subject of a there-sentence, but proper names, definite NPs, and NPs with strong quantifiers can't:

(4)  *There was John at the party

(5)  *There were the children at the party

(6)  *There are all/most cars available

Find an existential construction in a language other than English that is the equivalent of English there-sentences. Give at least two examples of the construction, and give word-by-word glosses as well as a translation for each example. Explain the syntactic structure of the construction as best as you can to someone who does not speak the language. If you are not a native speaker of the language, make sure to check the grammaticality of your examples with a native speaker.

After you have identified the existential construction in the language, try to determine whether it has the same restrictions on what can be the subject as the English there-sentences. Test at least proper names, two different strong quantifiers, and two different weak quantifiers. Summarize your results and make an explicit comparison with English.


Related Discussions:- Existential construction - artificial intelligence

GRID COMPUTING, I NEED THE CODES IN MATLAB FOR RESOURCE ALLOCATION IN GRID ...

I NEED THE CODES IN MATLAB FOR RESOURCE ALLOCATION IN GRID COMPUTING

Data parallel model - parallel programming model, In the data parallel mode...

In the data parallel model, many of the parallel work focus on performing operations on a data set. The data set is usually organized into a common structure, such as an array or a

Unification algorithm - artificial intelligence, Unification Algorithm - Ar...

Unification Algorithm - Artificial intelligence: To merge two statements, we should get a substitution which forms the two sentences similar. Remember that we write V/T to sign

What do you mean by first fit, What do you mean by first fit? First fi...

What do you mean by first fit? First fit allocates the first hole that is big enough. Searching can either begin at the beginning of the set of holes or where the last first-f

Formal analysis of visual elements, Formal Analysis: The second step o...

Formal Analysis: The second step of the art critiquing process often begins with an analysis of the artworks formal elements and how they are the organised. The formal elem

Op code mnemonics in assembly language, Op code mnemonics: Instruction...

Op code mnemonics: Instructions  (statements)  in  assembly  language  are  usually  very  simple,  unlike  those that in  high-level languages. Usually, an opcode is a symbol

Define pvm library routines, Q. Define PVM library routines? In this se...

Q. Define PVM library routines? In this segment we will give a short description of the routines in PVM 3 user library. Each PVM program must comprise the PVM header file 'pvm3

Inheritance, Create a new project, LastNameFirst 05, for this assignment. ...

Create a new project, LastNameFirst 05, for this assignment. You will need to define the classes depicted in the class diagram below. All of the classes should contain complete ja

Integrated test result, COGNITIONS Mr. X exhibits a generally high-quali...

COGNITIONS Mr. X exhibits a generally high-quality level of cognitive and intellectual functioning, as evidenced by his performance on the MMSE-2 and WAIS-IV. His one weakness w

Delete the leaves of a binary tree, Write a recursive algorithm to delete t...

Write a recursive algorithm to delete the leaves of a binary tree. Programming Requirements You must use the binary search tree code provided.  Each algorithm must be impleme

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd