Dupin, O. (2000). A probabilistic spellchecker. Masters thesis, Aston University.
Abstract
This 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.
| Publication DOI: | https://doi.org/10.48780/publications.aston.ac.uk.00021455 |
|---|---|
| Divisions: | College of Engineering & Physical Sciences |
| Additional Information: | Copyright © O. Dupin, 2000. O. Dupin asserts their moral right to be identified as the author of this thesis. This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without appropriate permission or acknowledgement. If you have discovered material in Aston Publications Explorer which is unlawful e.g. breaches copyright, (either yours or that of a third party) or any other law, including but not limited to those relating to patent, trademark, confidentiality, data protection, obscenity, defamation, libel, then please read our Takedown Policy and contact the service immediately. |
| Institution: | Aston University |
| Uncontrolled Keywords: | probabilistic ,spell checker,information engineering |
| Last Modified: | 28 Apr 2025 13:15 |
| Date Deposited: | 19 Mar 2014 11:30 |
| Completed Date: | 2000-09 |
| Authors: |
Dupin, O.
|
![[img]](https://publications.aston.ac.uk/style/images/fileicons/text.png)