Log in

Relevant bibliographies by topics / Probabilistic grammar / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Probabilistic grammar.

Dissertations / Theses on the topic 'Probabilistic grammar'

Author: Grafiati

Published: 4 June 2021

Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 28 dissertations / theses for your research on the topic 'Probabilistic grammar.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Kwiatkowski, Thomas Mieczyslaw. "Probabilistic grammar induction from sentences and structured meanings." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6190.

Full text

Abstract:

The meanings of natural language sentences may be represented as compositional logical-forms. Each word or lexicalised multiword-element has an associated logicalform representing its meaning. Full sentential logical-forms are then composed from these word logical-forms via a syntactic parse of the sentence. This thesis develops two computational systems that learn both the word-meanings and parsing model required to map sentences onto logical-forms from an example corpus of (sentence, logical-form) pairs. One of these systems is designed to provide a general purpose method of inducing semanti

APA, Harvard, Vancouver, ISO, and other styles

2

Stüber, Torsten. "Consistency of Probabilistic Context-Free Grammars." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86943.

Full text

Abstract:

We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation. Moreover, we develop a novel characterization of consistent probabilistic context-free grammars. A simple corollary of our result is that training methods for probabilistic context-free grammars that are based on maximum-likelihood estimation always yield consistent grammars.

APA, Harvard, Vancouver, ISO, and other styles

3

Afrin, Taniza. "Extraction of Basic Noun Phrases from Natural Language Using Statistical Context-Free Grammar." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33353.

Full text

Abstract:

The objective of this research was to extract simple noun phrases from natural language texts using two different grammars: stochastic context-free grammar (SCFG) and non-statistical context free grammar (CFG). Precision and recall were calculated to determine how many precise and correct noun phrases were extracted using these two grammars. Several text files containing sentences from English natural language specifications were analyzed manually to obtain the test-set of simple noun-phrases. To obtain precision and recall, this test-set of manually extracted noun phrases was compared with th

APA, Harvard, Vancouver, ISO, and other styles

4

Hsu, Hsin-jen. "A neurophysiological study on probabilistic grammatical learning and sentence processing." Diss., University of Iowa, 2009. https://ir.uiowa.edu/etd/243.

Full text

Abstract:

Syntactic anomalies reliably elicit P600 effects in natural language processing. A survey of previous work converged on a conclusion that the mean amplitude of the P600 seems to be associated with the goodness of fit of a target word with expectation generated based on already unfolded materials. Based on this characteristic of the P600 effects, the current study aimed to look for evidence indicating the influence of input statistics in shaping grammatical knowledge/representations, and as a result leading to probabilistically-based competition/expectation generation processes of online senten

APA, Harvard, Vancouver, ISO, and other styles

5

Brookes, James William Rowe. "Probabilistic and multivariate modelling in Latin grammar : the participle-auxiliary alternation as a case study." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/probabilistic-and-multivariate-modelling-in-latin-grammar-the-participleauxiliary-alternation-as-a-case-study(4ff5b912-c410-41f2-94f2-859eb1ce5b21).html.

Full text

Abstract:

Recent research has shown that language is sensitive to probabilities and a whole host of multivariate conditioning factors. However, most of the research in this arena centres on the grammar of English, and, as yet, there is no statistical modelling on the grammar of Latin, studies of which have to date been largely philological. The rise in advanced statistical methodologies allows us to capture the underlying structure of the rich datasets which this corpus only language can potentially offer. This thesis intends to remedy this deficit by applying probabilistic and multivariate models to a

APA, Harvard, Vancouver, ISO, and other styles

6

Buys, Jan Moolman. "Probabilistic tree transducers for grammatical error correction." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/85592.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2013.<br>ENGLISH ABSTRACT: We investigate the application of weighted tree transducers to correcting grammatical errors in natural language. Weighted finite-state transducers (FST) have been used successfully in a wide range of natural language processing (NLP) tasks, even though the expressiveness of the linguistic transformations they perform is limited. Recently, there has been an increase in the use of weighted tree transducers and related formalisms that can express syntax-based natural language transformations in a probabilistic setting. The

APA, Harvard, Vancouver, ISO, and other styles

