Sökning: "parsing algorithms"

Visar resultat 1 - 5 av 14 avhandlingar innehållade orden parsing algorithms.

1. 1. Symbolic image interpretation : by parsing, interpreting, and pruning

   Författare :Staffan Truvé; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; genetic algorithms; image interpretation; grammars; constraint satisfaction problems; computer vision; parsing; symbolic representations; production rule systems;

   Sammanfattning : .... LÄS MER

3. 2. Pure Functional Parsing - an advanced tutorial

   Författare :Peter Ljunglöf; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; context-free grammars; parsing algorithms; parser combinators; functional programming;

   Sammanfattning : Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, and in that case returning the grammatical structure of the sequence. This thesis investigates di erent aspects of the parsing problem from the viewpoint of a functional programmer. LÄS MER

4. 3. MaltParser -- An Architecture for Inductive Labeled Dependency Parsing

   Författare :Johan Hall; Joakim Nivre; Welf Löwe; Martin Volk; Växjö universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependency Parsing; Support Vector Machines; Machine Learning; Language technology; Språkteknologi; Computer and Information Sciences Computer Science; Data- och informationsvetenskap;

   Sammanfattning : This licentiate thesis presents a software architecture for inductive labeled dependency parsing of unrestricted natural language text, which achieves a strict modularization of parsing algorithm, feature model and learning method such that these parameters can be varied independently. The architecture is based on the theoretical framework of inductive dependency parsing by Nivre \citeyear{nivre06c} and has been realized in MaltParser, a system that supports several parsing algorithms and learning methods, for which complex feature models can be defined in a special description language. LÄS MER

5. 4. Expressivity and Complexity of the Grammatical Framework

   Författare :Peter Ljunglöf; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Grammatical Framework; generalized context-free grammar; multiple context-free grammar; context-free rewriting systems; type theory; expressive power; abstract syntax; linearization; parsing; context-free rewriting systems;

   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

7. 5. Contributions to Semantic Dependency Parsing : Search, Learning, and Application

   Författare :Robin Kurtz; Marco Kuhlmann; Lilja Øvrelid; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

   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