Abstract
dc:description.abstractThis thesis studies graphical Models applied to the correction of words. More particularly, hidden Markov models and Markov chains will be used in order to build a probabilistic spellchecker. Several ways to cluster words will be introduced: the batch K-Means clustering algorithm with a specific distance measure and the Expectation- Maximization algorithm in order to learn a mixture of Markov chains. Moreover, a solution for dealing with the suffixes and prefixes will be presented.
Degree
thesis:*- Name dc:type.qualificationname
- masters
- Level dc:type.qualificationlevel
- masters
- Grantor dc:publisher.institution
- Aston University
- Year dc:date.issued
- 2000
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dupin, O.
Rights
- Language dc:language.dcterms_iso639_2
- eng
Identifiers
dc:identifier.*- DOI dc:identifier.doi
- https://doi.org/10.48780/publications.aston.ac.uk.00021455