7

Shan, Yin Information Technology &amp Electrical Engineering Australian Defence Force Academy UNSW. "Program distribution estimation with grammar models." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2005. http://handle.unsw.edu.au/1959.4/38737.

Full text

Abstract:

This thesis studies grammar-based approaches in the application of Estimation of Distribution Algorithms (EDA) to the tree representation widely used in Genetic Programming (GP). Although EDA is becoming one of the most active fields in Evolutionary computation (EC), the solution representation in most EDA is a Genetic Algorithms (GA) style linear representation. The more complex tree representations, resembling GP, have received only limited exploration. This is unfortunate, because tree representations provide a natural and expressive way of representing solutions for many problems. This th

APA, Harvard, Vancouver, ISO, and other styles

8

Pinnow, Eleni. "The role of probabilistic phonotactics in the recognition of reduced pseudowords." Diss., Online access via UMI:, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mora, Randall P., and Jerry L. Hill. "Service-Based Approach for Intelligent Agent Frameworks." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595661.

Full text

Abstract:

ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>This paper describes a service-based Intelligent Agent (IA) approach for machine learning and data mining of distributed heterogeneous data streams. We focus on an open architecture framework that enables the programmer/analyst to build an IA suite for mining, examining and evaluating heterogeneous data for semantic representations, while iteratively building the probabilistic model in real-time to improve

APA, Harvard, Vancouver, ISO, and other styles

10

Torres, Parra Jimena Cecilia. "A Perception Based Question-Answering Architecture Derived from Computing with Words." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1967797581&sid=1&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Plum, Guenter Arnold. "Text and Contextual Conditioning in Spoken English: A genre approach." Thesis, The University of Sydney, 1988. http://hdl.handle.net/2123/608.

Full text

Abstract:

This study brings together two approaches to linguistic variation, Hallidayan systemic-functional grammar and Labovian variation theory, and in doing so brings together a functional interpretation of language and its empirical investigation in its social context. The study reports on an empirical investigation of the concept of text. The investigation proceeds on the basis of a corpus of texts gathered in sociolinguistic interviews with fifty adult speakers of Australian English in Sydney. The total corpus accounted for in terms of text type or genre numbers 420 texts of varying length, 125

APA, Harvard, Vancouver, ISO, and other styles

12

Plum, Guenter Arnold. "Text and Contextual Conditioning in Spoken English: A genre approach." University of Sydney. Linguistics, 1988. http://hdl.handle.net/2123/608.

Full text

Abstract:

This study brings together two approaches to linguistic variation, Hallidayan systemic-functional grammar and Labovian variation theory, and in doing so brings together a functional interpretation of language and its empirical investigation in its social context. The study reports on an empirical investigation of the concept of text. The investigation proceeds on the basis of a corpus of texts gathered in sociolinguistic interviews with fifty adult speakers of Australian English in Sydney. The total corpus accounted for in terms of text type or genre numbers 420 texts of varying length, 125

APA, Harvard, Vancouver, ISO, and other styles

13

MATSUBARA, Shigeki, and Yoshihide KATO. "Incremental Parsing with Adjoining Operation." Institute of Electronics, Information and Communication Engineers, 2009. http://hdl.handle.net/2237/15001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Kalantari, John I. "A general purpose artificial intelligence framework for the analysis of complex biological systems." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5953.

Full text

Abstract:

This thesis encompasses research on Artificial Intelligence in support of automating scientific discovery in the fields of biology and medicine. At the core of this research is the ongoing development of a general-purpose artificial intelligence framework emulating various facets of human-level intelligence necessary for building cross-domain knowledge that may lead to new insights and discoveries. To learn and build models in a data-driven manner, we develop a general-purpose learning framework called Syntactic Nonparametric Analysis of Complex Systems (SYNACX), which uses tools from Bayesian

APA, Harvard, Vancouver, ISO, and other styles

15

Aycinena, Margaret Aida. "Probabilistic geometric grammars for object recognition." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34640.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.<br>Includes bibliographical references (p. 121-123).<br>This thesis presents a generative three-dimensional (3D) representation and recognition framework for classes of objects. The framework uses probabilistic grammars to represent object classes recursively in terms of their parts, thereby exploiting the hierarchical and substitutive structure inherent to many types of objects. The framework models the 3) geometric characteristics of object parts using multivariate conditional Ga

