DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 21 – 38 of 38

21
Describing São Tomense Using a Tree-Adjoining Meta-Grammar
In: 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11) ; https://hal.archives-ouvertes.fr/hal-00724847 ; 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11), Sep 2012, Paris, France. pp.82-89 (2012)
BASE
Show details
22
Cross-framework Grammar Engineering using Constraint-driven Metagrammars
In: 6th International Workshop on Constraint Solving and Language Processing (CSLP'11) ; https://hal.archives-ouvertes.fr/hal-00614661 ; 6th International Workshop on Constraint Solving and Language Processing (CSLP'11), Sep 2011, Karlsruhe, Germany. pp.32-43 (2011)
BASE
Show details
23
Intégrer des connaissances linguistiques dans un CRF : application à l'apprentissage d'un segmenteur-étiqueteur du français
In: TALN2011 ; TALN ; https://hal.archives-ouvertes.fr/hal-00620923 ; TALN, Jun 2011, Montpellier, France. pp.321 (2011)
BASE
Show details
24
Une Modélisation des Grammaires de Propriétés sous forme de Problème de Satisfaction de Contraintes
In: https://hal.archives-ouvertes.fr/hal-00533022 ; 2010 (2010)
BASE
Show details
25
Property Grammar Parsing Seen as a Constraint Optimization Problem
In: Proceedings of the 15th International Conference on Formal Grammar (FG 2010) ; https://hal.archives-ouvertes.fr/hal-00504684 ; Proceedings of the 15th International Conference on Formal Grammar (FG 2010), Aug 2010, Copenhagen, Denmark. pp.82-96 (2010)
BASE
Show details
26
A model-theoretic framework for grammaticality judgements
In: Conference on Formal Grammar (FG2009) ; https://hal.archives-ouvertes.fr/hal-00458937 ; Conference on Formal Grammar (FG2009), 2009, France. pp.1-14 (2009)
BASE
Show details
27
Metagrammar Redux
In: International Workshop on Constraint Solving and Language Processing - CSLP 2004 ; https://hal.inria.fr/inria-00100203 ; International Workshop on Constraint Solving and Language Processing - CSLP 2004, Sep 2004, Copenhagen, 16 p (2004)
BASE
Show details
28
A New Algorithm for Normal Dominance Constraints
In: ACM-SIAM Symposium on Discrete Algorithms - SODA'2003 ; https://hal.inria.fr/inria-00536536 ; ACM-SIAM Symposium on Discrete Algorithms - SODA'2003, Jan 2004, New Orleans, Louisiana, United States. pp.59-67 ; http://portal.acm.org/citation.cfm?id=982801 (2004)
BASE
Show details
29
A new algorithm for normal dominance constraints
BASE
Show details
30
Trees in linguistics, logic and computer science
Gabbay, Dov M. (Hrsg.); Goranko, Valentin (Hrsg.); Le Nir, Yannick (Mitarb.)...
In: Research on language and computation. - London : King's College 1 (2003) 3-4, 179-336
BLLDB
Show details
31
Configuration of Labeled Trees under Lexicalized Constraints and Principles
In: ISSN: 1570-7075 ; EISSN: 1572-8706 ; Research on Language and Computation ; https://hal.inria.fr/inria-00099678 ; Research on Language and Computation, Springer Verlag, 2003, 1 (3-4), pp.307-336 (2003)
BASE
Show details
32
An Efficient Graph Algorithm for Dominance Constraints
In: ISSN: 0196-6774 ; EISSN: 1090-2678 ; Journal of Algorithms in Cognition, Informatics and Logic ; https://hal.inria.fr/inria-00536539 ; Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2003, Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms, 48 (1), pp.194-219. ⟨10.1016/S0196-6774(03)00050-6⟩ ; http://portal.acm.org/citation.cfm?id=989537 (2003)
BASE
Show details
33
Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.inria.fr/inria-00099677 ; Theoretical Computer Science, Elsevier, 2003, 293 (2), pp.321-343 (2003)
BASE
Show details
34
An efficient graph algorithm for dominance constraints
BASE
Show details
35
Computing meaning
Bunt, Harry (Hrsg.); Muskens, Reinhard (Hrsg.); Thijsse, Elias (Hrsg.). - Dordrecht : Kluwer Acad. Publ., 2001
BLLDB
Show details
36
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms ; https://hal.inria.fr/inria-00536803 ; Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. pp.815--824 (2001)
BASE
Show details
37
Tree Descriptions, Constraints and Incrementality
In: Computing Meaning ; https://hal.inria.fr/inria-00100450 ; H. Bunt, R. Muskens and E. Thijsse (eds). Computing Meaning, Kluwer Academic Publishers, 23 p, 2001, Studies in Linguistics and Philosophy Series (2001)
BASE
Show details
38
Dominance Constraints with Set Operators
In: Proceedings of the First International Conference on Computational Logic ; https://hal.inria.fr/inria-00536806 ; Proceedings of the First International Conference on Computational Logic, 2000, London, United Kingdom. pp.326-341 (2000)
BASE
Show details

Page: 1 2

Catalogues
0
0
0
0
0
0
0
Bibliographies
2
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
36
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern