Results 1 - 10
of
604
Language using Finite State Methods
, 2015
"... Abstract: The need for understanding what has lead to a fail-ure in a computer system is crucial for addressing problems with such systems. In this report we present a meta-NLG system that can be configured to generate natural explanations from error trace data originating in an external computation ..."
Abstract
- Add to MetaCart
computational system. Distinguish-ing features are the generic nature of the system, and the underlying technology which is finite-state. Results of a two-pronged evaluation dealing with naturalness and ease of use are described.
From Arguments in Natural Language to Argumentation Frameworks∗
, 2010
"... For argumentation useful, the means must be found overcome the knowledge acquisition bottleneck between the source material and the translation into and out of an argumentation formalism. As source material is often expressed and understood in natural language, we should consider how to translate na ..."
Abstract
- Add to MetaCart
natural language arguments. The current state of the art in argumentation does not have any formal translation method. In this paper, we discuss this lacuna. First, there are robust, wide-coverage computational linguistic systems which au-tomatically translate multi-sentential structures into first order
On the Implementation of Finite State Patterns
"... : Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [1] that is commonly used to implement FSMs in OO languages, also ..."
Abstract
- Add to MetaCart
: Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [1] that is commonly used to implement FSMs in OO languages, also
Stochastic Finite State Automata Language Model Triggered by Dialogue States
, 2001
"... Within the framework of Natural Spoken Dialogue systems, this paper describes a method for dynamically adapting a Language Model (LM) to the dialogue states detected. This LM combines a standard n-gram model with Stochastic Finite State Automata (SFSAs). During the training process, the sentence cor ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Within the framework of Natural Spoken Dialogue systems, this paper describes a method for dynamically adapting a Language Model (LM) to the dialogue states detected. This LM combines a standard n-gram model with Stochastic Finite State Automata (SFSAs). During the training process, the sentence
REXTOR: A System for Generating Relations
"... from Natural Language This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finitestate gra ..."
Abstract
- Add to MetaCart
from Natural Language This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finitestate
REXTOR: A System for Generating Relations
"... from Natural Language This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finitestate gra ..."
Abstract
- Add to MetaCart
from Natural Language This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finitestate
First steps in programming: A rationale for attention investment models.
- In Proc. HCC, IEEE
, 2002
"... Abstract Research into the cognitive aspects of programming originated in the study of professional programmers (whether experts or students). Even "end-user" programmers What is Programming? Goodell's excellent website devoted to end user programming Programming is in fact seld ..."
Abstract
-
Cited by 110 (16 self)
- Add to MetaCart
;spadework" of finding a precise mathematical formulation and method of solution, possibly notated in a "convenient problem-oriented language" whose symbols are "more closely related to the mathematical problem to be solved". The major changes since this was written are a) that many computer users do
Materials for an exploratory theory of the network society.
- The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract
-
Cited by 122 (0 self)
- Add to MetaCart
the construction of an analytical framework that could inform, and better organize, further research. However, given the dif culty of the task, and the necessarily collective character of this endeavour, what is presented here should be considered, literally, as materials to be used in the building of a
Using Markov Decision Process for Learning Dialogue Strategies
- Proc. ICASSP
, 1998
"... In this paper we introduce a stochastic model for dialogue systems based on Markov decision process. Within this framework we show that the problem of dialogue strategy design can be stated as an optimization problem, and solved by a variety of methods, including the reinforcement learning approach. ..."
Abstract
-
Cited by 71 (2 self)
- Add to MetaCart
In this paper we introduce a stochastic model for dialogue systems based on Markov decision process. Within this framework we show that the problem of dialogue strategy design can be stated as an optimization problem, and solved by a variety of methods, including the reinforcement learning approach
Abstraction-Based Generation of Finite State Models from C Programs
, 2002
"... Model checking is a major advancement in the quest for practical automatic verification methods for computer systems, and has been effectively used to discover flaws in real-world hardware systems. Unfortunately, applying model-checking techniques to software systems has proved to be more difficult, ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
, due to the large number of states and irregular transitions of such systems. One promising method for generating reasonably-sized models from programs is the use of data abstraction, in which the program data is mapped from a large set of possible values to a much smaller set of abstract values
Results 1 - 10
of
604