Results 1  10
of
10
A fuzzy approach to erroneous inputs in contextfree language recognition
 Dept. of Comp. Sci., Twente University of Technology
, 1995
"... Abstract − Using fuzzy contextfree grammars one can easily describe a finite number of ways to derive incorrect strings together with their degree of correctness. However, in general there is an infinite number of ways to perform a certain task wrongly. In this paper we introduce a generalization o ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Abstract − Using fuzzy contextfree grammars one can easily describe a finite number of ways to derive incorrect strings together with their degree of correctness. However, in general there is an infinite number of ways to perform a certain task wrongly. In this paper we introduce a generalization of fuzzy contextfree grammars, the socalled fuzzy contextfree Kgrammars, to model the situation of making a finite choice out of an infinity of possible grammatical errors during each contextfree derivation step. Under minor assumptions on the parameter K this model happens to be a very general framework to describe correctly as well as erroneously derived sentences by a single generating mechanism. Our first result characterizes the generating capacity of these fuzzy contextfree Kgrammars. As consequences we obtain: (i) bounds on modeling grammatical errors within the framework of fuzzy contextfree grammars, and (ii) the fact that the family of languages generated by fuzzy contextfree Kgrammars shares closure properties very similar to those of the family of ordinary contextfree languages. The second part of the paper is devoted to a few algorithms to recognize fuzzy contextfree languages: viz. a variant of a functional version of Cocke−Younger− Kasami’s algorithm and some recursive descent algorithms. These algorithms turn out to be robust in some very elementary sense and they can easily be extended to corresponding parsing algorithms. 1.
The nonselfembedding property for generalized fuzzy contextfree grammars
 Publ. Math. Debrecen
, 1999
"... Abstract. A fuzzy contextfree Kgrammar is a fuzzy contextfree grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol α, the set containing all righthand sides of rules with lefthand side equal to α forms a fuzzy language that belongs to ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
Abstract. A fuzzy contextfree Kgrammar is a fuzzy contextfree grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol α, the set containing all righthand sides of rules with lefthand side equal to α forms a fuzzy language that belongs to a given family K of fuzzy languages. In this paper we study the effect of the nonselfembedding restriction on the generating power of fuzzy contextfree Kgrammars. Our main result shows that under weak assumptions on the family K, a fuzzy language is generated by a nonselfembedding fuzzy contextfree Kgrammar if and only if either it is a fuzzy regular language or it belongs to the substitution closure K ∞ of the family K. The proof heavily relies on the closure properties of the families K and K∞. 1
The Role of Robust Semantic Analysis in Spoken Language Dialogue Systems
, 2000
"... this paper we will detail the functionality of the semantic module. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
this paper we will detail the functionality of the semantic module.
ISIS: Interaction through Speech with Information Systems
 Proceedings of the 3rd International Workshop, TSD 2000
