The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A set of Context Sensitive Grammar (CSG) rules to translate Bangla imperative, optative and exclamatory sentences into English are introduced in this paper. In this paper, sentences are considered according to the function and purpose of the user rather than structure of the sentence. Three algorithms are implemented to complete major three steps of machine translation system (i.e., parsing, transfer...
Information Present in Different language and Structure gives Rise to language as barrier in information retrieval. Informative Document on queen Elizabeth is been writing by foreign language English which makes its difficult for a Marathi reader to understand and seek History of England, on Similar lines Literature Work on Shivaji is mostly documented in Marathi which makes foreign Historians difficult...
We introduce the principles of symbolization and conceptualization of perceived reality. We show them as processes that are applicable inside of a computer mind. We derive those processes from principles of a human mind. We present process of higher order regular abstraction and state automata acceptance as possible machine reality realization mechanism. We present the algorithm for evolution of machine...
Turing machines are equivalent to modern electronic computers at a certain theoretical level, but differ in many details. In the analogy with a computer, the “tape” of the Turing machine is the computer memory, idealized to extend infinitely in each direction. The remarkable fact is that certain Turing machines are “universal”, in the sense that with appropriate input, they can be made to perform...
The automatic evaluation of computer programs is a nascent area of research with a potential for large-scale impact. Extant program assessment systems score mostly based on the number of test-cases passed, providing no insight into the competency of the programmer. In this paper, we present a machine learning framework to automatically grade computer programs. We propose a set of highly-informative...
This paper describes work on a poetry generator that is capable of generating poems in Indonesian based on certain contexts by employing a constraint satisfaction approach. The system retrieves language resources such as templates and slot fillers and combines them to instantiate poetry lines, which in turn are composed into poems based on a set of given constraints. The output of this system was...
Historically, behavior-based computer security has relied on automatic classification of the activities of persons and programs to determine whether these activities should be restricted. In this paper, we argue that classification that relies exclusively upon observation of low-level events (either via signatures or anomalies) is insufficient to infer higher-level behavior correctly. However, ordering...
There is a growing interest in using serious games to uncover personality traits of people for job assessment. The disadvantage of the old paper questionnaires and interviews is the risk of giving socially desirable answers. Accommodating assessment in a game can provide a richer, less repetitive and more immersive context in which players might act more natural and intuitive. In order to design games...
Natural Language processing (NLP) is a field of computer science and linguistics concerned with the interactions between computers and human (natural) languages. Ambiguity is one of these problems which have been a great challenge for computational linguists. This paper concentrates on the problem of target word selection in Myanmar to English machine translation, for which the approach is directly...
Parsing is a process of transforming natural language into an internal system representation, which can be trees, dependency graphs, frames or some other structural representations. If a natural language be successfully parsed then grammar checking from this language becomes easy. In this paper we describe a context free grammar for Bangla language and hence we develop a Bangla parser based on the...
During the transformation of the existing social Web to semantic social Web, semantics-enriched social computing is becoming important, because it can support semantics-oriented user connection and collaboration in a larger community. To provide this support, this paper proposes a novel sign-based social computing approach, called Sign Network, to represent and exchange semantically intero-perable...
Grammar Induction (or Grammar Inference or Language Learning) is the process of learning of a grammar from training data of the positive and negative strings of the language. Genetic algorithms are amongst the techniques which provide successful result for the grammar induction. This paper presents a stochastic Mutation Operator based on an Adapted Genetic Algorithm which works with random mask, with...
The face expressions are considered to be a significant part of the very important nonverbal information, needed to understand the other party's feelings in communications. In this work we proposed a system that facilitates the exchange of face expressions of players together with the standard communication content. We experimentally investigated the influence on the content of the communication and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.