( en | de | ru )

 

Disambiguation of "Foret, Annie"

Author of the publication

copydeleteadd this publication to your clipboard
Two Models of Learning Iterated Dependencies.

, , and . FG, volume 7395 of Lecture Notes in Computer Science, page 17-32. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gilles Forêt

Maik Annies

Sylvia Annies

Michael Foreta

Roger Annies

 

Other publications of authors with the same name

Categorial grammars with iterated types form a strict hierarchy of k-valued languages., , and . Theor. Comput. Sci., (2012)Dependency Structure Grammars., , and . LACL, volume 3492 of Lecture Notes in Computer Science, page 18-34. Springer, (2005)Learnability of Pregroup Grammars., , and . Stud Logica, 87 (2-3): 225-252 (2007)On Limit Points for Some Variants of Rigid Lambek Grammars., and . ICGI, volume 2484 of Lecture Notes in Computer Science, page 106-119. Springer, (2002)On Harmonic CCG and Pregroup Grammars.. LACL, volume 8535 of Lecture Notes in Computer Science, page 83-95. Springer, (2014)Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages., , and . CIAA, volume 6807 of Lecture Notes in Computer Science, page 42-52. Springer, (2011)Pregroup Calculus as a Logic Functor.. WoLLIC, volume 4576 of Lecture Notes in Computer Science, page 147-161. Springer, (2007)On Associative Lambek Calculus Extended with Basic Proper Axioms.. Categories and Types in Logic, Language, and Physics, volume 8222 of Lecture Notes in Computer Science, page 172-187. Springer, (2014)Remarques et perspectives sur les langages de prégroupe d'ordre 1/2., and . TALN (Posters), page 309-314. ATALA, (2003)k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages., and . LACL, volume 3492 of Lecture Notes in Computer Science, page 1-17. Springer, (2005)