• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 61
  • 50
  • 13
  • 11
  • 10
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 158
  • 40
  • 29
  • 28
  • 25
  • 23
  • 22
  • 21
  • 20
  • 18
  • 18
  • 18
  • 18
  • 17
  • 16
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
141

Gramáticas pós-NGB: do discurso oficial a outros discursos (im)possíveis / Grammars after NGB: from the official discourse to other (im)possible discourse

Thaís de Araujo da Costa 23 March 2010 (has links)
A implementação da Nomenclatura Gramatical Brasileira (NGB) em 1959 e a assunção da Linguística no Brasil na década de 60 são acontecimentos que provocaram profundas mudanças no fazer gramatical. A NGB, enquanto acontecimento discursivo, ao evidenciar determinados termos e silenciar outros, reestrutura a memória do discurso gramatical brasileiro, regulando a relação do sujeito com o dizível e instaurando uma nova formação discursiva dominante, a qual se sobrepôs às formações discursivas anteriores. No presente trabalho, partimos do pressuposto de que, apesar do efeito da censura imposta pela terminologia oficial, o discurso gramatical produzido após a sua instituição é constitutivamente da ordem do heterogêneo. Assim sendo, com base no aporte teórico da Análise de Discurso de Pêcheux e Orlandi e nos estudos do projeto História das Ideias Linguísticas, investigamos o funcionamento do discurso legitimado pela NGB nas gramáticas cuja publicação a sucederam, mais especificamente em sete gramáticas publicadas entre 1959 e 1969. Interessa-nos, portanto, com vistas a depreender a forma como se materializa a tensão entre os sentidos oficiais e os sentidos censurados, desnaturalizar o processo de (re)significação dos termos acolhidos pela NGB, depreendendo, assim, como os sentidos silenciados se fizeram significar na materialidade linguística das gramáticas / The Implementation of Brazilian Grammatical Nomenclature (NGB) in 1959 and the assumption of science Linguistics in Brazil in the 60 are events that caused profound changes to the grammar. The NGB as a discursive event, highlighting certain terms and silencing others, restructured the memory of Brazilian speech grammar, regulating the relationship between subject and utterable and establishing a new dominant discursive formation, which overlapped the previous discursive formations. In this paper, we assume that, despite the effect of the censure imposed by the official terminology, the grammatical discourse produced after its establishment is constitutively of the order of the heterogeneous. Therefore, based on the Theoretical Analysis of Discourse of Pêcheux Orlandi and on studies about project História das Ideias Linguísticas (Linguistic History of Ideas), we investigated the functioning of discourse legitimized by NGB in grammars which followed publication, specifically in seven grammars published between 1959 and 1969. Then we are interested in, in order to show the embodiment of the tension between the senses and the senses official censored, deconstruct the process of (re) signification of the terms accepted by the NGB, deducing, how the silenced senses got a meaning by themselves in the linguistic materiality of the grammars
142

O objeto pronominal acusativo de 3a pessoa nas variedades de espanhol de Madri e Montevidéu comparado ao português brasileiro: clíticos como manifestação visível e objetos nulos como manifestação não visível da concordância de objeto / The 3rd person accusative pronominal object in the Spanish varieties of Madrid and Montevideo compared to Brazilian Portuguese: clitics as a visible manifestation and null objects as a non visible manifestation of the object agreement

