uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Towards a Finite-State Parser for Swedish
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Languages, Department of Linguistics and Philology.ORCID iD: 0000-0002-4838-6518
(computational linguistics)
2000 (English)In: Proceedings of NoDaLiDa 99, 2000, 115-123 p.Conference paper (Refereed)
Abstract [en]

In this study, we describe a method for parsing part-of-speech tagged unrestricted texts in Swedish using finite-state networks. We use the Xerox Finite-State Tool because of its expressiveness and power for writing and compiling regular expressions and relations. The parser is divided into four modules: i) contiguous phrase structure marker, ii) phrasal head marker, iii) syntactic function tagger, and iv) non-contiguous group boundary recognizer. The aim is to develop a parser that can be used as a light/shallow parser for marking phrase structure and, when needed, to label syntactic functions. We believe that modularity is necessary since different NLP tasks require various levels of analysis. The parser for Swedish is under development, but present-day results are promising.

Place, publisher, year, edition, pages
2000. 115-123 p.
National Category
Language Technology (Computational Linguistics)
URN: urn:nbn:se:uu:diva-19667OAI: oai:DiVA.org:uu-19667DiVA: diva2:47439
Nordic Conference of Computational Linguistics 1999
Available from: 2006-11-30 Created: 2006-11-30 Last updated: 2016-03-08

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Megyesi, Beata
By organisation
Department of Linguistics and Philology
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 145 hits
ReferencesLink to record
Permanent link

Direct link