• Corpus ID: 209183621

Proceedings of the NoDaLiDa 2019 Workshop on Constraint Grammar-Methods, Tools and Applications

  title={Proceedings of the NoDaLiDa 2019 Workshop on Constraint Grammar-Methods, Tools and Applications},
  author={Eckhard Bick and Trond Trosterud},
In this article, we explain the first steps towards a grammar-helping tool for Basque from a ruled-based approach. Specifically, we show the first steps carried out for helping with verb agreement, some of the difficulties encountered, which linguistic issues arise when new rules are designed, and future perspectives. 


Transformation-Based Learning of Rules for Constraint Grammar Tagging
This paper makes a few observations based on the transformation-based learning method used to train Brill taggers, and presents some initial and rather promising experimental results.
An Efficient Constraint Grammar Parser based on Inward Deterministic Automata
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications are presented, with a focus on constraint grammar applications.
Exploring the Expressivity of Constraint Grammar
We believe that for any formalism which has its roots in linguistics, it is a natural question to ask “how expressive is it?” Therefore, in this paper, we begin to address the question of the
CG-3 — Beyond Classical Constraint Grammar
A new, largely theory­independent CG framework and rule compiler (CG­3) is presented, that allows the linguist to write CG rules incorporating different types of linguistic information and methodology from a wide range  of parsing approaches, covering not only CG's native topological technique, but also dependency grammar, phrase structure grammar and unification grammar.
Floresta Sintá(c)tica: Bigger, Thicker and Easier
The resumption of activities of Floresta Sinta(c)tica, a treebank for Portuguese is described, the new texts added to the treebank are described, and the new user-friendly search system is described.
A FrameNet for Danish
By converting frame distinctors into Constraint Grammar rules, this paper was able to build a robust frame tagger for running Danish text, using DanGram parses as input, and the combined context-informed coverage of the parser-frametagger was 94.3%.
Reusing Grammatical Resources for New Languages
It is argued that there is a notable gain in reusing grammatical resources when porting technology to new languages, particularly with respect to the closely related Lule and South Sami languages.
Constraint Grammar Parsing with Left and Right Sequential Finite Transducers
It is shown that the method can improve on the worst-case asymptotic bound of Constraint Grammar parsing from cubic to quadratic in the length of input sentences.
When grammar can't be trusted - Valency and semantic categories in North Sámi syntactic analysis and error detection
Transitivity is the ability of a lexeme to have an object in accusative case and an intransitive verb is a verb that can but does not have to have a object in accuser case.
The Power of Constraint Grammars Revisited
It is shown that a grammar is equivalent to a finite-state transducer if it is implemented with a Turing machine that runs in o(n log n) time, which opens new finite- state hypotheses and avenues for deeper analysis of SCG instances in the way inspired by Finite-State Phonology.