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

Explain jk flip-flop using sr flip-flop, Q. Explain 4 bit Ripple counter wi...

Q. Explain 4 bit Ripple counter with necessary diagram. Q. Explain JK Master-slave Flip-flop with block diagram and logic design. Q. Explain JK flip-flop using SR flip-flop

What is applying of an open source systems, What is applying of an Open Sou...

What is applying of an Open Source Systems?   No licensing issues No initial cost Speed of Access Openness and Transparency

Explain simplifying the sop boolean expression using k-map, Explain Simplif...

Explain Simplifying the SOP f the Boolean expression using the K-Map? To simplify the SOP of the Boolean expression using the K map, first identify all the input combinations tha

Recursive binary search, The implementation of a (non-recursive) binary sea...

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

Amdahls law - calculate speed up performance, To calculate speed up perform...

To calculate speed up performance various laws have been developed. These laws are discussed here.  Amdahl's Law Remember, the speed up factor helps us in knowing the relat

Applied physics, #what is nicol prism.its construction and working

#what is nicol prism.its construction and working

What does formal verification mean, What does formal verification mean? ...

What does formal verification mean? Formal verification uses Mathematical techniques by proving the design by assertions or properties. Correctness of the design can be achiev

Explain about local area network, Q. Explain about Local Area Network? ...

Q. Explain about Local Area Network? Local Area Network (LAN):  It is privately owned communication systems that cover up a small area, say a complex of buildings or school. Le

Find the minimum sop and pos expression, Q.  Find the minimum SOP and POS e...

Q.  Find the minimum SOP and POS expression for the following functions using K- Map and realize the expression using appropriate gates. Also realize SOP form using NAND-to-NAND ga

What are the variations in a fast adder, a. Design a fast adder. What are t...

a. Design a fast adder. What are the variations in a fast adder? b. Define how the virtual address is changed into real address in a paged virtual memory system. Give an example

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