( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fully Lexicalized Pregroup Grammars.

, и . WoLLIC, том 4576 из Lecture Notes in Computer Science, стр. 12-25. Springer, (2007)

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.

Nicolas Béchet

Tom Bechet

George Bechet

Wladimir Denisow

Jaap Denissen

 

Другие публикации лиц с тем же именем

Categorial grammars with iterated types form a strict hierarchy of k-valued languages., , и . Theor. Comput. Sci., (2012)Learnability of Pregroup Grammars., , и . Stud Logica, 87 (2-3): 225-252 (2007)k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures., и . WoLLIC, том 84 из Electronic Notes in Theoretical Computer Science, стр. 60-72. Elsevier, (2003)CDGFr, un corpus en dépendances non-projectives pour le français., и . TALN, стр. 206-212. ATALA, (2015)Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces.. IWPT, стр. 31-42. (2003)Dependency Structure Grammars., , и . LACL, том 3492 из Lecture Notes in Computer Science, стр. 18-34. Springer, (2005)Incremental learning of iterated dependencies., и . Mach. Learn., 113 (5): 2841-2875 (мая 2024)Learnability of Pregroup Grammars., , и . ICGI, том 3264 из Lecture Notes in Computer Science, стр. 65-76. Springer, (2004)Constructing Different Phonological Bracketings from a Proof Net., и . LACL, том 1328 из Lecture Notes in Computer Science, стр. 118-133. Springer, (1996)Partial Evaluation of Interaction Nets.. WSA, том 81-82 из Series Bigre, стр. 331-338. Atelier Irisa, IRISA, Campus de Beaulieu, (1992)