Efficient conversion from Dependency Trees to Abstract Syntax Trees in Natural Language Processing
| dc.contributor.author | Källberg, Andreas | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering | en |
| dc.contributor.examiner | Angelov, Krasimir | |
| dc.contributor.supervisor | Ranta, Aarne | |
| dc.date.accessioned | 2025-07-03T13:15:19Z | |
| dc.date.issued | 2025 | |
| dc.date.submitted | ||
| dc.description.abstract | This thesis is a contribution to the field of rule based Natural Language Processing. Within rule based NLP there are different grammar formalisms, each with their own strengths and weaknesses. This work presents several improvements to a tool for converting between two such grammar formalisms. First we improved the performance significantly. Secondly we improved the debugging facilities of the tool. Thirdly we made it possible to convert between trees that had previously been too structurally different from each other. | |
| dc.identifier.coursecode | DATX05 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12380/309930 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | computer | |
| dc.subject | science | |
| dc.subject | computer science | |
| dc.subject | engineering | |
| dc.subject | project | |
| dc.subject | thesis | |
| dc.title | Efficient conversion from Dependency Trees to Abstract Syntax Trees in Natural Language Processing | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master's Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |