Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"Parsing (Computer grammar)"”.
-
Learning for semantic parsing and natural language generation using statistical machine translation techniques
… We focus on two important sub-tasks, seman- tic parsing and tactical generation. The key idea is that both tasks can be treated as the translation between natural languages and formal meaning representation lan- guages, and therefore, can be performed using state-of-the-art statistical machine …
-
On interleaving syntax and semantics in parsing
… D.)--Michigan State University. Department of Computer Science, 1989
-
Learning for semantic parsing with kernels under various forms of supervision
Semantic parsing involves deep semantic analysis that maps natural language sentences to their formal executable meaning representations. This is a challenging problem and is critical for developing computing systems that understand natural language input. This thesis presents a new machine …
-
Incremental nonmonotonic parsing through semantic self-organization
… for spoken language demonstrates robust parsing of noisy input, while graceful degradation in performance from adding noise to the network weights underscores INSOMNet’s tolerance to damage. Finally, the cognitive plausibility of the model is shown on a standard psycholinguistic …
-
Practical Earley parsing and the SPARK toolkit
… meet this need, we have created SPARK (Scanning, Parsing, And Rewriting Kit), a toolkit for little language implementation in Python, an object-oriented scripting language. SPARK greatly simplifies the task of little language implementation. It requires little code to be written, and accommodates …
-
The Design and Implementation of a Prolog Parser Using Javacc
… operator symbols are not present in the grammar rules of the language. Unless the parser generator allows for some flexibility in the specification of the grammar rules, it is very difficult to generate a parser for such text. In this thesis we discuss the existing parsing methods and …
-
Dealing with ambiguity in NLP : finding the best tree in the parse forest
Samhengisfrjálsar mállýsingar eru ekki almennt notaðar til að þátta mannleg tungumál en eru á hinn bóginn notaðar til að þátta forritunarmál. Í tilviki forritunarmála má mállýsingin ekki vera margræð heldur má þáttari, sem byggir á henni, aðeins skila af sér einu þáttunartré. Þá kröfu er hvorki …
-
A General Purpose Semantic Parser Using FrameNet and WordNet®.
Syntactic parsing is one of the best understood language processing applications. Since language and grammar have been formally defined, it is easy for computers to parse the syntactic structure of natural language text. Does meaning have structure as well? If it has, how can we analyze the …
-
Parallel Parsing in a Multiprocessor Environment
Parsing in a multiprocessor environment is considered. Two models for asynchronous bottom-up parallel parsing are presented. A method for estimating speedup in asynchronous bottom-up parallel parsing is developed, and it is used to estimate speedup obtainable by bottom-up parallel parsing of …
-
Larger-first partial parsing
Larger-first partial parsing is a primarily top-down approach to partial parsing that is opposite to current easy-first, or primarily bottom-up, strategies. A rich partial tree structure is captured by an algorithm that assigns a hierarchy of structural tags to each of the input tokens in a …
-
Toward abstractive multi-document summarization using submodular function-based framework, sentence compression and merging
Automatic multi-document summarization is a process of generating a summary that contains the most important information from multiple documents. In this thesis, we design an automatic multi-document summarization system using different abstraction-based methods and submodularity. Our proposed …
-
Epsilon Precedence Grammars and Languages
The classes of simple and weak precedence grammars are generalized to include ε-rules (productions with the empty right parts). The descriptive power of epsilon simple precedence (ESP) grammars increases directly with the number of ε-rules permitted; the class of ESP grammars with no ε-rules, ESP0, …
-
Aural Mapping of STEM Concepts Using Literature Mining
Recent technological applications have made the life of people too much dependent on Science, Technology, Engineering, and Mathematics (STEM) and its applications. Understanding basic level science is a must in order to use and contribute to this technological revolution. Science education in …