APA, Harvard, Vancouver, ISO, and other styles

16

Carroll, Glenn R. "Learning probabilistic grammars for language modeling." [S.l.] : Universität Stuttgart , Fakultätsübergreifend / Sonstige Einrichtung, 1995. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB7084251.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Álvaro, Muñoz Francisco. "Mathematical Expression Recognition based on Probabilistic Grammars." Doctoral thesis, Universitat Politècnica de València, 2015. http://hdl.handle.net/10251/51665.

Full text

Abstract:

[EN] Mathematical notation is well-known and used all over the world. Humankind has evolved from simple methods representing countings to current well-defined math notation able to account for complex problems. Furthermore, mathematical expressions constitute a universal language in scientific fields, and many information resources containing mathematics have been created during the last decades. However, in order to efficiently access all that information, scientific documents have to be digitized or produced directly in electronic formats. Although most people is able to understand and prod

APA, Harvard, Vancouver, ISO, and other styles

18

Lee, Wing Kuen. "Interpreting tables in text using probabilistic two-dimensional context-free grammars /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LEEW.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Scicluna, James. "Grammatical inference of probalistic context-free grammars." Nantes, 2014. http://www.theses.fr/2014NANT2071.

Full text

Abstract:

L’inférence grammaticale consiste à apprendre, à partir de données provenant d’un langage, une grammaire susceptible d’expliquer ou de générer le langage en question. Ce travail, concerne les grammaires incontextuelles (ou context-free) probabilistes, plus puissantes que les grammaires régulières, objet de la plupart des travaux en inférence grammaticale. L’apprentissage est non supervisé : aucune information structurelle n’est connue. Le travail comprend un état de l’art concernant l’inférence grammaticale, les grammaires probabilistes et les classes de grammaires permettant un apprentissage

APA, Harvard, Vancouver, ISO, and other styles

20

Beneš, Vojtěch. "Syntaktický analyzátor pro český jazyk." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236022.

Full text

Abstract:

Master’s thesis describes theoretical basics, solution design, and implementation of constituency (phrasal) parser for Czech language, which is based on a part of speech association into phrases. Created program works with manually built and annotated Czech sample corpus to generate probabilistic context free grammar within runtime machine learning. Parser implementation, based on extended CKY algorithm, then for the input Czech sentence decides if the sentence can be generated by the created grammar and for the positive cases constructs the most probable derivation tree. This result is

APA, Harvard, Vancouver, ISO, and other styles

21

Bensalem, Raja. "Construction de ressources linguistiques arabes à l’aide du formalisme de grammaires de propriétés en intégrant des mécanismes de contrôle." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0503/document.

Full text

Abstract:

La construction de ressources linguistiques arabes riches en informations syntaxiques constitue un enjeu important pour le développement de nouveaux outils de traitement automatique. Cette thèse propose une approche pour la création d’un treebank de l’arabe intégrant des informations d’un type nouveau reposant sur le formalisme des Grammaires de Propriétés. Une propriété syntaxique caractérise une relation pouvant exister entre deux unités d’une certaine structure syntaxique. Cette grammaire est induite automatiquement à partir du treebank arabe ATB, ce qui constitue un enrichissement de cette

APA, Harvard, Vancouver, ISO, and other styles

22

Toussenel, François. "Étiquetage probabiliste avec un grand jeu d'étiquettes en vue de l'analyse syntaxique complète." Paris 7, 2005. http://www.theses.fr/2005PA070087.

Full text

Abstract:

Nous parcourons les limites de l'approche d'étiquetage en arbres élémentaires par modèle de Markov caché comme étape préparatoire à l'analyse syntaxique complète utilisant une large grammaire d'arbres adjoints lexicalisée extraite automatiquement d'un corpus arboré. Après avoir identifié deux sources majeures de difficulté pour cette approche (des problèmes statistiques dus à un fort manque de données, et un conflit entre la nature globale des informations véhiculées par les schémas d'arbre et la vision locale du modèle de Markov caché), nous avons exploré trois voies d'amélioration de la phas

