Searching for authors named "Philippe Blache" – sorted by Relevance.
16 documents found, showing 1 through 10.
Next 10 →
-
Proof Nets for Controlling Ambiguity in Natural Language Processing
- …We propose in this paper the use of two kinds of constraints in order to control the evaluation of ambiguous structures. The first ones concern the immediate context of the words. In case of ambiguity, these constraints form a network controlling an ambiguous area. The second kind of constraints rel…
- Add To MetaCart
-
Une introduction `a HPSG
- … plus, cette pr'esentation s'appuie sur la description de ph'enom`enes syntaxiques tr`es vari'es. Il m'a sembl'e int'eressant, plutot que de faire un compte-rendu de lecture d'un ouvrage qui a d'ej`a 2 ans, de proposer une v'eritable introduction `a HPSG s'appuyant sur les derni`eres 'evolutions de …
- Add To MetaCart
-
Factorisation D'arbres a L'aide D'arbres Partages
- …e (2)). Ces solutions ne sont cependant pas totalement satisfaisantes. Les forets partag'ees de leur cot'e ne forment pas une structure unique. En d'autres termes, meme s'il s'agit d'une repr'esentation factoris'ee, celle-ci est limit'ee. Cette structure impose en effet un redoublement de l'informat…
- Add To MetaCart
-
Parsing Ambiguous Structures Using Controlled Disjunctions and Unary Quasi-Trees
- …The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first propose to use a particular kind of disjunctions called controlled disjunctions: these formulae allows the representation an…
- Cited by 5 (3 self) – Add To MetaCart
-
Shared Trees: Representing a Parse Forest with a Single Tree
- …We describe in this paper a method allowing to represent several trees with a single one. In a natural language processing perspective, this comes to represent a set of parses (which denotes an ambiguity) with a unique structure. This technique makes use of two notions: controlled disjunctions…
- Cited by 1 (1 self) – Add To MetaCart
-
Constraints, Linguistic Theories and Natural Language Processing
- …Introduction The notion of constraints is generally used in modern linguistics (in particular in syntax and phonology) for representing properties that an object must satisfy (see [Borsley96], [Sag99]). Constraints can be general (or universal), valid for different languages, or at the opposite very…
- Cited by 7 (1 self) – Add To MetaCart
-
Property Grammars and the Problem of Constraint Satisfaction
- … …
- Cited by 3 (1 self) – Add To MetaCart
-
A Non-Generative Constraint-Based Formalism
- …Most of modern linguistic theories rely on the notion of constraints. However, only few applications try to implement the parsing process directly with constraint programming: in most cases, constraints are interpreted in a passive sense, the parsing process itself being no different to that of clas…
- Add To MetaCart
-
Flexible Corpus Annotation with Property Grammars
- …We present in this paper a syntactic annotation project relying on a linguistic formalism called Property Grammars. This constraint-based formalism allows to encode different levels of syntactic information (the granularity description can be tuned according to the set of constraints to be verified)…
- Add To MetaCart
-
Aligning Prosody and Syntax in Property Grammars
- …We propose in this paper a new approach for representing the prosody/syntax interface. We use for this a particular formalism, called Property Grammars, in which all information is represented by means of constraints. We show how alignment constraints can implement such an interface. One of the int…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
