1 |
Strong Learning of Probabilistic Tree Adjoining Grammars
|
|
|
|
In: Proceedings of the Society for Computation in Linguistics (2021)
|
|
BASE
|
|
Show details
|
|
2 |
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)
|
|
BASE
|
|
Show details
|
|
3 |
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
|
|
4 |
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
|
|
5 |
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
|
|
|
|