Unsupervised Disambiguation of Abstract
| dc.contributor.author | Kalldal, Oscar | |
| dc.contributor.author | Ludvigsson, Maximilian | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers) | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers) | en |
| dc.date.accessioned | 2019-07-03T14:46:07Z | |
| dc.date.available | 2019-07-03T14:46:07Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | Disambiguating natural text is the task of choosing the correct meaning among several possible interpretations. This thesis focus on disambiguating parse trees created by Grammatical Framework — a formal language that represent meaning of natural language sentences with abstract syntax trees in order to do machine translation. Since one tree represents a meaning, for every sentence there exists several interpretations for which the most probable one should be chosen. In order to achieve this, a language model on trees is defined. This is then used to compare possible trees and choose the one with the highest probability. In order to estimate the parameters of the model, the probability of the different meanings behind a word needs to be estimated. This is done using the Expectation Maximization algorithm. Experiments are done on seven different languages to show that the method is generalizable. Different smoothing techniques as well as different dictionaries are evaluated. A novel merged Wordnet is constructed in order to avoid sparseness. The method is evaluated by doing word sense disambiguation (a subtask of tree disambiguation) on standard data sets. The model is shown to be comparable to other unsupervised methods in the SemEval 2015. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/255307 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | Data- och informationsvetenskap | |
| dc.subject | Computer and Information Science | |
| dc.title | Unsupervised Disambiguation of Abstract | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Engineering Mathematics (300 hp) |
Ladda ner
Original bundle
1 - 1 av 1
Hämtar...
- Namn:
- 255307.pdf
- Storlek:
- 642.18 KB
- Format:
- Adobe Portable Document Format
- Beskrivning:
- Fulltext