Carlos A. Prolo

Also published as: Carlos Prolo


2018

pdf bib
Towards a Language for Natural Language Treebank Transductions
Carlos A. Prolo
Proceedings of the 27th International Conference on Computational Linguistics

This paper describes a transduction language suitable for natural language treebank transformations and motivates its application to tasks that have been used and described in the literature. The language, which is the basis for a tree transduction tool allows for clean, precise and concise description of what has been very confusingly, ambiguously, and incompletely textually described in the literature also allowing easy non-hard-coded implementation. We also aim at getting feedback from the NLP community to eventually converge to a de facto standard for such transduction language.

2012

pdf bib
A Fast, Memory Efficient, Scalable and Multilingual Dictionary Retriever
Paulo Fernandes | Lucelene Lopes | Carlos A. Prolo | Afonso Sales | Renata Vieira
Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)

This paper presents a novel approach to deal with dictionary retrieval. This new approach is based on a very efficient and scalable theoretical structure called Multi-Terminal Multi-valued Decision Diagrams (MTMDD). Such tool allows the definition of very large, even multilingual, dictionaries without significant increase in memory demands, and also with virtually no additional processing cost. Besides the general idea of the novel approach, this paper presents a description of the technologies involved, and their implementation in a software package called WAGGER. Finally, we also present some examples of usage and possible applications of this dictionary retriever.

2006

pdf bib
Handling Unlike Coordinated Phrases in TAG by Mixing Syntactic Category and Grammatical Function
Carlos A. Prolo
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms

2002

pdf bib
Fast LR parsing Using Rich (Tree Adjoining) Grammars
Carlos A. Prolo
Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing (EMNLP 2002)

pdf bib
A Classification of Grammar Development Strategies
Alexandra Kinyon | Carlos A. Prolo
COLING-02: Grammar Engineering and Evaluation

pdf bib
Coping with Problems in Grammars Automatically Extracted from Treebanks
Carlos A. Prolo
COLING-02: Grammar Engineering and Evaluation

pdf bib
Systematic Grammar Development in the XTAG Project
Carlos Prolo
Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6)

pdf bib
Identifying Verb Arguments and their Syntactic Function in the Penn Treebank
Alexandra Kinyon | Carlos A. Prolo
Proceedings of the Third International Conference on Language Resources and Evaluation (LREC’02)

pdf bib
Generating the XTAG English Grammar Using Metarules
Carlos A. Prolo
COLING 2002: The 19th International Conference on Computational Linguistics

2000

pdf bib
An Efficient LR Parser Generator for Tree Adjoining Grammars
Carlos A. Prolo
Proceedings of the Sixth International Workshop on Parsing Technologies

The first published LR algorithm for Tree Adjoining Grammars (TAGs [Joshi and Schabes, 1996]) was due to Schabes and Vijay-Shanker [1990] . Nederhof [1998] showed that it was incorrect (after [Kinyon, 1997]), and proposed a new one. Experimenting with his new algorithm over the XTAG English Grammar [XTAG Research Group, 1998] he concluded that LR parsing was inadequate for use with reasonably sized grammars because the size of the generated table was unmanageable. Also the degree of conflicts is too high. In this paper we discuss issues involved with LR parsing for TAGs and propose a new version of the algorithm that, by maintaining the degree of prediction while deferring the “subtree reduction”, dramatically reduces both the average number of conflicts per state and the size of the parser.