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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 13th conference on Computational linguistics, Vol. 2 |
| Editors | Hans Karlgren |
| Number of pages | 4 |
| Place of Publication | Helsinki |
| Publication date | 1990 |
| Pages | 229-232 |
| ISBN (Print) | 952-90-2026-0, 952-90-2028-7 |
| Publication status | Published - 1990 |
| MoE publication type | A4 Article in conference proceedings |
| Event | The 13th International Conference on Computational Linguistics - Helsinki, Unknown Duration: 20 Aug 1990 → 25 Aug 1990 Conference number: 13 |
Fields of Science
- 612 Languages and Literature
- natural language
- syntactic parsing
- finite-state