Sökning: "Natural Language Parsing"
Visar resultat 11 - 15 av 38 avhandlingar innehållade orden Natural Language Parsing.
11. Expressivity and Complexity of the Grammatical Framework
Sammanfattning : This thesis investigates the expressive power and parsing complexity of the Grammatical Framework (GF), a formalism originally designed for displaying formal propositions and proofs in natural language. This is done by relating GF with two more well-known grammar formalisms; Generalized Context-Free Grammar (GCFG), best seen as a framework for describing various grammar formalisms; and Parallel Multiple Context-Free Grammar (PMCFG), an instance of GCFG. LÄS MER
12. Contributions to Semantic Dependency Parsing : Search, Learning, and Application
Sammanfattning : Semantic dependency parsing is the task of mapping natural language sentences into representations of their meaning in the form of directed graphs on words. These bilexical graphs are designed to capture the sentence-internal predicate-argument relationships – they tell us “who did what to whom” in the given sentence. LÄS MER
13. Argument Differentiation. Soft constraints and data-driven models
Sammanfattning : The ability to distinguish between different types of arguments is central to syntactic analysis, whether studied from a theoretical or computational point of view. This thesis investigates the influence and interaction of linguistic properties of syntactic arguments in argument differentiation. LÄS MER
14. The Multilingual Forest : Investigating High-quality Parallel Corpus Development
Sammanfattning : This thesis explores the development of parallel treebanks, collections of language data consisting of texts and their translations, with syntactic annotation and alignment, linking words, phrases, and sentences to show translation equivalence. We describe the semi-manual annotation of the SMULTRON parallel treebank, consisting of 1,000 sentences in English, German and Swedish. LÄS MER
15. Automatic Detection of Grammar Errors in Primary School Children's Texts. A Finite State Approach
Sammanfattning : This thesis concerns the analysis of grammar errors in Swedish texts written by primary school children and the development of a finite state system for finding such errors. Grammar errors are more frequent for this group of writers than for adults and the distribution of the error types is different in children's texts. LÄS MER