Strategies are proposed for combining different kinds of constraints in declarative grammars with a detachable layer of control information. The added control information is the basis for parametrized dynamically controlled linguistic deduction, a form of linguistic processing that permits the implementation of plausible linguistic performance models without giving up the declarative formulation of linguistic competence. The information can be used by the linguistic processor for ordering the sequence in which conjuncts and disjuncts are processed, for mixing depth-first and breadth-first search, for cutting off undesired derivations, and for constraint-relaxation
Grammars of natural language are highly complex objects. This complexity is reflected in formal anal...
This thesis considers the problem of assigning a sentence its syntactic structure, which may be disc...
The grammars of natural languages may be learned by using genetic algorithms that reproduce and muta...
Natural language processing requires flexible control of computation on various sorts of constraints...
The field of declarative AI programming is briefly characterized. Its recent developments in Germany...
The problem of grammatical inference is considered and a number of positive answers to decidability ...
AbstractAfter a brief survey of Discontinuous Grammar (DG), we propose local cost functions as a gen...
Congress on Evolutionary Computation, 2001. Seul, 27-30 May 2001In standard GP there are no constrai...
With the increasing capacity of AI systems the design of human--computer interfaces has become a fav...
We show that under certain conditions, a language model can be trained oil the basis of a second lan...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
Standard Functional Unification Grammars (FUGs) provide a structurally guided top-down control regim...
A major difficulty with logic programming is combinatorial explosion: since goals are solved with po...
This thesis addresses the problem of grounding linguistic analysis in control applica-tions, such as...
iel dieser Arbeit ist es, eine Umgebung zur Verfügung zu stellen, mit der Grammatiken zur robusten s...
Grammars of natural language are highly complex objects. This complexity is reflected in formal anal...
This thesis considers the problem of assigning a sentence its syntactic structure, which may be disc...
The grammars of natural languages may be learned by using genetic algorithms that reproduce and muta...
Natural language processing requires flexible control of computation on various sorts of constraints...
The field of declarative AI programming is briefly characterized. Its recent developments in Germany...
The problem of grammatical inference is considered and a number of positive answers to decidability ...
AbstractAfter a brief survey of Discontinuous Grammar (DG), we propose local cost functions as a gen...
Congress on Evolutionary Computation, 2001. Seul, 27-30 May 2001In standard GP there are no constrai...
With the increasing capacity of AI systems the design of human--computer interfaces has become a fav...
We show that under certain conditions, a language model can be trained oil the basis of a second lan...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
Standard Functional Unification Grammars (FUGs) provide a structurally guided top-down control regim...
A major difficulty with logic programming is combinatorial explosion: since goals are solved with po...
This thesis addresses the problem of grounding linguistic analysis in control applica-tions, such as...
iel dieser Arbeit ist es, eine Umgebung zur Verfügung zu stellen, mit der Grammatiken zur robusten s...
Grammars of natural language are highly complex objects. This complexity is reflected in formal anal...
This thesis considers the problem of assigning a sentence its syntactic structure, which may be disc...
The grammars of natural languages may be learned by using genetic algorithms that reproduce and muta...