David Cabrero Souto

Orcid: 0000-0002-9432-8343

According to our database1, David Cabrero Souto authored at least 16 papers between 1997 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
On the Representation of Imperative Programs in a Logical Framework.
Proceedings of the Computer Aided Systems Theory, 2007

2004
COLE Experiments at QA@CLEF 2004 Spanish Monolingual Track.
Proceedings of the Multilingual Information Access for Text, 2004

COLE at CLEF 2004: Rapid Prototyping of a QA System for Spanish.
Proceedings of the Working Notes for CLEF 2004 Workshop co-located with the 8th European Conference on Digital Libraries (ECDL 2004), 2004

2002
Programación dinámica y Análisis Parcial.
Proces. del Leng. Natural, 2002

2001
Generación automática de familias morfológicas mediante morfología derivativa productiva.
Proces. del Leng. Natural, 2001

Applying Productive Derivational Morphology to Term Indexing of Spanish Texts.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2001

2000
The Editing Distance in Shared Forest.
Proceedings of the Sixth Internatonal Workshop on Parsing Technologies, 2000

1999
Tabular Algorithms for TAG Parsing.
Proceedings of the EACL 1999, 1999

Some questions about non-termination in DCGs.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
GALENA: Tabular DCG Parsing for Natural Languages.
Proceedings of the 1st Workshop on Tabulation in Parsing and Deduction, 1998

A tabular interpretation of bottom-up automata for TAG.
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, 1998

Dynamic Programming as Frame for Efficient Parsing.
Proceedings of 18th International Conference of the Chilean Computer Science Society (SCCC '98), 1998

A Comparison for Unification-Based Parsers.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
Construction of Efficient Generalized LR Parsers.
Proceedings of the Automata Implementation, 1997

An Opterational Model for Parsing Definite Clause Grammars with Infinite Terms.
Proceedings of the Logical Aspects of Computational Linguistics, 1997

An Approach to Infinite Terms Traversal in DCGs.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997


  Loading...