Lexical disambiguation with polarities and automata

We propose a method for lexical disambiguation based on polarities for Interaction Grammars. We also show how to cope with coordination

Interaction Grammars

Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying criteria of saturation and minimality

Lexical Disambiguation in LTAG using Left Context

International audienceIn this paper, we present an optimization for parsing with Lexicalized Tree-Adjoining Grammar which takes inspiration from previous work on polarity based grammar abstraction (Bonfante et al., 2004). We illustrate the impact of this optimization on two benchmarks and we relate our approach to the more general optimization framework proposed for Interaction Grammars by (Bonfante et al., 2009) and (Morey et al., 2011)

Lexical Disambiguation in LTAG using Left Context

International audienceIn this paper, we present an automaton-based lexical disambiguation process for Lexicalized Tree-Adjoining Grammar (LTAG). This process builds on previous work of Bonfante et al. (2004), and extends it by computing a polarity-based abstraction, which contains information about left context. This extension allows for a faster lexical disambiguation by reducing the filtering automaton

Adapting polarised disambiguation to surface realisation

The aim of surface realisation is to produce a string from an input semantics. The task may be viewed as the inverse of parsing, and like parsing, it is made more difficult by the problem of lexical ambiguity in natural language. (Bonfante, Guillaume, and Perrier 2004) propose a polarisation technique for parsing that greatly reduces the effects of ambiguity. We show how polarisation can be adapted for surface realisation and how to address two complications which arise: multi and zero-literal semantic input

Word Order Constraints for Lexical Disambiguation of Interaction Grammars

International audienceWe propose a new method to perform lexical disambiguation of Interaction Grammars. It deals with the order constraints on words. Actually, the soundness of the method is due to an invariant property of the parsing of an Interaction Grammar. We show how this invariant can be computed statically from the grammar

INtersection Optimization is NP-Complete

International audienceFinite state methods for natural language processing often require the con- struction and the intersection of several automata. In this paper we investigate the question of determining the best order in which these intersections should be performed. We take as an example lexical disambiguation in polarity gram- mars. We show that there is no efficient way to minimize the state complexity of these intersections

TuLiPA : a syntax-semantics parsing environment for mildly context-sensitive formalisms

In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semantic representations

SemTAG, the LORIA toolbox for TAG-based Parsing and Generation

In this paper, we introduce SemTAG, a toolbox for TAG-based parsing and generation. This environment supports the development of wide-coverage grammars and differs from existing environments for TAG such as XTAG, in that it includes a semantic dimension. SemTAG is open-source and freely available

Analyse déductive pour les grammaires d'interaction

We propose a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives on this problem, departing from previous methods relying on constraint-solving techniques to interpret it as a graph-rewriting problem. Furthermore, this presentation allows a standard description of the algorithm and a fine-grained inspection of the sources of non-determinism