, 2000
"... We present the result of an experimental system aimed at performing a robust semantic analysis of analyzed speech input in the are of information system access. The goal of this experiment was to investigate the eectiveness of such a system in a pipelined architecture, where no control is possible ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present the result of an experimental system aimed at performing a robust semantic analysis of analyzed speech input in the are of information system access. The goal of this experiment was to investigate the eectiveness of such a system in a pipelined architecture, where no control is possible over the morphosyntactic analysis which precedes the semantic analysis and query formation. 1 Introduction The general applicative framework of the ISIS project 1 was to design an information system NLP interface for automated telephonebased phonebook inquiry. The objective of the project was to dene an architecture to improve speech recognition results by integrating higher level linguistic knowledge. The availability of a huge collection of annotated telephone calls for querying the Swiss phonebook database (i.e the Swiss French PolyPhone corpus [6]) allowed us to propose and evaluate a very rst functional prototype of software architecture for vocal access to database through...
ISIS Project: Final Report
 Characteristics of Electronic Abstracts (Library Information Technology
, 1999
"... This report first presents a description of the database and then further details what has been achieved in the latter workpackages. 2 Data ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This report first presents a description of the database and then further details what has been achieved in the latter workpackages. 2 Data
Semantic Filtering by inference on domain knowledge in spoken language dialogue systems
 Proceedings of the LREC2000
, 2000
"... General natural dialogue processing requires large amounts of domain knowledge as well as linguistic knowledge in order to ensure acceptable coverage and understanding. There are several ways of integrating lexical resources (e.g. dictionaries, thesauri) and knowledge bases or ontologies at differen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
General natural dialogue processing requires large amounts of domain knowledge as well as linguistic knowledge in order to ensure acceptable coverage and understanding. There are several ways of integrating lexical resources (e.g. dictionaries, thesauri) and knowledge bases or ontologies at different levels of dialogue processing. We concentrate in this paper on how to exploit domain knowledge for filtering interpretation hypotheses generated by a robust semantic parser. We use domain knowledge to semantically constrain the hypothesis space. Moreover, adding an inference mechanism allows us to complete the interpretation when information is not explicitly available. Further, we discuss briefly how this can be generalized towards a predictive natural interactive system.
Weighted Semantic Parsing: A Robust Approach to Interpretation of Natural Language Queries
, 2000
"... This paper focuses on a grammarbased approach to semantic interpretation, which combines the notions of robust and weighted parsing. In restricted domains of application in information extraction and natural language speech based information systems this approach may show acceptable performance. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper focuses on a grammarbased approach to semantic interpretation, which combines the notions of robust and weighted parsing. In restricted domains of application in information extraction and natural language speech based information systems this approach may show acceptable performance. We present an overview of our research carried out within the recent concluded project ISIS (Interaction through Speech with Information Systems) where techniques based on the above notions have been applied.
Controlled fuzzy parallel rewriting
 New Trends in Formal Languages — Control, Cooperation, and Combinatorics (1997), Lect. Notes. in Comp. Sci. 1218
"... Abstract. We study a Lindenmayerlike parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivationcontrolled iteration grammar. Under minor assumptions on the family of control lan ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We study a Lindenmayerlike parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivationcontrolled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show that (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyperAFFL, i.e., a hyperalgebraically closed full Abstract Family of Fuzzy Languages. 1.
HERALD: Hybrid Environment for Robust Analysis of Language Data
, 1999
"... This project addresses the problem of performing structural and semantic analysis of data where the syntactic and semantic models of the domain are inadequate, and robust methods must be employed to perform a "best approximation" to a complete analysis. This problem is particularly pertinent in th ..."
Abstract
 Add to MetaCart
This project addresses the problem of performing structural and semantic analysis of data where the syntactic and semantic models of the domain are inadequate, and robust methods must be employed to perform a "best approximation" to a complete analysis. This problem is particularly pertinent in the domain of text analysis. The ability to deal with large amounts of possibly illformed or unforeseen text is one of the principal objectives of current research in Natural Language Processing by computer (NLP), an ability which is particularly necessary for advanced information extraction and retrieval from large textual corpora. The results of this work can, however, be applied in other domains where a mix of partial grammatical and semantic models exist, such as in image analysis. The project builds on previous FNSRS projects by the proposers. In particular it integrates discourse analysis methods is a direct continuation of FNSRS project ROTA which addressed the problems of develo...
Algebraic Aspects of Families of Fuzzy Languages
"... We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the concep ..."
Abstract
 Add to MetaCart
We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the concept of full Abstract Family of Fuzzy Languages or full AFFL. This algebraic structure is the fuzzy counterpart of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., nonfuzzy) languages. In the second part of the paper we focus our attention to full AFFL’s closed under iterated parallel fuzzy substitution, where the iterating process is prescribed by given crisp control languages. Proceeding inductively over the family of these control languages, yields an infinite sequence of full AFFLstructures with increasingly stronger closure properties.