Informace o publikaci

Competing Patterns for Language Engineering

Autoři

SOJKA Petr

Rok publikování 2000
Druh Článek ve sborníku
Konference Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www http://www.fi.muni.cz/tsd2000/tsdproc.html
Obor Využití počítačů, robotika a její aplikace
Klíčová slova patterns;finite automata;natural language processing;language engineering
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info