Competing Patterns for Language Engineering

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

SOJKA Petr

Year of publication 2000
Type Article in Proceedings
Conference Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000
MU Faculty or unit

Faculty of Informatics

Citation
Web http://www.fi.muni.cz/tsd2000/tsdproc.html
Field Use of computers, robotics and its application
Keywords patterns;finite automata;natural language processing;language engineering
Description In this paper we describe a method of effective handling of linguistic data by means of \emph{covering and inhibiting patterns}---patterns that ``compete'' each other. A methodology of developing such patterns is outlined. Applications in the areas of morphology, hyphenation and part-of-speech tagging are shown. This pattern-driven approach to language engineering allows the combination of linguist expertise with the data learned from corpora---layering of knowledge. Searching for information in pattern database (dictionary problem) is blindingly fast---linear with respect to the length of searching word as with other finite-state approaches.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.