1 |
Strong Learning of Probabilistic Tree Adjoining Grammars
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2021)
|
|
BASE
|
|
Show details
|
|
2 |
Minimalist Grammars in the Light of Logic
|
|
|
|
In: https://hal.inria.fr/inria-00563807 ; [Research Report] 2011, pp.39 (2011)
|
|
BASE
|
|
Show details
|
|
3 |
The Copying Power of Well-Nested Multiple Context-Free Grammars
|
|
|
|
In: Language and Automata Theory and Applications ; https://hal.inria.fr/inria-00525077 ; Language and Automata Theory and Applications, 2010, Trier, Germany. pp.344-355, ⟨10.1007/978-3-642-13089-2_29⟩ ; http://www.springerlink.com/content/b8w7r53761614lk7/ (2010)
|
|
BASE
|
|
Show details
|
|
4 |
On the relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
|
|
|
|
In: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008) ; https://hal.inria.fr/inria-00232587 ; 2nd International Conference on Language and Automata Theory and Applications (LATA 2008), Research Group on Mathematical Linguistics at Universitat Rovira i Virgili University, Mar 2008, Tarragona, Spain. pp.263-274 (2008)
|
|
Abstract:
International audience ; This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this paper, we will put an additional limitation on the derivations licensed in TT-MCTAG. We show that TT-MCTAG with this additional limitation can be transformed into equivalent simple RCGs. This result is interesting for theoretical reasons (since it shows that TT-MCTAG in this limited form is mildly context-sensitive) and, furthermore, even for practical reasons: We use the proposed transformation from TT-MCTAG to RCG in an actual parser that we have implemented.
|
|
Keyword:
[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]; [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; mildly context sensitive grammatical formalisms; multi-component tree adjoining grammar with tree tuples; parsing; range concatenation grammars
|
|
URL: https://hal.inria.fr/inria-00232587/file/ttmctag-rcg.pdf https://hal.inria.fr/inria-00232587/document https://hal.inria.fr/inria-00232587
|
|
BASE
|
|
Hide details
|
|
5 |
Type logic served by co-Merge, Merge and Move: an account for sluicing and questions of “common European” and Japanese types
|
|
|
|
In: Syntactic structures / Синтаксические Структуры (Sintaksicheskie struktury) ; https://hal.inria.fr/inria-00138201 ; Syntactic structures / Синтаксические Структуры (Sintaksicheskie struktury), A.B. Letuchiy, V.S. Volk, N.A. Korotkova, Ya.G. Testelets, Apr 2007, Moscow, Russia (2007)
|
|
BASE
|
|
Show details
|
|
6 |
A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars
|
|
|
|
In: https://hal.inria.fr/inria-00117306 ; [Research Report] RR-6042, INRIA. 2006, pp.67 (2006)
|
|
BASE
|
|
Show details
|
|
7 |
Encoding second order string ACG with Deterministic Tree Walking Transducers.
|
|
|
|
In: The 11th conference on Formal Grammar ; https://hal.inria.fr/inria-00333886 ; The 11th conference on Formal Grammar, Paola Monachesi; Gerald Penn; Giorgio Satta; Shuly Wintner, 2006, Malaga, Spain. pp.143-156 (2006)
|
|
BASE
|
|
Show details
|
|
8 |
Parsing TAG with Abstract Categorial Grammar.
|
|
|
|
In: TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms ; https://hal.inria.fr/inria-00334009 ; TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006, Sidney, Australia (2006)
|
|
BASE
|
|
Show details
|
|
9 |
Learning Recursive Automata from Positive Examples
|
|
|
|
In: ISSN: 0992-499X ; EISSN: 1958-5748 ; Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle ; https://hal.inria.fr/inria-00470101 ; Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006, New Methods in Machine Learning. Theory and Applications, 20 (6), pp.775-804. ⟨10.3166/ria.20.775-804⟩ (2006)
|
|
BASE
|
|
Show details
|
|
10 |
Consolidating the Results of the CIRCSIM-Tutor Project and Further Consolidation of the Results of the CIRCSIM-Tutor Project
|
|
|
|
In: DTIC AND NTIS (2003)
|
|
BASE
|
|
Show details
|
|
11 |
Language Independent NER using a Unified Model of Internal and Contextual Evidence
|
|
|
|
In: DTIC (2002)
|
|
BASE
|
|
Show details
|
|
12 |
Chinese Numbers, MIX, Scrambling, and Range Concatenation Grammars
|
|
|
|
In: https://hal.inria.fr/inria-00073064 ; [Research Report] RR-3614, INRIA. 1999 (1999)
|
|
BASE
|
|
Show details
|
|
13 |
A Methodological Study: A Semiotic Approach to Analyzing the Content of Information
|
|
|
|
In: DTIC AND NTIS (1996)
|
|
BASE
|
|
Show details
|
|
14 |
Language and Logic: Research in the Formalization of Discourse.
|
|
|
|
In: DTIC AND NTIS (1996)
|
|
BASE
|
|
Show details
|
|
15 |
Centering: A Framework for Modelling the Local Coherence of Discourse
|
|
|
|
In: DTIC AND NTIS (1995)
|
|
BASE
|
|
Show details
|
|
16 |
Perceptions of Coherence and Usability in Environmental Impact Documents As Functions of Visual and Linguistic Cues.
|
|
|
|
In: DTIC AND NTIS (1995)
|
|
BASE
|
|
Show details
|
|
17 |
The Unsupervised Acquisition of a Lexicon from Continuous Speech.
|
|
|
|
In: DTIC AND NTIS (1995)
|
|
BASE
|
|
Show details
|
|
18 |
Text-To-Speech Phrasing Enhancement System Using Neural Networks.
|
|
|
|
In: DTIC AND NTIS (1995)
|
|
BASE
|
|
Show details
|
|
19 |
BBN: Description of the PLUM System as Used for MUC-5
|
|
|
|
In: DTIC (1993)
|
|
BASE
|
|
Show details
|
|
20 |
Labelled Formal Languages and Their Uses.
|
|
|
|
In: DTIC AND NTIS (1991)
|
|
BASE
|
|
Show details
|
|
|
|