Verbal extension sequencing: an examination from a computational perspective.

Lexical transducers utilise a two-level finite-state network to simultaneously code morphological analysis and morphological generation rewrite rules. Multiple extensions following the verb root can be morphologically analysed as a closed morpheme class using different computational techniques. Anal...

Descripción completa

Detalles Bibliográficos
Publicado en:Literator Vol. 29; no. 1; pp. 43 - 64
Autores principales: Anderson, W. N., Kotzé, A. E.
Formato: Artículo
Publicado: African Online Scientific Information System PTY LTD Apr2008
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=35045033&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 35045033
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        02582279
        G1C
      jtl: Literator
      issn: 02582279
      maglogo: N
    pubinfo:
      dt: Apr2008
      vid: 29
      iid: 1
      pid: 56831
      pub: African Online Scientific Information System PTY LTD
    artinfo:
      ui:
        35045033
        10.4102/lit.v29i1.100
      ppf: 43
      ppct: 21
      formats:
        fmt:
          @attributes:
            type: P
            size: 2.1MB
      tig:
        atl: Verbal extension sequencing: an examination from a computational perspective.
      aug:
        au:
          Anderson, W. N.
          Kotzé, A. E.
        affil:
          School of Computing, University of South Africa, PRETORIA.
          Department of Learner Support, University of South Africa, PRETORIA.
      su:
        Northern Sotho language
        Morphology (Grammar)
        Sotho-Tswana languages
        Verbs
        Morphemics
        Affixes (Grammar)
        Text processing (Computer science)
        Machine learning
      sug:
        subj:
          Northern Sotho language
          Morphology (Grammar)
          Sotho-Tswana languages
          Verbs
          Morphemics
          Affixes (Grammar)
          Text processing (Computer science)
          Machine learning
      keyword:
        continuation classes
        empty language
        extension sequencing rules: Northern Sotho verbs
        trivial analysis: multiple verbal extensions
        ekstensie opeenvolgingsreëls: Noord-Sotho werkwoorde
        kontinueringsklasse
        leë taal
        triviale analise: veelvuldige werkwoordekstensies
      ab:
        Lexical transducers utilise a two-level finite-state network to simultaneously code morphological analysis and morphological generation rewrite rules. Multiple extensions following the verb root can be morphologically analysed as a closed morpheme class using different computational techniques. Analysis of a multiple extension sequence is achieved by trivial analysis, based on any combination of the closed class members, but this produces unnecessary over-generation of lexical items, many of which may not occur in a lexicon. Limiting the extension combinations, in an attempt to represent examples that may actually exist — in terms of both the possible number of extensions in a sequence and the relative ordering of the extensions — leads to a radical reduction in the generation of lexical items while the ability to analyse adequately is maintained. The article highlights details of an investigation based on both trivial analysis and an approach that prevents dramatic overgeneration. The article is based on test data reflecting possible extension sequences and the morphophonemic alternations of these extensions for Northern Sotho, garnered from literature research, lexicographic investigation and the computational morphological analysis of texts.
        Leksikale oorvormers maak gebruik van 'n tweevlak-eindigendetoestandnetwerk om tegelykertyd morfologiese analiserings- en morfologiese genereringsherskrywingsreëls te enkodeer. Veelvuldige werkwoordelike ekstensies kan morfologies as 'n geslote morfeemklas geanaliseer word deur van verskillende rekenaarmatige tegnieke gebruik te maak. Die analise van 'n veelvuldige opeenvolging van ekstensies word verwesenlik deur triviale analise, gebaseer op enige kombinasie van lede van die geslote klas, maar dit gee aanleiding tot onnodige oorgenerering van leksikale items, waarvan baie items nie in 'n woordeboek voorkom nie. Indien ekstensiekombinasies beperk sou word in 'n strewe na die verteenwoordiging van voorbeelde wat werklik bestaan, sowel ten opsigte van die moontlike aantal ekstensies in 'n reeks as die relatiewe ordening van die ekstensies, het dit 'n radikale vermindering in die generering van leksikale items tot gevolg, terwyl die vermoë om te analiseer voldoende gehandhaaf word. Die artikel belig besonderhede van triviale analise en 'n benadering wat dramatiese oorgenerering voorkom. Dit is gebaseer op toetsdata wat die moontlike ekstensievolgordes asook die morfofonemiese alternasies van hierdie ekstensies in Noord-Sotho weerspieël. Dit is bekom deur literatuurnavorsing, leksikografiese ondersoeke en die rekenaarmatige morfologiese analise van tekste.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Copyright of Literator is the property of African Online Scientific Information System PTY LTD and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use.
      item: Literator
      holder: African Online Scientific Information System PTY LTD
      dt:
        @attributes:
          year: 2008
    holdings:
      @attributes:
        islocal: N