This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.

No description available.

The thesis aims to develop a method for extending the language platform Storm with a Java frontend.The project was conducted using an Action Research methodology and highlights triumphs andchallenges. Despite the significant overhead related to note generation and problem statementformulation, this methodology proved beneficial in identifying problems and providing the framework tosolve them. The first research question (RQ.1) evaluates to what extent the language platform Storm is suitable forimplementing the object oriented language Java. Using Storm, only a BNF and a specification for three-address code instructions are needed. Despite encountering difficulties during the implementation, theplatform offers tools that allow comprehensive customization of the new language's intended behaviorand functionality. The second research question (RQ.2) explores a suitable method for implementing a new language inStorm. It is suggested to first implement a foundational structure comprising of statements, blocks,scope handling and variable declarations. From this foundation, new functionalities can be graduallyintroduced and tested by connecting them to the appropriate location in the structure. When allfunctionality is added and tested a refactoring step can take place to modify the BNF if needed.

SANTOS, Andrea Feitosa. Movimento do verbo e categorias vazias em I e V em um fragmento de gramática computacional do português. 2009.96f.Dissertação (Mestrado em Linguistica) – Universidade Federal do Ceará, Departamento de Letras Vernaculas, Programa de Pós-Graduação em Linguística, Fortaleza-CE, 2009. / Submitted by nazareno mesquita (nazagon36@yahoo.com.br) on 2012-06-21T16:00:03Z No. of bitstreams: 1 2009_diss_AFSantos.pdf: 616159 bytes, checksum: 59bd79e8c618b1d231d8b7b98b8f767e (MD5) / Approved for entry into archive by Maria Josineide Góis(josineide@ufc.br) on 2012-06-22T16:39:36Z (GMT) No. of bitstreams: 1 2009_diss_AFSantos.pdf: 616159 bytes, checksum: 59bd79e8c618b1d231d8b7b98b8f767e (MD5) / Made available in DSpace on 2012-06-22T16:39:36Z (GMT). No. of bitstreams: 1 2009_diss_AFSantos.pdf: 616159 bytes, checksum: 59bd79e8c618b1d231d8b7b98b8f767e (MD5) Previous issue date: 2009 / This work has a theoretical and methodological framework that is divided into two complementary areas: the Language and Computational/Implementacional. For its computational stamp, the first scope of this work is directly linked to the processing of natural language (PNL). Thus, it implements an automatic syntactic analysis (parsing) of expressions of Portuguese in a computational program from the Python library of NLTK, whose tests are represented in tree configurations that show slash categories of finite sentences of Portuguese. Although the stamp computing, this research elaborates a grammar fragment, modeled to capture specific features of linguistic structure of Portuguese, based on the formal model of description linguistic known as Context Free Grammar (CFG) Based on Features, with the purpose of demonstrate how the library of NLTK programs supports the implementation of parsers for analyzing the feature structure. For its stamp of language, it analyzes, according to X-bar Theory and the Minimalist Program, sentences in European and Brazilian variants of Portuguese, obtained from surveys in electronic corpora available on the web. And this work describes and discusses the category IP (inflectional phrase) within the hierarchical structure of constituents, according to the hypothesis of syntactic operation of visible and invisible movement of elements of language, specifically the movement of the verb / Esse trabalho possui um recorte teórico-metodológico que se decompõe em dois domínios complementares: o Linguístico e o Computacional/Implementacional. Pelo seu cunho computacional, o escopo primeiro desse trabalho está diretamente ligado ao processamento de língua natural (PLN). Desse modo, implementa-se uma análise sintática automática (parsing) de expressões de língua portuguesa em programas da biblioteca em Python do NLTK, cujas análises são representadas em forma de configurações arbóreas que demonstram categorias vazias de sentenças finitas do português. Ainda pelo cunho computacional, esse trabalho elabora um fragmento de gramática, modelado para capturar traços específicos da estrutura linguística do português, com base no modelo formal de descrição linguística conhecido como Gramática Livre de Contexto (CFG) Baseada em Traços, com a finalidade de demonstrar como a biblioteca de programas do NLTK dá suporte à realização dos analisadores sintáticos na análise da estrutura de traços. Pelo seu cunho lingüístico, analisa-se, de acordo com a Teoria X-barra e o Programa Minimalista, frases nas variantes europeia e brasileira da língua portuguesa, obtidas de pesquisas em corpora eletrônicos disponíveis na web. E ainda nesse trabalho, descreve-se e discute-se a categoria IP (sintagma flexional) dentro da sua estrutura hierárquica de constituintes, de acordo com a hipótese da operação sintática de movimento visível e não visível dos elementos linguísticos, especificamente o movimento do verbo

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Esse trabalho possui um recorte teÃrico-metodolÃgico que se decompÃe em dois domÃnios complementares: o LinguÃstico e o Computacional/Implementacional. Pelo seu cunho computacional, o escopo primeiro desse trabalho està diretamente ligado ao processamento de lÃngua natural (PLN). Desse modo, implementa-se uma anÃlise sintÃtica automÃtica (parsing) de expressÃes de lÃngua portuguesa em programas da biblioteca em Python do NLTK, cujas anÃlises sÃo representadas em forma de configuraÃÃes arbÃreas que demonstram categorias vazias de sentenÃas finitas do portuguÃs. Ainda pelo cunho computacional, esse trabalho elabora um fragmento de gramÃtica, modelado para capturar traÃos especÃficos da estrutura linguÃstica do portuguÃs, com base no modelo formal de descriÃÃo linguÃstica conhecido como GramÃtica Livre de Contexto (CFG) Baseada em TraÃos, com a finalidade de demonstrar como a biblioteca de programas do NLTK dà suporte à realizaÃÃo dos analisadores sintÃticos na anÃlise da estrutura de traÃos. Pelo seu cunho lingÃÃstico, analisa-se, de acordo com a Teoria X-barra e o Programa Minimalista, frases nas variantes europeia e brasileira da lÃngua portuguesa, obtidas de pesquisas em corpora eletrÃnicos disponÃveis na web. E ainda nesse trabalho, descreve-se e discute-se a categoria IP (sintagma flexional) dentro da sua estrutura hierÃrquica de constituintes, de acordo com a hipÃtese da operaÃÃo sintÃtica de movimento visÃvel e nÃo visÃvel dos elementos linguÃsticos, especificamente o movimento do verbo / This work has a theoretical and methodological framework that is divided into two complementary areas: the Language and Computational/Implementacional. For its computational stamp, the first scope of this work is directly linked to the processing of natural language (PNL). Thus, it implements an automatic syntactic analysis (parsing) of expressions of Portuguese in a computational program from the Python library of NLTK, whose tests are represented in tree configurations that show slash categories of finite sentences of Portuguese. Although the stamp computing, this research elaborates a grammar fragment, modeled to capture specific features of linguistic structure of Portuguese, based on the formal model of description linguistic known as Context Free Grammar (CFG) Based on Features, with the purpose of demonstrate how the library of NLTK programs supports the implementation of parsers for analyzing the feature structure. For its stamp of language, it analyzes, according to X-bar Theory and the Minimalist Program, sentences in European and Brazilian variants of Portuguese, obtained from surveys in electronic corpora available on the web. And this work describes and discusses the category IP (inflectional phrase) within the hierarchical structure of constituents, according to the hypothesis of syntactic operation of visible and invisible movement of elements of language, specifically the movement of the verb