Adriana Martins Simões 09 April 2015 (has links)
Esta pesquisa teve por objetivo investigar a realização do objeto pronominal acusativo de 3ª pessoa nas variedades de espanhol de Madri e Montevidéu, comparar as tendências encontradas com o português brasileiro e tecer uma interpretação teórica para essas construções, tendo em vista os desenvolvimentos minimalistas (CHOMSKY, 1999, 2000, 2001, 2004). Analisamos entrevistas orais das variedades de espanhol de Madri (CESTERO MANCERA et al., 2012) e Montevidéu (ELIZAINCÍN, s/d), pertencentes ao PRESEEA. Como referencial teórico, aliamos, portanto, a concepção biológica de língua e gramática (CHOMSKY, 1981, 1986, 1999) a aspectos sociolinguísticos (LABOV, 2008; WEINREICH; LABOV; HERZOG, 2009). O espanhol seria uma língua na qual os antecedentes [+específicos] deveriam ser retomados por um clítico, enquanto os objetos nulos se restringiriam a antecedentes [-específicos; -definidos] (CAMPOS, 1986a, b; FERNÁNDEZ SORIANO, 1999). Conforme Groppi (1997), a variedade de espanhol de Montevidéu seguiria essa mesma tendência. Considerando-se esses estudos, partimos da hipótese de que nas variedades de espanhol investigadas os objetos nulos estariam restringidos a antecedentes [-determinados; -específicos]. Contudo, os resultados encontrados contrariaram parcialmente nossa hipótese, já que observamos a omissão do objeto não apenas com antecedentes [-determinados; -específicos], como também algumas ocorrências com antecedentes [+determinados; +/- específicos] e, inclusive, [+animados]. Encontramos indícios de que o objeto nulo nessas variedades de espanhol teria uma natureza pronominal, sendo, portanto, um pro. Além disso, observamos que os objetos nulos ocorreram em construções que favoreceriam o apagamento do objeto tanto em outras variedades de espanhol (LANDA, 1993, 1995; FERNÁNDEZ ORDÓÑEZ, 1999; SUÑER; YÉPEZ, 1988) quanto no português brasileiro (CASAGRANDE, 2012; DUARTE, 1986). Por um lado, as construções que apresentam um clítico no espanhol ou um pronome lexical no português brasileiro envolveriam a operação de movimento e esses pronomes seriam a manifestação visível da concordância de objeto. Por outro lado, as construções que apresentam um objeto nulo envolveriam apenas a operação de concordância e seriam os traços- de pro que possibilitariam a identificação do objeto. Nessas construções, teríamos uma concordância de objeto que se manifesta de uma forma não visível, mediante um elemento pronominal sem traços fonéticos. / The aim of this research is to investigate the 3rd person accusative pronominal object occurrence in the Spanish varieties of Madrid and Montevideo, to compare the tendencies that were found to Brazilian Portuguese and to propose a theoretical interpretation to these constructions, based on minimalist developments (CHOMSKY, 1999, 2000, 2001, 2004). For that purpose, oral interviews of the varieties of Madrid (CESTERO MANCERA et al., 2012) and Montevideo (ELIZAINCÍN, s/d), taken from PRESEEA, were analysed. Thereby, regarding the theoretical approach, the biological conception of language and grammar (CHOMSKY, 1981, 1986, 1999) and some sociolinguist aspects (LABOV, 2008; WEINREICH; LABOV; HERZOG, 2009) were combined. In Spanish, [+specific] antecedents should be expressed by a clitic, while null objects would be restricted to [-specific; -definite] antecedents (CAMPOS, 1986a, b; FERNÁNDEZ SORIANO, 1999). According to Groppi (1997), the Spanish variety of Montevideo presents the same tendency. Considering these studies, our first hypothesis was that in the Spanish varieties analyzed the null objects would be restricted to [-determined; -specific] antecedents. However, the results contradicted partially our hypothesis, since it was observed that the omission of the object not only occurred when the antecedent was [-determined; -specific], but also when the antecedent was [+determined; +/-specific] and, in addition, [+animate]. We found evidence that the null object in these Spanish varieties would have a pronominal nature, and, consequently, it would be a pro. Furthermore, the null objects appeared in constructions that allow the object ellipsis both in other Spanish varieties (LANDA, 1993, 1995; FERNÁNDEZ ORDÓÑEZ, 1999; SUÑER; YÉPEZ, 1988) and in Brazilian Portuguese (CASAGRANDE, 2012; DUARTE, 1986). On the one hand, constructions that present a clitic in Spanish or a lexical pronoun in Brazilian Portuguese would involve Move and correspond to a visible object agreement. On the other hand, constructions that present a null object would involve only Agree and the -features would be related to the object identification. In these constructions, the object agreement happens in a non visible form, through a pronominal element without phonetic features.
143

RLtools : A Toolset For Visual Language Application Development Based on Relational Grammars

Suresh, B G 07 1900 (has links) (PDF)
No description available.
144

