( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Some questions about non-termination in DCGs.

, , и . APPIA-GULP-PRODE, стр. 545-558. (1999)

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.

José Alejo Ferro Calvo

Isabella Ferron

Giulia Ferro Milone

Nino Ferro

Milene Ferro

 

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

Instrumentation of Synchronous Reactive Models for Performance Engineering., , и . ESEC, том 989 из Lecture Notes in Computer Science, стр. 76-89. Springer, (1995)Efficient Incremental Parsing for Context-Free Languages., и . ICCL, стр. 241-252. IEEE Computer Society, (1994)Semantic Similarity Between Sentences Through Approximate Tree Matching., , и . IbPRIA (2), том 3523 из Lecture Notes in Computer Science, стр. 638-646. Springer, (2005)Morphological and Syntactic Processing for Text Retrieval., , и . DEXA, том 3180 из Lecture Notes in Computer Science, стр. 371-380. Springer, (2004)A Common Solution for Tokenization and Part-of-Speech Tagging., , и . TSD, том 2448 из Lecture Notes in Computer Science, стр. 3-10. Springer, (2002)From Text to Knowledge., , и . EUROCAST, том 4739 из Lecture Notes in Computer Science, стр. 265-272. Springer, (2007)Mining conceptual graphs for knowledge acquisition., , и . CIKM-iNEWS, стр. 25-32. ACM, (2008)Searching for Asymptotic Error Repair., , и . CIAA, том 2608 из Lecture Notes in Computer Science, стр. 276-281. Springer, (2002)CoLesIR at CLEF 2007: from English to French via Character N-Grams., , и . CLEF (Working Notes), том 1173 из CEUR Workshop Proceedings, CEUR-WS.org, (2007)Bidirectional Automata for Tree Adjoining Grammars., , и . IWPT, Tsinghua University Press, (2001)