Linguistic grammars with very low complexity
| Contribuinte(s) |
Arppe, Antti Lindén, Krister Piitulainen, Jussi Suominen, Michael Vainio, Martti Westerlund, Hanna Yli-Jyrä, Anssi University of Helsinki, Department of Modern Languages |
|---|---|
| Data(s) |
2005
|
| Resumo |
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. |
| Formato |
12 |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
CSLI Publications |
| Relação |
Inquiries into Words, Constraints and Contexts Festschrift in the Honor of Kimmo Koskenniemi CSLI Studies in Computational Linguistics ONLINE |
| Fonte |
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 . |
| Palavras-Chave | #612 Languages and Literature #grammars #natural language parsing #syntax #113 Computer and information sciences #constraints #grammars #regular languages #first-order logic #parsing |
| Tipo |
A3 Contribution to book/other compilations (refereed) info:eu-repo/semantics/bookPart http://purl.org/eprint/status/NonPeerReviewed |