Predição computacional de sítios de ligação de fatores de transcrição baseada em gramáticas regulares estocásticas / Computational prediction of transcription factor binding sites based on stochastic regular grammars

Antonio Ferrão Neto 27 October 2017 (has links)
Fatores de transcrição (FT) são proteínas que se ligam em sequências específicas e bem conservadas de nucleotídeos no DNA, denominadas sítios de ligação dos fatores de transcrição (SLFT), localizadas em regiões de regulação gênica conhecidas como módulos cis-reguladores (CRM). Ao reconhecer o SLFT, o fator de transcrição se liga naquele sítio e influencia a transcrição gênica positiva ou negativamente. Existem técnicas experimentais para a identificação dos locais dos SLFTs em um genoma, como footprinting, ChIP-chip ou ChIP-seq. Entretanto, a execução de tais técnicas implica em custos e tempo elevados. Alternativamente, pode-se utilizar as sequências de SLFTs já conhecidas para um determinado fator de transcrição e aplicar técnicas de aprendizado computacional supervisionado para criar um modelo computacional para tal sítio e então realizar a predição computacional no genoma. Entretanto, a maioria das ferramentas computacionais existentes para esse fim considera independência entre as posições entre os nucleotídeos de um sítio - como as baseadas em PWMs (position weight matrix) - o que não é necessariamente verdade. Este projeto teve como objetivo avaliar a utilização de gramáticas regulares estocásticas (GRE) como técnica alternativa às PWMs neste problema, uma vez que GREs são capazes de caracterizar dependências entre posições consecutivas dos sítios. Embora as diferenças de desempenho tenham sido sutis, GREs parecem mesmo ser mais adequadas do que PWMs na presença de valores mais altos de dependência de bases, e PWMs nos demais casos. Por fim, uma ferramenta de predição computacional de SLFTs foi criada baseada tanto em GREs quanto em PWMs. / Transcription factors (FT) are proteins that bind to specific and well-conserved sequences of nucleotides in the DNA, called transcription factor binding sites (TFBS), contained in regions of gene regulation known as cis-regulatory modules (CRM). By recognizing TFBA, the transcription factor binds to that site and positively or negatively influence the gene transcription. There are experimental procedures for the identification of TFBS in a genome such as footprinting, ChIP-chip or ChIP-Seq. However, the implementation of these techniques involves high costs and time. Alternatively, one may utilize the TFBS sequences already known for a particular transcription factor and applying computational supervised learning techniques to create a computational model for that site and then perform the computational prediction in the genome. However, most existing software tools for this purpose considers independence between nucleotide positions in the site - such as those based on PWMs (position weight matrix) - which is not necessarily true. This project aimed to evaluate the use of stochastic regular grammars (SRG) as an alternative technique to PWMs in this problem, since SRGs are able to characterize dependencies between consecutive positions in the sites. Although differences in performance have been subtle, SRGs appear to be more suitable than PWMs in the presence of higher base dependency values, and PWMs in other cases. Finally, a computational TFBS prediction tool was created based on both SRGs and PWMs.
145

Gramatické systémy a syntaxí řízený překlad založený na nich / Grammar Systems and Syntax-Directed Translation Based on Them

Handlíř, Jaroslav January 2017 (has links)
The thesis examines the theory of formal languages in the field of context-free grammars. It focuses mainly on the possibilities and models of collaborating grammars to solve a common problem. In this context, it presents grammatical systems that have been designed as a formal means for describing distributed and parallel processing. After introducing to the problematics, the thesis focuses on the practical use of these mechanisms in the translation controlled syntax, and therefore the second part of the thesis deals with the implementation of a dynamic syntactic analyzer that uses more grammars during the analysis. With respect to the greatest user friendliness and the possible didactic use, the application is implemented using modern web technologies HTML5, JavaScript, AngularJS, CSS3, LESS and more.
146

O vymazávacích pravidlech v řízených gramatikách / On Erasing Rules in Regulated Grammars

