Scribd Logo
Upload

Welcome to Scribd!

  • Assignment-3: Sufix Trie

    Uploaded by

    Molalegn Tamiru
    17 views5 pages
    This document discusses building finite state machines (FSMs) to model the morphology of Amharic words. It provides 10 inflected forms of the Amharic word "ጀመረ/gemere" and constructs an FSM to represent the morphological structure. The document also discusses key concepts in morphology like morphemes, classification of morphemes, and using FSMs to model sequential systems. It presents a second, more compact FSM to model the suffix structure of the word forms.

    Original Description:

    Original Title

    Assignment-3 : Sufix Trie

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses building finite state machines (FSMs) to model the morphology of Amharic words. It provides 10 inflected forms of the Amharic word "ጀመረ/gemere" and constructs an FSM to represent the morphological structure. The document also discusses key concepts in morphology like morphemes, classification of morphemes, and using FSMs to model sequential systems. It presents a second, more compact FSM to model the suffix structure of the word forms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views5 pages

    Assignment-3: Sufix Trie

    Uploaded by

    Molalegn Tamiru
    This document discusses building finite state machines (FSMs) to model the morphology of Amharic words. It provides 10 inflected forms of the Amharic word "ጀመረ/gemere" and constructs an FSM to represent the morphological structure. The document also discusses key concepts in morphology like morphemes, classification of morphemes, and using FSMs to model sequential systems. It presents a second, more compact FSM to model the suffix structure of the word forms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    Bahir Dar University

    Bahir Dar Institute of Technology


    Faculty of Computing
    Department of Computer Science
    Natural Language Processing(CoSc5262)

    “ Assignment Two : Suffix Trie”

    Name: Molalegn Tamiru ID: BDU1300608

    Submitted To: Dr. Milion M. (PHD).

    May 26, 2021

    Addis Ababa, Ethiopia


    • Exercise: Build an FSM of the morphology of the Amharic word
    “ጀመረ/gemere”

    • Take Amharic word with at least ten inflection and build an FSM of the
    morphology for them?

     Morphology is the study of form and structure.

     Morpheme is the smallest linguistic unit which has a meaning or


    grammatical function. Words are composed of morphemes (one or more).
    There are some complications with this simple definition[1].

     There are two Classification Of Morphemes Free and bounded ; Bound


    cannot appear as a word by itself ; where as Free can appear as a word by
    itself; often can combine with other morphemes too.

     Other classification Root nucleus of the word that affixes attach too. Affix a
    morpheme that is not a root; it is always bound(suffix , prefix , infix ,
    circumfix).

     othe clasiffication Inflection inflection creating various forms of the same


    word lexeme; derivation creating new words.

     Finite State Machines (FSMs) are a useful abstraction for sequential


    circuits with centralized “states” of operation.

     A finite-state machine is a formal model of any system/machine/algorithm


    that can exist in a finite number of states and that transitions among those
    states based on sequence of input symbols[2].
     ጀመረ ጀመር-ኧ
     ጀመረን ጀመር-ኧ-ን
     ጀመረህ ጀመር-ኧ-ህ
     ጀመረው ጀመር -ኧ-ው
     ጀመራቸው ጀመር-ኣ-ቸ-ው
     ጀመረኝ ጀመር -ኧ-ኝ
     ጀመረሽ ጀመር-ኧ-ሽ
     ጀመራችሁ ጀመር-ኣ-ች-ሁ
     ጀመራችሁት ጀመር-ኣ-ች-ህ-ኡ-ት
     ጀመራት ጀመር-ኣ-ት
    s s s
    5 6 7
    ን ኝ ሽ s
    ው 8
    s
    4 ህ s
    s ጀ s መ s ር s ኧ 9
    0 1 2 3 ኡ s s
    1 ት
    s ኣ 0 1
    1 1
    s ች s s
    ት 2
    sቸ
    1 1 ሁ 2
    3 1 7 0
    sህ
    5
    sው 1
    1 8
    sኡ
    6 1
    9
    sት
    2
    Key 1
    S
    n Final State
    s
    0 Initial State
    Contacted FSM for suffix Machine

    s s s
    5 6 7
    ን ኝ ሽ
    ው
    s
    8
    s
    4 ህ s
    s ጀመር s ኧ 9
    0 2 ኡ s
    1 ት s
    ኣ 0 1
    s 1
    1
    s ት ች s s
    2
    1 1 ሁ 1
    3 ቸው 4 6

    ህኡት
    s
    1 s
    4 1
    5

    Key
    S
    n Final State
    s
    0 Initial State
    Reference
    [1] J. Hana and L. Typology, “Intro to Linguistics – Morphology,” no. 1, pp. 1–8,
    2011.

    [2] C. Lecture and F. Machines, “Finite-State Machines,” 2018.

    You might also like