| 1. |
- Dannélls, Dana, 1976, et al.
(författare)
-
Grammar-ontology interoperability -- Final Work and Overview
- 2013
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- D4.3A is an annex to the D4.3 deliverable of WP4 of the MOLTO project. It aims to address the reviewers’ remarks and recommendations for D4.3, as well as to present a final overview of the prototypes built in the scope of MOLTO with respect to grammar-ontology interoperabilty. D4.3A also describes the work after M24 and gives a general overview of the achievements in MOLTO with focus on WP4 - Knowledge Engineering, WP7 - Patents use case, and WP8 - Cultural Heritage use case.
|
|
| 2. |
- Listenmaa, Inari, et al.
(författare)
-
Analysing constraint grammars with a SAT-solver
- 2016
-
Ingår i: 10th International Conference on Language Resources and Evaluation, LREC 2016; Grand Hotel Bernardin Conference CenterPortoroz; Slovenia; 23 May 2016 through 28 May 2016. ; , s. 699-706
-
Konferensbidrag (refereegranskat)abstract
- We describe a method for analysing Constraint Grammars (CG) that can detect internal conflicts and redundancies in a given grammar, without the need for a corpus. The aim is for grammar writers to be able to automatically diagnose, and then manually improve their grammars. Our method works by translating the given grammar into logical constraints that are analysed by a SAT-solver. We have evaluated our analysis on a number of non-trivial grammars and found inconsistencies.
|
|
| 3. |
- Listenmaa, Inari, 1987, et al.
(författare)
-
Automatic conversion of colloquial Finnish to standard Finnish
- 2015
-
Ingår i: Proceedings of the 20th Nordic Conference of Computational Linguistics, NODALIDA 2015. ; , s. 219-223
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a rule-based method for converting between colloquial Finnish and standard Finnish. The method relies upon a small number of orthographical rules combined with a large language model of standard Finnish for ranking the possible conversions. Aside from this contribution, the paper also presents an evaluation corpus consisting of aligned sentences in colloquial Finnish, orthographically-standardised colloquial Finnish and standard Finnish. The method we present outperforms the baseline of simply treating colloquial Finnish as standard Finnish, but is outperformed by a phrase-based MT system trained by the evaluation corpus. The paper also presents preliminary results which show promise for using normalisation in the machine translation task.
|
|
| 4. |
- Listenmaa, Inari, 1987, et al.
(författare)
-
Automatic test suite generation for PMCFG grammars
- 2018
-
Ingår i: EasyChair Preprints. - : EasyChair. - 2516-2314.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- We present a method for finding errors in formalized natural language grammars, by automatically and systematically generating test cases that are intended to be judged by a human oracle. The method works on a per-construction basis; given a construction from the grammar, it generates a finite but complete set of test sentences (typically tens or hundreds), where that construction is used in all possible ways. Our method is an alternative to using a corpus or a treebank, where no such completeness guarantees can be made. The method is language-independent and is implemented for the grammar formalism PMCFG, but also works for weaker grammar formalisms. We evaluate the method on a number of different grammars for different natural languages, with sizes ranging from toy examples to real-world grammars.
|
|
| 5. |
- Listenmaa, Inari, 1987, et al.
(författare)
-
Constraint Grammar as a SAT problem
- 2015
-
Ingår i: Proceedings of the Workshop on “Constraint Grammar - methods, tools and applications” at NODALIDA 2015. - 9789175190372 ; :113, s. 24-27
-
Konferensbidrag (refereegranskat)abstract
- We represent Constraint Grammar (CG) as a Boolean satisfiability (SAT) problem. Encoding CG in logic brings some new features to the grammars. The rules are interpreted in a more declarative way, which makes it possible to abstract away from details such as cautious context and ordering. A rule is allowed to affect its context words, which makes the number of the rules in a grammar potentially smaller. Ordering can be preserved or discarded; in the latter case, we solve eventual rule conflicts by finding a solution that discards the least number of rule applications. We test our implementation by parsing texts in the order of 10,000s–100,000s words, using grammars with hundreds of rules.
|
|
| 6. |
- Listenmaa, Inari
(författare)
-
Formal Methods for Testing Grammars
- 2019
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Grammar engineering has a lot in common with software engineering. Analogous to a program specification, we use descriptive grammar books; in place of unit tests, we have gold standard corpora and test cases for manual inspection. And just like any software, our grammars still contain bugs: grammatical sentences that are rejected, ungrammatical sentences that are parsed, or grammatical sentences that get the wrong parse. This thesis presents two contributions to the analysis and quality control of computational grammars of natural languages. Firstly, we present a method for finding contradictory grammar rules in Constraint Grammar, a robust and low-level formalism for part-of-speech tagging and shallow parsing. Secondly, we generate minimal and representative test suites of example sentences that cover all grammatical constructions in Grammatical Framework, a multilingual grammar formalism based on deep structural analysis.
|
|
| 7. |
- Listenmaa, Inari
(författare)
-
Testing Natural Language Grammars
- 2018
-
Ingår i: 2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST). - : IEEE. - 9781538650127 ; , s. 428-429
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 8. |
- Ranta, Aarne, 1963, et al.
(författare)
-
An End-to-End Pipeline from Law Text to Logical Formulas
- 2022
-
Ingår i: Frontiers in Artificial Intelligence and Applications. - : IOS Press Ebooks. - 0922-6389 .- 1879-8314. ; 362, s. 237-242
-
Konferensbidrag (refereegranskat)abstract
- We propose a pipeline for converting natural English law texts into logical formulas via a series of structural representations. Text texts are first parsed using a formal grammar derived from light-weight annotations. An intermediate representation called assembly logic is then used for logical interpretation and supports translations to different back-end logics and visualisations. The approach, while rule-based and explainable, is also robust: it can deliver useful results from day one, but allows subsequent refinements and variations.
|
|
| 9. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Grammatical Framework: From Interlingual Semantics to Morphophonemic Processes
- 2023
-
Ingår i: Rule-Based Language Technology. - : Northern European Association for Language Technology (NEALT). - 1736-6291. ; , s. 9-48
-
Bokkapitel (refereegranskat)abstract
- Grammatical Framework (GF) is a programming language and a grammar formalism. It is designed to cover all levels of rule-based language processing, from semantics via syntax to the smallest details of morphology. Its most well-known applications are interlingual machine translation and multilingual text generation, but it is being increasingly used for creating general-purpose language-processing components, both for the major languages of Europe and the World and for languages with little or no earlier resources. In this paper, we will focus on the practical use of GF for rule-based description of linguistic structures, ranging from semantics to morphophonemics.
|
|
| 10. |
|
|
