Abstract
Linguistic communication takes a major role in human communication and information exchange. Information is usually transferred in a text form - sentences. Text descriptions allow us define new terms, gather knowledge and learn more quickly thanks to the associative mechanisms that work in our brains. Automatic and intelligent text processing and compression are very important nowadays. This paper introduces a novelty associative way of storing, compressing and processing sentences. This paper describes an associative linguistic habit neural graphs (ALHNG) that are able to store and activate various important associative relations between letters and words simultaneously in many sentences. These graphs enable us to semi-automatically define various terms and contextually process text corrections after the knowledge collected from previously read texts. The ALHNG construction has a linear computational complexity. The association and triggering interconnected elements in any given context have a constant computational complexity. It also compresses sentences in a very effective way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abney, S.: Part-of-Speech Tagging and Partial Parsing. Corpusbased Methods in Language and Speech Processing 2, 1–23 (1996)
Back, R.J.R.: Refinement calculus, Parallel and reactive programs. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 42–66. Springer, Heidelberg (1990)
Gadamer, M., Horzyk, A.: Text analysis and correction using specialized linguistic habit graphs LHG. Automation (2012)
Ganapathiraju, M., Manoharan, V., Klein-Seetharaman, J.: Statistical Analysis of the Indus Script Using n-Grams. PLOS ONEÂ 5, 16 (2010)
Horzyk, A., Tadeusiewicz, R.: A Psycholinguistic Model of Man-Machine Interactions Based on Needs of Human Personality. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. AISC, vol. 59, pp. 55–67. Springer, Heidelberg (2009)
Horzyk, A.: Information Freedom and Associative Artificial Intelligence. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012, Part I. LNCS, vol. 7267, pp. 81–89. Springer, Heidelberg (2012)
Hunston, S., Francis, G.: Pattern Grammar: A Corpus-Driven Approach to the Lexical Grammar of English. Computational Linguistics 27, 318–320 (2000)
Konstantinidis, S.: Computing the Levenshtein distance of a regular language. In: IEEE Information Theory Workshop 2005 (2005)
Robertson, A.M., Willett, P.: Applications of n-grams in textual information systems. Journal of Documentation 54, 48–69 (1998)
Suchanek, F.M., Ifrim, G., Weikum, G.: Combining linguistic and statistical analysis to extract relations from web documents. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, p. 712 (2006)
Tadeusiewicz, R., Rowinski, T.: Computer science and psychology in information society. AGH (2011)
Yujian, L., Bo, L.: A Normalized Levenshtein Distance Metric. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 1091–1095 (2007)
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
Horzyk, A., Gadamer, M. (2013). Associative Text Representation and Correction. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2013. Lecture Notes in Computer Science(), vol 7894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38658-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38658-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38657-2
Online ISBN: 978-3-642-38658-9
eBook Packages: Computer ScienceComputer Science (R0)