Sökning: "Natural Language Parsing"
Visar resultat 21 - 25 av 38 avhandlingar innehållade orden Natural Language Parsing.
21. On control strategies and incrementality in unification-based chart parsing
Sammanfattning : This thesis is a compilation of three papers dealing with aspects of context-free- and unification-based chart parsing of natural language. The first paper contains a survey and an empirical comparison of rule-invocation strategies in context-free chart parsing. LÄS MER
22. Predicting Linguistic Structure with Incomplete and Cross-Lingual Supervision
Sammanfattning : Contemporary approaches to natural language processing are predominantly based on statistical machine learning from large amounts of text, which has been manually annotated with the linguistic structure of interest. However, such complete supervision is currently only available for the world's major languages, in a limited number of domains and for a limited range of tasks. LÄS MER
23. Three Studies on Model Transformations - Parsing, Generation and Ease of Use
Sammanfattning : ABSTRACT Transformations play an important part in both software development and the automatic processing of natural languages. We present three publications rooted in the multi-disciplinary research of Language Technology and Software Engineering and relate their contribution to the literature on syntactical transformations. LÄS MER
24. Complexities of Order-Related Formal Language Extensions
Sammanfattning : The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. LÄS MER
25. Complexity and expressiveness for formal structures in Natural Language Processing
Sammanfattning : The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. LÄS MER