( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Approach to Infinite Terms Traversal in DCGs.

, , и . APPIA-GULP-PRODE, стр. 307-318. (1997)

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.

Maria Margarida Souto-Carneiro

Juan Souto Clement

Claudio Souto

Antonio Souto

Eliana Maria Barbosa Souto

 

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

Construction of Efficient Generalized LR Parsers., , и . Workshop on Implementing Automata, том 1436 из Lecture Notes in Computer Science, стр. 7-24. Springer, (1997)COLE Experiments at QA@CLEF 2004 Spanish Monolingual Track., , и . CLEF, том 3491 из Lecture Notes in Computer Science, стр. 544-551. Springer, (2004)On the Representation of Imperative Programs in a Logical Framework., , , и . EUROCAST, том 4739 из Lecture Notes in Computer Science, стр. 202-209. Springer, (2007)A tabular interpretation of bottom-up automata for TAG., , и . TAG+, стр. 42-45. Institute for Research in Cognitive Science, (1998)A Comparison for Unification-Based Parsers., , и . APPIA-GULP-PRODE, стр. 113-124. (1998)The Editing Distance in Shared Forest., , и . IWPT, стр. 323-324. (2000)Dynamic Programming as Frame for Efficient Parsing., , и . SCCC, стр. 68-75. IEEE Computer Society, (1998)GALENA: Tabular DCG Parsing for Natural Languages., , , и . TAPD, стр. 44-51. INRIA, (1998)COLE at CLEF 2004: Rapid Prototyping of a QA System for Spanish., , и . CLEF (Working Notes), том 1170 из CEUR Workshop Proceedings, CEUR-WS.org, (2004)An Opterational Model for Parsing Definite Clause Grammars with Infinite Terms., , и . LACL, том 1582 из Lecture Notes in Computer Science, стр. 212-230. Springer, (1997)