APA, Harvard, Vancouver, ISO, and other styles

23

Mamián, López Esther Sofía 1985. "Métodos de pontos interiores como alternativa para estimar os parâmetros de uma gramática probabilística livre do contexto." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306757.

Full text

Abstract:

Orientadores: Aurelio Ribeiro Leite de Oliveira, Fredy Angel Amaya Robayo<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-23T17:46:00Z (GMT). No. of bitstreams: 1 MamianLopez_EstherSofia_M.pdf: 1176541 bytes, checksum: 8f49901f40e77c9511c30e86c0d1bb0d (MD5) Previous issue date: 2013<br>Resumo: Os modelos probabilísticos de uma linguagem (MPL) são modelos matemáticos onde é definida uma função de probabilidade que calcula a probabilidade de ocorrência de uma cadeia em uma linguag

APA, Harvard, Vancouver, ISO, and other styles

24

Yi-Ting, Fu, and 傅怡婷. "Learning Semantic Parsing Using Probabilistic Context-Free Grammar in Chinese Poetry Domains." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/bhdau2.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊系統與應用研究所<br>93<br>Statistical model have been used quite successfully in Natural Language Processing for recovery of hidden structure such as part-of-speech tags, or syntactic structure. This thesis considers semantic parsing and tagging of classical Chinese poetry lines. There are five aims in this thesis: (1) Construct semantic grammars; (2) Modify and learning probabilities of the semantic grammars from the training corpus; (3) Parse the sentence to tree structure; (4) Evaluate the accuracy of parsing results and (5) Compare with the Hidden Markov Model bi-gram tagger. In

APA, Harvard, Vancouver, ISO, and other styles

25

Jia-KuanLin and 林家寬. "Affective Structure Modeling of Speech for Emotion Recognition Using Probabilistic Context Free Grammar." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/38279767034205399000.

Full text

Abstract:

碩士<br>國立成功大學<br>醫學資訊研究所<br>102<br>Speech is the most natural way with rich emotional information for communication. Recognition of emotions in speech plays an important role in affective computing. Related research on utterance-level and segment-level processing lacks the understanding of the underlying structure of emotional speech. In this thesis, a hierarchical approach to modeling affective structure based on probabilistic context free grammar is proposed for recognition. Canny edge detection algorithm is employed to detect the hypothesized segment boundaries of speech signal according to

APA, Harvard, Vancouver, ISO, and other styles

26

Cunha, Jessica Megane Taveira da. "Probabilistic Grammatical Evolution." Master's thesis, 2021. http://hdl.handle.net/10316/96066.

Full text

Abstract:

Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia<br>Evolução Gramatical (GE) [1] é uma das variantes mais populares de Programação Genética(GP) [2] e tem sido utilizada com sucesso em problemas de vários domínios. Desde a pro-posta original, muitas melhorias foram introduzidas na GE para melhorar a sua perfor-mance abordando alguns dos seus principais problemas, nomeadamente a baixa localidadee a alta redundância [3, 4].Nos métodos de GP baseados em gramáticas a escolha da gramática tem um papel impor-tante na qualidade das soluções geradas, um

APA, Harvard, Vancouver, ISO, and other styles

27

Nguyen, Ngoc Tran. "Étude de transformations grammaticales pour l'entraînement de grammaires probabilistes hors-contexte." Thèse, 2002. http://hdl.handle.net/1866/14498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gotti, Fabrizio. "L'atténuation statistique des surdétections d'un correcteur grammatical symbolique." Thèse, 2012. http://hdl.handle.net/1866/9809.

Full text

Abstract:

Les logiciels de correction grammaticale commettent parfois des détections illégitimes (fausses alertes), que nous appelons ici surdétections. La présente étude décrit les expériences de mise au point d’un système créé pour identifier et mettre en sourdine les surdétections produites par le correcteur du français conçu par la société Druide informatique. Plusieurs classificateurs ont été entraînés de manière supervisée sur 14 types de détections faites par le correcteur, en employant des traits couvrant di-verses informations linguistiques (dépendances et catégories syntaxiques, exploration du

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!