| 1 |
Simple K-star Categorial Dependency Grammars and their Inference
|
|
|
|
In: The 13th International Conference on Grammatical Inference (ICGI) ; https://hal.archives-ouvertes.fr/hal-01363393 ; The 13th International Conference on Grammatical Inference (ICGI), Oct 2016, Delft, Netherlands ; http://icgi2016.tudelft.nl/ (2016)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
|
|
|
|
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.archives-ouvertes.fr/hal-00821823 ; Theoretical Computer Science, Elsevier, 2012, 450, pp.22-30. ⟨10.1016/j.tcs.2012.04.024⟩ (2012)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages
|
|
|
|
In: 16th International Conference on Implementation and Application of Automata ; https://hal.archives-ouvertes.fr/hal-00820210 ; 16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.42-52, ⟨10.1007/978-3-642-22256-6⟩ (2011)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
|
|
|
|
In: 6th International Conference on Logical Aspects of Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-00820207 ; 6th International Conference on Logical Aspects of Computational Linguistics, Jun 2011, Montpellier, France. pp.80-95, ⟨10.1007/978-3-642-22221-4⟩ (2011)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
|
|
|
|
In: ISSN: 0098-9053 ; Linguistic Analysis ; https://hal.archives-ouvertes.fr/hal-00820204 ; Linguistic Analysis, David R. Willingham, 2010, 36 (1-4), pp.473-482 (2010)
|
|
Abstract:
International audience ; Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They resemble logical formalisms such as the Lambek calculus but have a polynomial parsing algorithm. This paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approach based on majority partial composition.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
|
|
URL: https://hal.archives-ouvertes.fr/hal-00820204
|
|
BASE
|
|
Hide details
|
|
|
| 6 |
Modèles algorithmiques de l'acquisition de la syntaxe : concepts et méthodes, résultats et problèmes
|
|
|
|
In: ISSN: 0986-6124 ; EISSN: 1958-9239 ; Recherches linguistiques de Vincennes ; https://hal.archives-ouvertes.fr/hal-00354043 ; Recherches linguistiques de Vincennes, Presses Universitaires de Vincennes, 2007, 36, pp.123--152 (2007)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Learnability of Pregroup Grammars
|
|
|
|
In: ISSN: 0039-3215 ; EISSN: 1572-8730 ; Studia Logica ; https://hal.inria.fr/inria-00191112 ; Studia Logica, Springer Verlag (Germany), 2007, pp.225-252. ⟨10.1007/s11225-007-9085-2⟩ (2007)
|
|
BASE
|
|
Show details
|
|
|
|
|
