Posted 24 May 2006 - 04:09 PM
Posted 24 May 2006 - 04:32 PM
1 noun (badger)
2 noun (fox)
3 noun (otter)
5 verb (jumps)
7 adjective brown
8 adjective quick
9 adjective lazy
10 sentence (A B C) if
noun (a) and
verb (b) and
b iii Describe how you would alter the sentence rule that the nouns are always different and sentences like 'badger sees badger' are no longer valid.
c. Write a rule called complex_sentence which allow a sentence such as "lazy badger meets brown fox"
d. What difficulties would be encountered if the system were to be expanded to analyse all english sentences?
Any help would be appreciated!
Posted 24 May 2006 - 04:39 PM
Posted 25 May 2006 - 08:46 AM
A clear description of the addition of a fourth sub-goal of the form and not(A=C)
complex_sentence (A,B,C,D,E) if
adjective (A) and
noun (B) and
verb © and
adjective (D) and
Answers should comment fully upon both of the folowing
* Greatly increased number of facts fot the system to deal with to represent all number of words.
* Greater number of rules to express the variety of legal sentence structures.
Alternative answers may comment upon the technical difficulties. These should make reference to the greatly increased memory/processor requirements.
Did you only want the answers ??? Or did you want an explanation too ??
Posted 25 May 2006 - 09:38 AM
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users