This thesis introduces syntax-directed translation based on deep pushdown automata. Necessary theoretical models are introduced in the theoretical part. The most important model, introduced in this thesis, is a deep pushdown transducer. The transducer should be used in syntax analysis, significant part of translation. Practical part consists of an implementation of simple-language interpret based on these models.

<p>Synthesized speech may be used for nefarious purposes, such as fraud, spoofing, and misinformation campaigns. We present several speech forensics methods based on deep learning to protect against such attacks. First, we use a convolutional neural network (CNN) and transformers to detect synthesized speech. Then, we investigate closed set and open set speech synthesizer attribution. We use a transformer to attribute a speech signal to its source (i.e., to identify the speech synthesizer that created it). Additionally, we show that our approach separates different known and unknown speech synthesizers in its latent space, even though it has not seen any of the unknown speech synthesizers during training. Next, we explore machine learning for an objective in the aerospace domain.</p> <p><br></p> <p>Compared to conventional ballistic vehicles and cruise vehicles, hypersonic glide vehicles (HGVs) exhibit unprecedented abilities. They travel faster than Mach 5 and maneuver to evade defense systems and hinder prediction of their final destinations. We investigate machine learning for identifying different HGVs and a conic reentry vehicle (CRV) based on their aerodynamic state estimates. We also propose a HGV flight phase prediction method. Inspired by natural language processing (NLP), we model flight phases as “words” and HGV trajectories as “sentences.” Next, we learn a “grammar” from the HGV trajectories that describes their flight phase transition patterns. Given “words” from the initial part of a HGV trajectory and the “grammar”, we predict future “words” in the “sentence” (i.e., future HGV flight phases in the trajectory). We demonstrate that this approach successfully predicts future flight phases for HGV trajectories, especially in scenarios with limited training data. We also show that it can be used in a transfer learning scenario to predict flight phases of HGV trajectories that exhibit new maneuvers and behaviors never seen before during training.</p>