Finite-state parsing and disambiguation

Kimmo Koskenniemi

Finite-state parsing and disambiguation

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	englanti
Otsikko	Proceedings of the 13th conference on Computational linguistics, Vol. 2
Toimittajat	Hans Karlgren
Sivumäärä	4
Julkaisupaikka	Helsinki
Julkaisupäivä	1990
Sivut	229-232
ISBN (painettu)	952-90-2026-0, 952-90-2028-7
Tila	Julkaistu - 1990
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	The 13th International Conference on Computational Linguistics - Helsinki, Unknown Kesto: 20 elok. 1990 → 25 elok. 1990 Konferenssinumero: 13

Tieteenalat

612 Kielitieteet, kirjallisuus

Pääsy asiakirjaan

http://acl.ldc.upenn.edu/C/C90/C90-2040.pdf

Siteeraa tätä

@inproceedings{b5ae7e4fc7d741cfaf08bde359729b40,

title = "Finite-state parsing and disambiguation",

abstract = "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.",

keywords = "612 Languages and Literature, natural language, syntactic parsing, finite-state",

author = "Kimmo Koskenniemi",

year = "1990",

language = "English",

isbn = "952-90-2026-0",

pages = "229--232",

editor = "Hans Karlgren",

booktitle = "Proceedings of the 13th conference on Computational linguistics, Vol. 2",

note = "The 13th International Conference on Computational Linguistics ; Conference date: 20-08-1990 Through 25-08-1990",

}

TY - GEN

T1 - Finite-state parsing and disambiguation

AU - Koskenniemi, Kimmo

N1 - Conference code: 13

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

KW - 612 Languages and Literature

KW - natural language

KW - syntactic parsing

KW - finite-state

M3 - Conference contribution

SN - 952-90-2026-0

SN - 952-90-2028-7

SP - 229

EP - 232

BT - Proceedings of the 13th conference on Computational linguistics, Vol. 2

A2 - Karlgren, Hans

CY - Helsinki

T2 - The 13th International Conference on Computational Linguistics

Y2 - 20 August 1990 through 25 August 1990

ER -