About: Unsupervised Acquiring of Morphological Paradigms from Tokenized Text     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given language. The algorithm looks at words, identifies repeatedly occurring stems and suffixes, and constructs probable morphological paradigms. The paper also describes how this method has been applied to solve the Morpho Challenge 2007 task, and gives the Morpho Challenge results. Although the present work was originally a student project without any connection or even knowledge of related work, its simple approach outperformed, to our surprise, several others in most morpheme segmentation subcompetitions. We believe that there is enough room for improvements that can put the results even higher. Errors are discussed in the paper; together with suggested adjustments in future research.
  • This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given language. The algorithm looks at words, identifies repeatedly occurring stems and suffixes, and constructs probable morphological paradigms. The paper also describes how this method has been applied to solve the Morpho Challenge 2007 task, and gives the Morpho Challenge results. Although the present work was originally a student project without any connection or even knowledge of related work, its simple approach outperformed, to our surprise, several others in most morpheme segmentation subcompetitions. We believe that there is enough room for improvements that can put the results even higher. Errors are discussed in the paper; together with suggested adjustments in future research. (en)
  • Tento článek popisuje jednoduchou metodu neřízené morfologické analýzy neznámého jazyka. Potřeba je pouze prostý textový korpus daného jazyka. Algoritmus se dívá na slova, rozpozná opakovaně se vyskytující kmeny a přípony a sestaví pravděpodobné morfologické vzory. Článek také popisuje způsob, jak byla tato metoda využita při řešení úlohy Morpho Challenge 2007, a prezentuje výsledky Morpho Challenge. Přestože tato práce byla původně studentským projektem bez návaznosti na obdobný výzkum ve světě, k našemu překvapení tento jednoduchý přístup překonal několik dalších algoritmů v podsoutěži segmentace slov. Věříme, že v metodě je dostatečný prostor pro zlepšení, který může výsledky dále zlepšit. V článku jsou rozebrány chyby a navržena budoucí rozšíření. (cs)
Title
  • Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
  • Neřízené získávání morfologických vzorů z tokenizovaného textu (cs)
  • Unsupervised Acquiring of Morphological Paradigms from Tokenized Text (en)
skos:prefLabel
  • Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
  • Neřízené získávání morfologických vzorů z tokenizovaného textu (cs)
  • Unsupervised Acquiring of Morphological Paradigms from Tokenized Text (en)
skos:notation
  • RIV/00216208:11320/07:00101503!RIV09-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101470416), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 456692
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/07:00101503
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Unsupervised; Acquiring; Morphological; Paradigms; Tokenized; Text (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [77FAF53026EF]
http://linked.open...v/mistoKonaniAkce
  • Budapest, Hungary
http://linked.open...i/riv/mistoVydani
  • Budapest, Hungary
http://linked.open...i/riv/nazevZdroje
  • Working Notes for the Cross Language Evaluation Forum (CLEF) 2007 Workshop
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Zeman, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000260420000114
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Magyar Tudományos Akadémia
https://schema.org/isbn
  • 2-912335-31-0
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software