This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n5http://localhost/temp/predkladatel/
n22http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F00%3A00000123%21RIV09-MSM-14330___/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n8https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F00%3A00000123%21RIV09-MSM-14330___
rdf:type
n15:Vysledek skos:Concept
dcterms: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. 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. 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.
dcterms:title
Competing Patterns for Language Engineering Competing Patterns for Language Engineering Competing Patterns for Language Engineering
skos:prefLabel
Competing Patterns for Language Engineering Competing Patterns for Language Engineering Competing Patterns for Language Engineering
skos:notation
RIV/00216224:14330/00:00000123!RIV09-MSM-14330___
n3:aktivita
n11:Z n11:P
n3:aktivity
P(VS97028), Z(MSM 143300003)
n3:dodaniDat
n7:2009
n3:domaciTvurceVysledku
n22:7883927
n3:druhVysledku
n18:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
707258
n3:idVysledku
RIV/00216224:14330/00:00000123
n3:jazykVysledku
n14:eng
n3:klicovaSlova
patterns; finite automata; natural language processing; language engineering
n3:klicoveSlovo
n13:natural%20language%20processing n13:patterns n13:language%20engineering n13:finite%20automata
n3:kontrolniKodProRIV
[DC0A1677F6FE]
n3:mistoKonaniAkce
September 13-16, Brno, Czech Republic
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Proceedings of Third International Workshop on Text, Speech and Dialogue, TSD 2000
n3:obor
n20:JD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n10:VS97028
n3:rokUplatneniVysledku
n7:2000
n3:tvurceVysledku
Sojka, Petr
n3:typAkce
n12:CST
n3:wos
000170595900027
n3:zahajeniAkce
2000-01-01+01:00
n3:zamer
n21:MSM%20143300003
s:numberOfPages
6
n17:hasPublisher
Springer-Verlag
n8:isbn
3-540-41042-2
n5:organizacniJednotka
14330