Abstract
Allan Turing [5] suggested to regard the ability to communicate in human language as an indication of true intelligence. If a computer would be able to engage in such a communication with human beings without them being able to identify the computer, the computer should be considered to be intelligent. Although it is debatable whether this conclusion could really be drawn from the Turing test (see also [6]), it shows how complex human language is and how many facets it has. Some of the most important dimensions of language are phonology, morphology, syntax, semantics, and pragmatics. Pragmatics includes the whole field of contextual and ontological knowledge. These dimensions are not orthogonal, but are intertwined in many ways. Even if we restrict ourselves to text input and output, thus disregarding phonology, this creates an amazingly complex structure. While computational linguists try to make progress understanding the relation between the various dimensions, we usually restrict ourselves to syntax in natural language processing, sometimes extended by limited attempts to make a semantic interpretation or to make use of ontological knowledge. The reason for this is, of course, the descriptional and computational complexity of the models required.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bensch, S., Björklund, H., Drewes, F.: Algorithmic properties of Millstream systems. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 54–65. Springer, Heidelberg (2010)
Bensch, S., Drewes, F.: Millstream systems – a formal model for linking language modules by interfaces. In: Drewes, F., Kuhlmann, M. (eds.) Proc. ACL 2010 Workshop on Applications of Tree Automata in Natural Language Processing (ATANLP 2010). The Association for Computer Linguistics (2010)
Bensch, S., Drewes, F., Jürgensen, H., van der Merwe, B.: Incremental construction of Millstream configurations using graph transformation. In: Proc. 9th Intl. Workshop on Finite State Methods and Natural Language Processing (FSMNLP 2011), pp. 93–97. Association for Computational Linguistics (2011)
Bensch, S., Drewes, F., Jürgensen, H., van der Merwe, B.: Graph transformation for incremental natural language analysis (unpublished manuscript, 2013)
Turing, A.M.: Computing machinery and intelligence. Mind LIX(236), 433–460 (2005)
Weizenbaum, J.: ELIZA – a computer program for the study of natural language communication between man and machine. Communications of the ACM 9, 36–45 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drewes, F. (2013). Millstream Systems and Graph Transformation for Complex Linguistic Models. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39310-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39309-9
Online ISBN: 978-3-642-39310-5
eBook Packages: Computer ScienceComputer Science (R0)