The general learning algorithm presented in Section 4.3 technically can be applied to learn and model relations of any semantic type.
many open questions remain, such as how to deal with logical words, determiners, and quantification, and how to reconcile the different semantic types used for sentences with transitive and intransitive sentences.