Linguistic grammars with very low complexity

Show full item record



Permalink

http://hdl.handle.net/10138/24956

Citation

Yli-Jyrä , A M 2005 , Linguistic grammars with very low complexity . in A Arppe , K Lindén , J Piitulainen , M Suominen , M Vainio , H Westerlund & A Yli-Jyrä (eds) , Inquiries into Words, Constraints and Contexts : Festschrift in the Honor of Kimmo Koskenniemi . CSLI Studies in Computational Linguistics ONLINE , CSLI publications , Stanford , pp. 172-183 . < http://csli-publications.stanford.edu/koskenniemi-festschrift/ >

Title: Linguistic grammars with very low complexity
Author: Yli-Jyrä, Anssi Mikael
Editor: Arppe, Antti; Lindén, Krister; Piitulainen, Jussi; Suominen, Michael; Vainio, Martti; Westerlund, Hanna; Yli-Jyrä, Anssi
Contributor: University of Helsinki, Department of Modern Languages 2010-2017
Publisher: CSLI publications
Date: 2005
Language: eng
Number of pages: 12
Belongs to series: Inquiries into Words, Constraints and Contexts Festschrift in the Honor of Kimmo Koskenniemi
Belongs to series: CSLI Studies in Computational Linguistics ONLINE
URI: http://hdl.handle.net/10138/24956
Abstract: We have presented an overview of the FSIG approach and related FSIG gram- mars to issues of very low complexity and parsing strategy. We ended up with serious optimism according to which most FSIG grammars could be decom- posed in a reasonable way and then processed efficiently.
Subject: 612 Languages and Literature
grammars
natural language parsing
syntax
113 Computer and information sciences
constraints
grammars
regular languages
first-order logic
parsing
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
17_yli_jyra.pdf 94.81Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record