FundaÃÃo de Amparo à Pesquisa do Estado do Cearà / In this work, we propose a computational linguistic analysis of the so-called adverbialized adjectives (hereinafter AdjAdvs). On the one hand, we start by questioning whether AdjAdvs belong to category A(djective) or ADV(erb) and, on the other, which approach is computationally more efficient. We base our point of view according to the Lexical-Functional Grammar (LFG) (KAPLAN and BRESNAN, 1982) and implement in the XLE system (Xerox Linguistic Environment) a fragment of Brazilian Portuguese grammar (henceforth PB) capable of analyzing adjectives in adverbial use. Our implementation is based on the adaptation of a fragment of French grammar constructed by Schwarze and Alencar (2016) and deepened in FrGramm by Alencar (2017). This fragment of grammar adapted to PB serves as the basis for the implementation of two versions for a comparative analysis: G-A and G-ADV. In the first version, AdjAdvs are analyzed as adjectival category, while in the second they are analyzed as adverbial category. The implementation of G-A and G-ADV is evaluated by applying a parser to a set of 168 grammatical sentences and 286 ungrammatical sentences. After testing grammatical and ungrammatical sentence sets, G-A and G-ADV grammars processing results in XLE and the statistical analysis based on the double factor variance test, we concluded that there was no significant difference in treatment of syntax between G-A and G-ADV versions built to parse AdjAdvs. This result reinforces Radford (1988) argument that adjectives and adverbs belong to a single category. / Neste trabalho, propomos uma anÃlise linguÃstico-computacional dos chamados adjetivos adverbializados (doravante AdjAdvs). Partimos, por um lado, do questionamento se AdjAdvs pertencem à categoria A(djetivo) ou ADV(Ãrbio) e, por outro, que abordagem à computacionalmente mais eficiente. Fundamentamos nosso ponto de vista de acordo com a GramÃtica LÃxico-Funcional (LFG, em inglÃs Lexical-Functional Grammar) (cf. KAPLAN e BRESNAN, 1982) e implementamos no sistema XLE (do inglÃs Xerox Linguistic Environment) um fragmento de gramÃtica do portuguÃs brasileiro (doravante PB) capaz de analisar adjetivos em uso adverbial. Nossa implementaÃÃo parte da adaptaÃÃo de uma minigramÃtica do francÃs construÃda por Schwarze e Alencar (2016) e aprofundada na FrGramm por Alencar (2017). Esse fragmento de gramÃtica adaptado ao PB serve de base para a construÃÃo de duas versÃes para uma anÃlise comparativa: G-A e G-ADV. Na primeira versÃo, AdjAdvs sÃo analisados como categoria adjetival, enquanto na segunda sÃo analisados como categoria adverbial. A implementaÃÃo de G-A e G-ADV à avaliada pela aplicaÃÃo de um analisador sintÃtico automÃtico (parser) a 168 sentenÃas gramaticais e 286 sentenÃas agramaticais. ApÃs os testes nos conjuntos de sentenÃas gramaticais e agramaticais, os resultados de processamento das gramÃticas G-A e G-ADV no software XLE e a anÃlise estatÃstica com base no teste de variÃncia de fator duplo, chegamos à conclusÃo de que nÃo hà diferenÃa significativa no tratamento sintÃtico entre as versÃes G-A e G-ADV construÃdas para analisar AdjAdvs. Esse resultado reforÃa o argumento de Radford (1988) de que adjetivos e advÃrbios pertencem a uma Ãnica categoria.

This thesis addresses the problem of the development of Natural Language Processing techniques for the extraction and generalization of compositional and functional relations from specialized written texts and, in particular, from patent claims. One of the most demanding tasks tackled in the thesis is, according to the state of the art, the semantic generalization of linguistic denominations of relations between object components and processes described in the texts. These denominations are usually verbal expressions or nominalizations that are too concrete to be used as standard labels in knowledge representation forms -as, for example, “A leads to B”, and “C provokes D”, where “leads to” and “provokes” both express, in abstract terms, a cause, such that in both cases “A CAUSE B” and “C CAUSE D” would be more appropriate. A semantic generalization of the relations allows us to achieve a higher degree of abstraction of the relationships between objects and processes described in the claims and reduces their number to a limited set that is oriented towards relations as commonly used in the generic field of knowledge representation. / Esta tesis se centra en el del desarrollo de tecnologías del Procesamiento del Lenguage Natural para la extracción y generalización de relaciones encontradas en textos especializados; concretamente en las reivindicaciones de patentes. Una de las tareas más demandadas de nuestro trabajo, desde el punto vista del estado de la cuestión, es la generalización de las denominaciones lingüísticas de las relaciones. Estas denominaciones, usualmente verbos, son demasiado concretas para ser usadas como etiquetas de relaciones en el contexto de la representación del conocimiento; por ejemplo, “A lleva a B”, “B es el resultado de A” están mejor representadas por “A causa B”. La generalización de relaciones permite reducir el n\'umero de relaciones a un conjunto limitado, orientado al tipo de relaciones utilizadas en el campo de la representación del conocimiento.