International audienceWe present an operational framework allowing to express a large scale Tree Adjoining Grammar (TAG) by using higher level operational constraints on tree descriptions. These constraints first meant to guarantee the well formedness of the grammatical units may also be viewed as a way to put model theoretic syntax at work through an efficient offline grammatical compilation process. Our strategy preserves TAG formal properties, hence ensures a reasonable processing efficiency
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
We present an operational framework al-lowing to express a large scale Tree Ad-joining Grammar (TAG)...
National audienceIn this paper, we introduce an extension of the XMG system (eXtensible MetaGrammar)...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
International audienceHighly compacted TAGs may be built by allowing subtree factorization operators...
International audienceHighly compacted TAGs may be built by allowing subtree factorization operators...
In this paper, we introduce an extension of the XMG system (eXtensibleMeta-Grammar) in order to allo...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
12 pages. Poster sessionInternational audienceIn this paper we introduce XMG (eXtensible MetaGrammar...
Rapport interne.We propose a meta-grammatical framework for dependency grammar, accommodating any nu...
International audienceIn contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Gr...
Demo session. Available at http://aclweb.org/anthology/E/E06/E06-2005.pdfInternational audienceIn th...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
We present an operational framework al-lowing to express a large scale Tree Ad-joining Grammar (TAG)...
National audienceIn this paper, we introduce an extension of the XMG system (eXtensible MetaGrammar)...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
International audienceHighly compacted TAGs may be built by allowing subtree factorization operators...
International audienceHighly compacted TAGs may be built by allowing subtree factorization operators...
In this paper, we introduce an extension of the XMG system (eXtensibleMeta-Grammar) in order to allo...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
International audienceIn this article, we introduce eXtensible MetaGrammar (xmg), a framework for sp...
12 pages. Poster sessionInternational audienceIn this paper we introduce XMG (eXtensible MetaGrammar...
Rapport interne.We propose a meta-grammatical framework for dependency grammar, accommodating any nu...
International audienceIn contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Gr...
Demo session. Available at http://aclweb.org/anthology/E/E06/E06-2005.pdfInternational audienceIn th...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceFor a large number of applications in Natural Language Processing (NLP) (e.g.,...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...