Other formats:
BibTeX
LaTeX
RIS
@misc{837861,
author = {Sojka, Petr},
address = {Brno},
edition = {první},
keywords = {competing patterns;context-sensitive patterns;machine learning;natural language engineering;hyphenation; [Thai text] segmentation;disambiguation;formal concept analysis;part of speech tagging;},
language = {eng},
location = {Brno},
publisher = {Masarykova univerzita},
title = {Competing Patterns in Language Engineering and Computer Typesetting},
url = {http://www.fi.muni.cz/usr/sojka/papers/sojka-thesis.pdf},
year = {2005}
}
TY - GEN
ID - 837861
AU - Sojka, Petr
PY - 2005
TI - Competing Patterns in Language Engineering and Computer Typesetting
VL - PhD. dissertation
PB - Masarykova univerzita
CY - Brno
KW - competing patterns;context-sensitive patterns;machine learning;natural language engineering;hyphenation
KW - [Thai text] segmentation;disambiguation;formal concept analysis;part of speech tagging;
UR - http://www.fi.muni.cz/usr/sojka/papers/sojka-thesis.pdf
L2 - http://www.fi.muni.cz/usr/sojka/papers/sojka-thesis.pdf
N2 - The goal of this dissertation is to explore models, methods and methodologies for machine learning of the compact and effective storage of empirical data in the areas of language engineering and computer typesetting, with a focus on the massive exception handling. Research has focused on the pattern-driven approach. The whole methodology of so called \stress{competing patterns} capable of handling exceptions to be found so widely in natural language data and computer typesetting, is further developed. Competing patterns can store \stress{context dependent} information and can be learnt from data, or written by experts, or combined together. In the first part of the thesis, the theory of competing patterns is built; competing patterns are defined, cornerstones of methodology based on stratified sampling, bootstrapping and problem modeling by competing patterns are described. Segmentation problems (hyphenation) and problems of disambiguation of tagged data in corpus linguistics are used as examples when developing formal model of the competing patterns method. The second part consist of a series of seven published papers that describe problems addressed by the proposed methods: applications of competing patterns and related learning methods in areas of hyphenation, hyphenation of compound words and, for example, the segmentation of Thai texts.
ER -
SOJKA, Petr. \textit{Competing Patterns in Language Engineering and Computer Typesetting}. první. Brno: Masarykova univerzita, 2005, 140 pp. PhD. dissertation.
|
