. "patterns; finite automata; natural language processing; language engineering"@en . "2000-01-01+01:00"^^ . "14330" . "1"^^ . "1"^^ . "Competing Patterns for Language Engineering"@en . "707258" . . "3-540-41042-2" . "Competing Patterns for Language Engineering"@cs . "RIV/00216224:14330/00:00000123!RIV09-MSM-14330___" . . . . "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." . . . "Sojka, Petr" . "Heidelberg" . "000170595900027" . . . "6"^^ . . "Springer-Verlag" . "Competing Patterns for Language Engineering"@en . . "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."@en . "RIV/00216224:14330/00:00000123" . . "Competing Patterns for Language Engineering"@cs . . "Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000" . "P(VS97028), Z(MSM 143300003)" . "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."@cs . "Competing Patterns for Language Engineering" . . . "September 13-16, Brno, Czech Republic" . "[DC0A1677F6FE]" . . . . . "Competing Patterns for Language Engineering" .