Add to ORKGInternational audienceMinimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Abstract. Dominance links were introduced in grammars to model long dis-tance scrambling phenomena, ...
International audienceWe show that a practical translation of MRS descriptions into normal dominance...
International audienceWe define a back-and-forth translation between Hole Semantics and dominance co...
We define a back-and-forth translation between Hole Semantics and dominance constraints, two formali...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
We introduce a robust statistical approach to realization from Minimal Recursion Semantics represent...
We define a back-and-forth translation between Hole Semantics and dominance constraints, two formali...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
International audienceDominance constraints for finite tree structures are widely used in several ar...
The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions ...
We present an approach to discriminant-based MRS banking, i.e. the construction of an annotated corp...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Abstract. Dominance links were introduced in grammars to model long dis-tance scrambling phenomena, ...
International audienceWe show that a practical translation of MRS descriptions into normal dominance...
International audienceWe define a back-and-forth translation between Hole Semantics and dominance co...
We define a back-and-forth translation between Hole Semantics and dominance constraints, two formali...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific res...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
We introduce a robust statistical approach to realization from Minimal Recursion Semantics represent...
We define a back-and-forth translation between Hole Semantics and dominance constraints, two formali...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
International audienceDominance constraints for finite tree structures are widely used in several ar...
The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions ...
We present an approach to discriminant-based MRS banking, i.e. the construction of an annotated corp...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Abstract. Dominance links were introduced in grammars to model long dis-tance scrambling phenomena, ...