Finite-state parsing and disambiguation

    Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

    Sammanfattning

    A language-independent method of finite-state surface syntactic parsing and word-disambiguation is discussed. Input sentences are represented as finite-state networks already containing all possible roles and interpretations of its units. Also syntactic constraint rules are represented as finite-state machines where each constraint excludes certain types of ungrammatical readings. The whole grammar is an intersection of its constraint rules and excludes all ungrammatical possibilities leaving the correct interpretation(s) of the sentence. The method is being tested for Finnish, Swedish and English.
    Originalspråkengelska
    Titel på värdpublikationProceedings of the 13th conference on Computational linguistics, Vol. 2
    RedaktörerHans Karlgren
    Antal sidor4
    UtgivningsortHelsinki
    Utgivningsdatum1990
    Sidor229-232
    ISBN (tryckt)952-90-2026-0, 952-90-2028-7
    StatusPublicerad - 1990
    MoE-publikationstypA4 Artikel i en konferenspublikation
    EvenemangThe 13th International Conference on Computational Linguistics - Helsinki, Unknown
    Varaktighet: 20 aug. 199025 aug. 1990
    Konferensnummer: 13

    Vetenskapsgrenar

    • 612 Språk och litteratur

    Citera det här