Search results for "Natural language"
showing 10 items of 650 documents
Measuring Semantic Coherence of a Conversation
2018
Conversational systems have become increasingly popular as a way for humans to interact with computers. To be able to provide intelligent responses, conversational systems must correctly model the structure and semantics of a conversation. We introduce the task of measuring semantic (in)coherence in a conversation with respect to background knowledge, which relies on the identification of semantic relations between concepts introduced during a conversation. We propose and evaluate graph-based and machine learning-based approaches for measuring semantic coherence using knowledge graphs, their vector space embeddings and word embedding models, as sources of background knowledge. We demonstrat…
EHeBby: An evocative humorist chat-bot
2008
A conversational agent, capable to have a "sense of humor" is presented. The agent can both generate humorous sentences and recognize humoristic expressions introduced by the user during the dialogue. EHeBby is an entertainment oriented conversational agent implemented using the ALICE framework embedded into an Yahoo! Messenger client. It is characterized by two areas: a rational, rule-based area and an evocative area. The first one is based on well founded techniques of computational humor and a standard AIML KB. The second one is based on a conceptual space, automatically induced by a corpus of funny documents, where KB items and user sentences are mapped. This area emulates an associativ…
Effective feature descriptor-based new framework for off-line text-independent writer identification
2018
Feature engineering is a key factor of machine learning applications. It is a fundamental process in writer identification of handwriting, which is an active and challenging field of research for many years. We propose a conceptually computationally efficient, yet simple and fast local descriptor referred to as Block Wise Local Binary Count (BW-LBC) for offline text-independent writer identification of handwritten documents. Proposed BW-LBC operator, which characterizes the writing style of each writer, is applied to a set of connected components extracted and cropped from scanned handwriting samples (documents or set of words/text lines) where each labeled component is seen as a texture im…
Automatic Content Analysis of Computer-Supported Collaborative Inquiry-Based Learning Using Deep Networks and Attention Mechanisms
2020
Computer-supported collaborative inquiry-based learning (CSCIL) represents a form of active learning in which students jointly pose questions and investigate them in technology-enhanced settings. Scaffolds can enhance CSCIL processes so that students can complete more challenging problems than they could without scaffolds. Scaffolding CSCIL, however, would optimally adapt to the needs of a specific context, group, and stage of the group's learning process. In CSCIL, the stage of the learning process can be characterized by the inquiry-based learning (IBL) phase (orientation, conceptualization, investigation, conclusion, and discussion). In this presentation, we illustrate the potential of a…
CitySearcher: A City Search Engine For Interests
2017
We introduce CitySearcher, a vertical search engine that searches for cities when queried for an interest. Generally in search engines, utilization of semantics between words is favorable for performance improvement. Even though ambiguous query words have multiple semantic meanings, search engines can return diversified results to satisfy different users' information needs. But for CitySearcher, mismatched semantic relationships can lead to extremely unsatisfactory results. For example, the city Sale would incorrectly rank high for the interest shopping because of semantic interpretations of the words. Thus in our system, the main challenge is to eliminate the mismatched semantic relationsh…
RECOGNIZABLE PICTURE LANGUAGES
1992
The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the undecidability of the emptiness problem. Then we define the new family of recognizable picture languages (denoted by REC). We study some combinatorial and language theoretic properties of REC such as ambiguity, closure properties or undecidability results. Finally we compare the family REC with the classical families of languages recognized by four-way a…
The potential of temporal analysis: Combining log data and lag sequential analysis to investigate temporal differences between scaffolded and non-sca…
2020
This paper contributes to the ongoing discussion about analysing the temporal aspects of learning processes in the educational technology research field. Our main aim was to advance methods for analysing temporal aspects of technology-enhanced learning (TEL) processes by introducing the temporal lag sequential analysis (TLSA) technique and by combining TLSA with temporal log data analysis (TLDA). Our secondary aim was to illustrate the potential of these two analysis techniques to reveal the differences between the face-to-face technology-enhanced collaborative inquiry-based learning (CIBL) processes of three different conditions (non-scaffolded, writing scaffolded and script scaffolded gro…
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
Latin Object and Subject Infinitive Clauses
2012
The paper is devoted to the theoretical and descriptive problems caused by Latin accusative with infinitive constructions. Latin infinitives can have an accusative subject also in constructions in which neither of the two conditions of accusative licensing by the matrix verb is satisfied: the matrix verb is intransitive, or the infinitive phrase is in subject or adjunct position, and furthermore, there is evidence of the infinitival clause also projhecting a CP - even if no visible complementizer is present. In Latin, the infinitive phrase is often coindexed with a third demonstrative pronoun, which allows the hypothesis that the infinitival CP (similar to an object that-clause) is base-gen…
Grammar based content completion method using Lua LPeg.re module
2014
A grammar based content completion method for Lua programming language and its LPeg.re module environment is described in this paper. The use of our method is not demanding in computing resources, as well as it is easy to add the content completion functionality to any target language grammar. We report on the application of our method for OWL Manchester syntax expression grammar, as well as custom database-to-ontology mapping language.