Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{326292,
author = {Sojka, Petr},
address = {Heidelberg},
booktitle = {Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000},
keywords = {patterns;finite automata;natural language processing;language engineering},
language = {eng},
location = {Heidelberg},
isbn = {3-540-41042-2},
pages = {157-162},
publisher = {Springer-Verlag},
title = {Competing Patterns for Language Engineering},
url = {http://www.fi.muni.cz/tsd2000/tsdproc.html},
year = {2000}
}
TY - JOUR
ID - 326292
AU - Sojka, Petr
PY - 2000
TI - Competing Patterns for Language Engineering
PB - Springer-Verlag
CY - Heidelberg
SN - 3540410422
KW - patterns;finite automata;natural language processing;language engineering
UR - http://www.fi.muni.cz/tsd2000/tsdproc.html
N2 - 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.
ER -
SOJKA, Petr. Competing Patterns for Language Engineering. In \textit{Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000}. Heidelberg: Springer-Verlag, 2000, s.~157-162. ISBN~3-540-41042-2.
|