Zemek, Petr January 2010 (has links)
This work discusses the effect of erasing rules to the generative power of regulated grammars, which is a big open problem in the theory of regulated rewriting. It studies the possibility of removal of erasing rules from regulated grammars by aggregation of current, up-to-date results concerning this elimination and by presentation of a new condition, called k-limited erasing, under which all erasing rules can be always removed from regularly controlled context-free grammars without affecting their generative power. This result partially solves the abovementioned problem. Moreover, a new algorithm for elimination of erasing rules from context-free grammars is presented. This algorithm does not require any predetermination of so called epsilon-nonterminals (in contrast to the standard algorithm used in textbooks). In the conclusion, a significance of these results concerning syntactical analysis is discussed.
147

IDE for SCADA Development at CERN / IDE for SCADA Development at CERN

Mareček, Matěj January 2016 (has links)
Cílem této magisterské práce je navrhnout a implementovat IDE (integrované vývojové prostředí), které zvýší efektivitu a bezpečnost vývoje pro SIMATIC WinCC Open Architecture. Tato práce je založena na výzkumu provedeném týmem z Technické univerzity v Eindhovenu a splňuje požadavky pocházející ze SCD sekce v CERN (Evropské organizace pro jaderný výzkum). Vyvinuté IDE je postaveno na platformě Eclipse, přičemž pro syntaktickou analýzu, linkování a sémantickou analýzu kódu používá Xtext framework. IDE nabízí také podporu pro nově vytvořený programovací jazyk, který umožňuje programátorům jednoduše nadefinovat šablonu pro konfigurační soubory používané WinCC OA. Interpret tohoto nového jazyka je schopen provést syntaktickou analýzu šablony a konfiguračního souboru a rozhodnout, zdali konfigurační soubor odpovídá šabloně. Praktickým výstupem této práce je integrované vývojové prostředí, které podporuje vývoj WinCC OA aplikací v CERN a periodicky provádí analýzu kódu těchto aplikací napsaného v jazyce Control script.
148

Bimorphism Machine Translation

Quernheim, Daniel 10 April 2017 (has links)
The field of statistical machine translation has made tremendous progress due to the rise of statistical methods, making it possible to obtain a translation system automatically from a bilingual collection of text. Some approaches do not even need any kind of linguistic annotation, and can infer translation rules from raw, unannotated data. However, most state-of-the art systems do linguistic structure little justice, and moreover many approaches that have been put forward use ad-hoc formalisms and algorithms. This inevitably leads to duplication of effort, and a separation between theoretical researchers and practitioners. In order to remedy the lack of motivation and rigor, the contributions of this dissertation are threefold: 1. After laying out the historical background and context, as well as the mathematical and linguistic foundations, a rigorous algebraic model of machine translation is put forward. We use regular tree grammars and bimorphisms as the backbone, introducing a modular architecture that allows different input and output formalisms. 2. The challenges of implementing this bimorphism-based model in a machine translation toolkit are then described, explaining in detail the algorithms used for the core components. 3. Finally, experiments where the toolkit is applied on real-world data and used for diagnostic purposes are described. We discuss how we use exact decoding to reason about search errors and model errors in a popular machine translation toolkit, and we compare output formalisms of different generative capacity.
149

Towards Attribute Grammars for Metamodel Semantics

Bürger, Christoff, Karol, Sven 15 August 2011 (has links)
Of key importance for metamodelling are appropriate modelling formalisms. Most metamodelling languages permit the development of metamodels that specify tree-structured models enriched with semantics like constraints, references and operations, which extend the models to graphs. However, often the semantics of these semantic constructs is not part of the metamodel, i.e., it is unspeci ed. Therefore, we propose to reuse well-known compiler construction techniques to specify metamodel semantics. To be more precise, we present the application of reference attribute grammars (RAGs) for metamodel semantics and analyse commonalities and differences. Our focus is to pave the way for such a combination, by exemplifying why and how the metamodelling and attribute grammar (AG) world can be combined and by investigating a concrete example - the combination of the Eclipse Modelling Framework (EMF) and JastAdd, an AG evaluator generator.
150

Systémy kombinující automaty a gramatiky / Systems that Combine Automata and Grammars

Petřík, Patrik January 2009 (has links)
This work deals with Systems that combine automata and grammars. We investigate their properties compared with grammar systems and automaton systems. Work is focused on systems, which components are finite state automata, right linear grammars, pushdown automata or context free grammars. We also investigate usage of these systems in compilers.

Page generated in 0.0324 seconds