We present a novel approach to Computer Assisted Language Learning (CALL), using deep syntactic parsers and semantic based machine translation (MT) in diagnosing and providing explicit feedback on language learners’ errors. We are currently developing a proof of concept system showing how semantic-based machine translation can, in conjunction with robust computational grammars, be used to inter...

A communication protocol is realisable if it can be faithfully implemented in a distributed fashion by communicating agents. Pomsets offer way to compactly represent concurrency protocols and have been recently used for the purpose of realisability analysis. In this paper we focus on introduced branching pomsets, which also choices. We define well-formedness conditions inspired multiparty sessi...

Two experiments examined the effect of semantic interference on visual lexical decision (vLD) in normal skilled readers. Experiment 1 employed a dual-task paradigm to test whether nonverbal semantic processing disrupts visual word recognition when the orthographic structure of words and non-words is controlled. Experiment 2 employed the same paradigm to test whether participants strategically s...

After becoming part of the UML standard, OCL has been applied successfully in various domains. As a result, requirements to be met by future versions of OCL have evolved. A key requirement is to provide means for the formal integration of OCL and UML. Therefore, the latest proposal for a revised specification of OCL contains a metamodel defining the language concepts and semantics. Based on thi...

A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of transactions, a transactional workflow may be not wellformed. Moreover, only one workflow is allowed to execute a non-compensatable transaction with current scheduling protocol. In this paper, we present a transactional wor...

There is much evidence that visual recognition of morphologically complex words (e.g., teacher) proceeds via a decompositional route, first involving recognition of their component morphemes (teach + -er). According to the Full Decomposition model, after the visual decomposition stage, followed by morpheme lookup, there is a final "recombination" stage, in which the decomposed morphemes are com...

FLEX is a user interface to relational databases that can be used satisfactorily by users with different levels of expertise. FLEX is based on a formal query language, but is tolerant of incorrect input. It never rejects queries; instead, it adapts flexibly and transparently to their level of correctness and well-formedness, providing interpretations of corresponding accuracy and specificity. T...

This paper describes the similarities between task graphs and Petri nets and explains how a well formed task graph can be converted or transformed into a Petri net for verification, validation and checking using incidence matrix analysis, invariants and the reachability graph. A case study is presented, results and conclusions are given. Keywords—, Petri nets, Task Graphs, Transformation, Verif...

1 Syntax 2 1.1 Grammar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Operational semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Continuation-passing-style let-normal programs . . . . . . . . . . . . . . . . . . . . . 3 1.4 Type System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Ohala and Ohala (1986) present experimental results that are problematic for Chomsky and Halle’s (1968) model of phonotactic knowledge. They point out that the SPE theory does not distinguish between a word with one ill-formed structure and a word with multiple instances of ill-formedness. Cumulative ill-formedness equally plays no role in standard Optimality Theory (OT: Prince and Smolensky 20...