Czech text segmentation using voting experts and its comparison with Menzerath-Altmann law

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86081142" target="_blank" >RIV/61989100:27240/11:86081142 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-642-27245-5_20" target="_blank" >http://dx.doi.org/10.1007/978-3-642-27245-5_20</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-27245-5_20" target="_blank" >10.1007/978-3-642-27245-5_20</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Czech text segmentation using voting experts and its comparison with Menzerath-Altmann law

Popis výsledku v původním jazyce

The word alphabet is connection to a lot of problems in the information retrieval. Information retrieval algorithms usually do not process the input data as sequence of bytes, but they use even bigger pieces of the data, say words or generally some chunks of the data. This is the main motivation of the paper. How to split the input data into smaller chunks without a priori known structure? To do this, we use Voting Experts Algorithms in our paper. Voting Experts Algorithm is often used to process time series data, audio signals, etc. Our intention is to use Voting Experts algorithm for future segmentation of discrete data such as DNA or proteins. For test purposes we use Czech and English text as test bed for the segmentation algorithm. We use Menzerath-Altmann law for comparison of the segmentation result.

Název v anglickém jazyce

Czech text segmentation using voting experts and its comparison with Menzerath-Altmann law

Popis výsledku anglicky

The word alphabet is connection to a lot of problems in the information retrieval. Information retrieval algorithms usually do not process the input data as sequence of bytes, but they use even bigger pieces of the data, say words or generally some chunks of the data. This is the main motivation of the paper. How to split the input data into smaller chunks without a priori known structure? To do this, we use Voting Experts Algorithms in our paper. Voting Experts Algorithm is often used to process time series data, audio signals, etc. Our intention is to use Voting Experts algorithm for future segmentation of discrete data such as DNA or proteins. For test purposes we use Czech and English text as test bed for the segmentation algorithm. We use Menzerath-Altmann law for comparison of the segmentation result.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA205%2F09%2F1079" target="_blank" >GA205/09/1079: Metody umělé inteligence v GIS</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Communications in Computer and Information Science

ISSN

1865-0929

e-ISSN

—

Svazek periodika

245

Číslo periodika v rámci svazku

12

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

9

Strana od-do

152-160

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—