|
Size: 1122
Comment:
|
Size: 1235
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| = Concraft = | = Concraft-pl = |
| Line 3: | Line 3: |
| This page provides the official release of Concraft, a morphosyntactic disambiguation tool based on constrained conditional random fields. | Concraft-pl is a morphosyntactic tagger for the Polish language based on conditional random fields. The tool is coupled with [[http://sgjp.pl/morfeusz/index.html|Morfeusz]], a morphosyntactic analyzer for Polish, which represents both morphosyntactic and segmentation ambiguities in the form of a directed acyclic graph (DAG). |
| Line 5: | Line 5: |
| '''Author:''' [[http://zil.ipipan.waw.pl/JakubWaszczuk|Jakub Waszczuk]] <<BR>> '''License:''' 2-clause BSD == Documentation == TODO == Downloads == Concraft is available in a form of a software distribution which can be downloaded from [[http://hackage.haskell.org/package/concraft|hackage]] using the [[http://www.haskell.org/cabal/|cabal]] tool. To compile Concraft you will also need the [[http://www.haskell.org/ghc/|Glasgow Haskell Compiler]] (GHC). The simplest way to get both cabal and GHC is to install the [[http://www.haskell.org/platform/|Haskell Platform]]. Please see the documentation for more information about the installation process. |
More information can be found on the tool's website: [[https://github.com/kawu/concraft-pl]] |
| Line 19: | Line 9: |
| * Jakub Waszczuk. (2012). [[http://nlp.ipipan.waw.pl/Concraft/Coling2012.pdf|Harnessing the CRF complexity with domain-specific constraints. The case of morphosyntactic tagging of a highly inflected language]]. <<BR>> In: Proceedings of COLING 2012, Mumbai, India. | * Jakub Waszczuk. (2012). [[attachment:coling2012.pdf|Harnessing the CRF complexity with domain-specific constraints. The case of morphosyntactic tagging of a highly inflected language]]. <<BR>> In: Proceedings of the 24th International Conference on Computational Linguistics (COLING 2012), pages 2789–2804, Mumbai, India, 2012. * Jakub Waszczuk, Witold Kieraś, and Marcin Woliński. (2018). [[https://hal.archives-ouvertes.fr/hal-01835573/document|Morphosyntactic disambiguation and segmentation for historical Polish with graph-based conditional random fields]]. <<BR>> In: Petr Sojka, Aleš Horák, Ivan Kopeček, and Karel Pala, editors, Text, Speech, and Dialogue: 21st International Conference, TSD 2018, Brno, Czech Republic, September 11-14, 2018. |
Concraft-pl
Concraft-pl is a morphosyntactic tagger for the Polish language based on conditional random fields. The tool is coupled with Morfeusz, a morphosyntactic analyzer for Polish, which represents both morphosyntactic and segmentation ambiguities in the form of a directed acyclic graph (DAG).
More information can be found on the tool's website: https://github.com/kawu/concraft-pl
Publications
Jakub Waszczuk. (2012). Harnessing the CRF complexity with domain-specific constraints. The case of morphosyntactic tagging of a highly inflected language.
In: Proceedings of the 24th International Conference on Computational Linguistics (COLING 2012), pages 2789–2804, Mumbai, India, 2012.Jakub Waszczuk, Witold Kieraś, and Marcin Woliński. (2018). Morphosyntactic disambiguation and segmentation for historical Polish with graph-based conditional random fields.
In: Petr Sojka, Aleš Horák, Ivan Kopeček, and Karel Pala, editors, Text, Speech, and Dialogue: 21st International Conference, TSD 2018, Brno, Czech Republic, September 11-14, 2018.