1 |
Validation Issues induced by an Automatic Pre-Annotation Mechanism in the Building of Non-projective Dependency Treebanks
|
|
|
|
In: Proceedings of the Ninth International Conference on Language Ressources and Evaluation (LREC 2014), Reykjavik, Iceland, May 26-31, 2014 ; Ninth International Conference on Language Ressources and Evaluation (LREC 2014) ; https://hal.archives-ouvertes.fr/hal-01017233 ; Ninth International Conference on Language Ressources and Evaluation (LREC 2014), May 2014, Reykjavik, Iceland. pp.4082-4086 (2014)
|
|
BASE
|
|
Show details
|
|
2 |
NP-Completeness of Grammars Based upon Products of Free Pregroups
|
|
|
|
In: Categories and Types in Logic, Language, and Physics, Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday ; https://hal.archives-ouvertes.fr/hal-00993347 ; Claudia Casadio, Bob Coecke, Michael Moortgat and Philip Scott. Categories and Types in Logic, Language, and Physics, Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, Springer-Verlag, pp.51-62, 2014, Lecture Notes in Computer Science, LNCS 8222, 978-3-642-54788-1. ⟨10.1007/978-3-642-54789-8⟩ (2014)
|
|
BASE
|
|
Show details
|
|
3 |
Label Pre-annotation for Building Non-projective Dependency Treebanks for French
|
|
|
|
In: 15th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2014) ; https://hal.archives-ouvertes.fr/hal-01004007 ; 15th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2014), Apr 2014, Kathmandu, Nepal. pp.1-12 (2014)
|
|
BASE
|
|
Show details
|
|
4 |
A Three-Step Transition-Based System for Non-Projective Dependency Parsing
|
|
|
|
In: The 25th International Conference on Computational Linguistics (COLING 2014) ; https://hal.archives-ouvertes.fr/hal-01097232 ; The 25th International Conference on Computational Linguistics (COLING 2014), Aug 2014, Dublin, Ireland. pp.224-232 ; http://aclweb.org/anthology/C/C14/C14-1023.pdf (2014)
|
|
Abstract:
International audience ; This paper presents a three-step transition-based system for labelled non-projective dependency parsing. The three steps include one classical method for projective dependency parsing and two inverse methods predicting separately the right and left non-projective dependencies. Splitting the parsing allows to increase the scores on non-projective dependencies compared to state-of- the-art non-projective dependency parsing. Moreover, each step is performed in linear time.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
|
|
URL: https://hal.archives-ouvertes.fr/hal-01097232
|
|
BASE
|
|
Hide details
|
|
|
|