![[Graphics:NaturalLanguagegr2.gif]](NaturalLanguagegr2.gif)
![[Graphics:NaturalLanguagegr1.gif]](NaturalLanguagegr1.gif)
Very few (short) natural language expressions can be recognized and translated into appropriate Mathematica expressions. As a convention, we define type recognizers (i.e. predicates to decide whether something is of a particular type or not) always like
Examples for this are
Possible natural language constructions are:
![[Graphics:NaturalLanguagegr3.gif]](NaturalLanguagegr3.gif)
![[Graphics:NaturalLanguagegr4.gif]](NaturalLanguagegr4.gif)
![[Graphics:NaturalLanguagegr5.gif]](NaturalLanguagegr5.gif)
![[Graphics:NaturalLanguagegr6.gif]](NaturalLanguagegr6.gif)
![[Graphics:NaturalLanguagegr7.gif]](NaturalLanguagegr7.gif)
![[Graphics:NaturalLanguagegr8.gif]](NaturalLanguagegr8.gif)
![[Graphics:NaturalLanguagegr9.gif]](NaturalLanguagegr9.gif)
![[Graphics:NaturalLanguagegr10.gif]](NaturalLanguagegr10.gif)
![[Graphics:NaturalLanguagegr11.gif]](NaturalLanguagegr11.gif)
![[Graphics:NaturalLanguagegr12.gif]](NaturalLanguagegr12.gif)
![[Graphics:NaturalLanguagegr13.gif]](NaturalLanguagegr13.gif)
![[Graphics:NaturalLanguagegr14.gif]](NaturalLanguagegr14.gif)
![[Graphics:NaturalLanguagegr15.gif]](NaturalLanguagegr15.gif)
![[Graphics:NaturalLanguagegr16.gif]](NaturalLanguagegr16.gif)
![[Graphics:NaturalLanguagegr17.gif]](NaturalLanguagegr17.gif)
![[Graphics:NaturalLanguagegr18.gif]](NaturalLanguagegr18.gif)
![[Graphics:NaturalLanguagegr19.gif]](NaturalLanguagegr19.gif)
![[Graphics:NaturalLanguagegr20.gif]](NaturalLanguagegr20.gif)
![[Graphics:NaturalLanguagegr21.gif]](NaturalLanguagegr21.gif)
![[Graphics:NaturalLanguagegr22.gif]](NaturalLanguagegr22.gif)