| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
PGF: A Portable Run-time Format for Type-theoretical Grammars
- 2010
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 19:2, s. 201-228
-
Tidskriftsartikel (refereegranskat)abstract
- Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.
|
|
| 6. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
Speech-Enabled Hybrid Multilingual Translation for Mobile Devices
- 2014
-
Ingår i: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. - : Association for Computational Linguistics. - 9781937284756
-
Konferensbidrag (refereegranskat)abstract
- This paper presents an architecture and a prototype for speech-to-speech translation on Android devices, based on GF (Grammatical Framework). From the user’s point of view, the advantage is that the system works off-line and yet has a lean size; it also gives, as a bonus, grammatical information useful for language learners. From the developer’s point of view, the advantage is the open architecture that permits the customization of the system to new languages and for special purposes. Thus the architecture can be used for controlled-language-like translators that deliver very high quality, which is the traditional strength of GF. However, this paper focuses on a general-purpose system that allows arbitrary input. It covers eight languages.
|
|
| 7. |
- Archambault, Dominique, et al.
(författare)
-
Using GF in multimodal assistants for mathematics
- 2012
-
Ingår i: Online Proceedings of the International Workshop on "Digitization and E-Inclusion in Mathematics and Science 2012" (DEIMS12).
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present an ongoing effort in the computational linguistic field to develop multilingual assistive technologies for mathematics. The approach is based on the Grammatical Framework used in combination with UMCL and semantic encodings of mathematics like OpenMath and MathML3. We review the formats for supporting alternative modalities of presentation of mathematics in order to evaluate the effectiveness of the proposed approach. Finally we describe a very initial prototype built using off-the-shelf speech synthesis to interface to the Sage suite of computer algebra systems.
|
|
| 8. |
- Bringert, Björn, 1979, et al.
(författare)
-
A pattern for almost compositional functions
- 2006
-
Ingår i: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, Portland, Oregon, USA, September 18-20, 2006. - 1595933093 ; , s. 216-226
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for a number of the constructors in the type(s), the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern are given. The relationship to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory are also investigated.
|
|
| 9. |
- Bringert, Björn, 1979, et al.
(författare)
-
A Pattern for Almost Compositional Functions
- 2008
-
Ingår i: Journal of Functional Programming. - 0956-7968. ; 18:5-6, s. 567-598
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for all of the constructors in the type(s), except a limited number of them, the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern are given, implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern. The relationships to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory, are investigated by reimplementing our operations using those frameworks.
|
|
| 10. |
|
|
| 11. |
|
|
| 12. |
- Bringert, Björn, 1979, et al.
(författare)
-
Multimodal Dialogue System Grammars
- 2005
-
Ingår i: Proceedings of DIALOR'05, Ninth Workshop on the Semantics and Pragmatics of Dialogue.
-
Tidskriftsartikel (refereegranskat)abstract
- We describe how multimodal grammars for dialogue systems can be written using the Grammatical Framework (GF) formalism. A proof-of-concept dialogue system constructed using these techniques is also presented. The software engineering problem of keeping grammars for different languages, modalities and systems (such as speech recognizers and parsers) in sync is reduced by the formal relationship between the abstract and concrete syntaxes, and by generating equivalent grammars from GF grammars.
|
|
| 13. |
- Caprotti, Olga, 1964, et al.
(författare)
-
High-quality translation: Molto tools and applications
- 2012
-
Ingår i: The fourth Swedish Language Technology Conference (SLTC).
-
Konferensbidrag (refereegranskat)abstract
- MOLTO (Multilingual On Line Translation, FP7-ICT-247914, www.molto-project.eu) is a European project focusing on translation on the web. MOLTO targets translation that has production quality, that is, usable for quick and reliable dissemination of information. MOLTO’s main focus is to increase the productivity of such translation systems, building on the technology of GF (Grammatical Framework) and its Resource Grammar Library. But MOLTO also develops hybrid methods which increase the quality of Statistical Machine Translation (SMT) by adding linguistic information, or bootstrap grammatical models from statistical models. This paper gives a brief overview of MOLTO’s latest achievements, many of which are more thoroughly described in separate papers and available as web-based demos and as open-source software.
|
|
| 14. |
|
|
| 15. |
- Caprotti, Olga, 1964, et al.
(författare)
-
The MOLTO Phrasebook
- 2010
-
Ingår i: Swedish Language Technology Conference SLTC 2010.
-
Konferensbidrag (refereegranskat)
|
|
| 16. |
- Cooper, Robin, 1947, et al.
(författare)
-
Natural Languages as Collections of Resources
- 2008
-
Ingår i: Language in flux : dialogue coordination, language variation, change and evolution (Communication, Mind, and Language ; 1). - London : College Publications. - 9781904987963 ; , s. 109-120
-
Bokkapitel (refereegranskat)
|
|
| 17. |
- Damova, Mariana, et al.
(författare)
-
Natural Language Interaction with Semantic Web Knowledge Bases and Linked Open Data
- 2014
-
Ingår i: Towards multilingual Semantic Web. - Berlin : Springer. - 9783662435854 ; , s. 211-226
-
Bokkapitel (refereegranskat)abstract
- Cultural heritage appears to be a very useful use case for Semantic Web technologies. The domain provides with plenty of circumstances where linkages between different knowledge sources are required to ensure access to rich information and respond to the needs of professionals dealing with cultural heritage content. Semantic Web technologies offer the technological backbone to meet the requirement of integrating heterogeneous data easily, but they are still more adapted to be consumed by computers than by humans, especially non-engineers or developers. This chapter is about a technique which allows interaction in natural language with semantic knowledge bases. The proposed technique offers a method that allows querying a semantic repository in natural language and obtaining results from it as a coherent text. This unique solution includes several steps of transition from natural language to SPARQL and from RDF to coherent multilingual descriptions, using the Grammatical Framework, GF. The approach builds on a semantic knowledge infrastructure in RDF, it is based on OWLIM-SE and the data integration method Reason-able View supplied with an ontological reference layer. The latter is connected via formal rules with abstract representations derived from the syntactic trees of natural language input using the GF resource grammar library.
|
|
| 18. |
- 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.
|
|
| 19. |
- Dannélls, Dana, 1976, et al.
(författare)
-
Multilingual access to cultural heritage content on the Semantic Web
- 2013
-
Ingår i: Language Technology for Cultural Heritage, Social Sciences, and Humanities (LaTeCH).
-
Konferensbidrag (refereegranskat)abstract
- As the amount of cultural data available on the Semantic Web is expanding, the demand of accessing this data in multiple languages is increasing. Previous work on multilingual access to cultural heritage information has shown that mapping from ontologies to natural language requires at least two different steps: (1) mapping multilingual metadata to interoperable knowledge sources; (2) assigning multilingual knowledge to cultural data. This paper presents our work on making cultural heritage content available on the Semantic Web and accessible in 15 languages. The objective of our work is both to form queries and to retrieve semantic content in multiple languages. We describe our experiences with processing museum data extracted from two different sources, harmonizing this data and making its content accessible in natural language.
|
|
| 20. |
- Dannélls, Dana, 1976, et al.
(författare)
-
Translation and retrieval system for museum object descriptions
- 2013
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- This is the final report of Workpackage 8: Case Study: Cultural Heritage. The major contributions reported are ontology-based multilingual grammar covering 15 languages and cross-language retrieval system for museum object descriptions using Semantic Web technology. Our groundwork for this deliverable was laid in D8.1: Ontology and corpus study of the cultural heritage domain, and D8.2: Multilingual grammar for museum object descriptions.
|
|
| 21. |
|
|
| 22. |
- Detrez, Gregoire, 1985, et al.
(författare)
-
Smart Paradigms and the predictability and complexity of inflectional morphology
- 2012
-
Ingår i: EACL 2012 - 13th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings. ; , s. 645-653
-
Konferensbidrag (refereegranskat)abstract
- Morphological lexica are often implemented on top of morphological paradigms, corresponding to different ways of building the full inflection table of a word. Computationally precise lexica may use hundreds of paradigms, and it can be hard for a lexicographer to choose among them. To automate this task, this paper introduces the notion of a smart paradigm. It is a metaparadigm, which inspects the base form and tries to infer which low-level paradigm applies. If the result is uncertain, more forms are given for discrimination. The number of forms needed in average is a measure of predictability of an inflection system. The overall complexity of the system also has to take into account the code size of the paradigms definition itself. This paper evaluates the smart paradigms implemented in the open-source GF Resource Grammar Library. Predictability and complexity are estimated for four different languages: English, French, Swedish, and Finnish. The main result is that predictability does not decrease when the complexity of morphology grows, which means that smart paradigms provide an efficient tool for the manual construction and/or automatically bootstrapping of lexica.
|
|
| 23. |
- Enache, Ramona, 1985, et al.
(författare)
-
A Hybrid System for Patent Translation
- 2012
-
Ingår i: Proceedings of the 16th Annual Conference of the European Association for Machine Translation (EAMT12), Trento, Italy.
-
Konferensbidrag (refereegranskat)abstract
- This work presents a HMT system for patent translation. The system exploits the high coverage of SMT and the high precision of an RBMT system based on GF to deal with specific issues of the language. The translator is specifically developed to translate patents and it is evaluated in the English-French language pair. Although the number of issues tackled by the grammar are not extremely numerous yet, both manual and automatic evaluations consistently show their preference for the hybrid system in front of the two individual translators.
|
|
| 24. |
- Enache, Ramona, 1985, et al.
(författare)
-
An Open-Source Computational Grammar for Romanian
- 2010
-
Ingår i: Computational Linguistics and Intelligent Text Processing 11th International Conference, CICLing 2010, Iasi, Romania, March 21-27, 2010, Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. ; 6008, s. 163-174
-
Konferensbidrag (refereegranskat)abstract
- We describe the implementation of a computational grammar for Romanian as a resource grammar in the GF project (Grammatical Framework). Resource grammars are the basic constituents of the GF library. They consist of morphological and syntactical modules which implement a common abstract syntax, also describing the basic features of a language. The present paper explores the main features of the Romanian grammar, along with the way they fit into the framework that GF provides. We also compare the implementation for Romanian with related resource grammars that exist already in the library. The current resource grammar allows generation and parsing of natural language and can be used in multilingual translations and other GF-related applications. Covering a wide range of specific morphological and syntactical features of the Romanian language, tins GF resource grammar is the most comprehensive open-source grammar existing so far for Romanian.
|
|
| 25. |
- Espana-Bonet, Cristina, et al.
(författare)
-
Patent translation within the MOLTO project
- 2011
-
Ingår i: Proceedings of the 4th Workshop on Patent Translation, MT Summit XIII, Xiamen, China, September 23, 2011..
-
Konferensbidrag (refereegranskat)abstract
- MOLTO is an FP7 European project whose goal is to translate texts between multiple languages in real time with high quality. Patents translation is a case of study where research is focused on simultaneously obtaining a large coverage without loosing quality in the translation. This is achieved by hybridising between a grammar-based multilingual translation system, GF, and a specialised statistical machine translation system. However, both individual systems by themselves already represent a step forward in the translation of patents in the biomedical domain, for which the systems have been trained.
|
|
| 26. |
- Forsberg, Markus, 1974, et al.
(författare)
-
Functional Morphology
- 2004
-
Ingår i: SIGPLAN notices. - : Association for Computing Machinery (ACM). - 0362-1340 .- 1558-1160 .- 0730-8566. ; 39:9, s. 213-223
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a methodology for implementing natural language morphology in the functional language Haskell. The main idea behind is simple: instead of working with untyped regular expressions, which is the state of the art of morphology in computational linguistics, we use finite functions over hereditarily finite algebraic datatypes. The definitions of these datatypes and functions are the language-dependent part of the morphology. The language-independent part consists of an untyped dictionary format which is used for synthesis of word forms, and a decorated trie, which is used for analysis. Functional Morphology builds on ideas introduced by Huet in his computational linguistics toolkit Zen, which he has used to implement the morphology of Sanskrit. The goal has been to make it easy for linguists, who are not trained as functional programmers, to apply the ideas to new languages. As a proof of the productivity of the method, morphologies for Swedish, Italian, Russian, Spanish, and Latin have already been implemented using the library. The Latin morphology is used as a running example in this article.
|
|
| 27. |
- Forsberg, Markus, 1974, et al.
(författare)
-
Labelled BNF: a high-level formalism for defining well-behaved programming languages
- 2003
-
Ingår i: Proceedings of the Estonian Academy of Sciences, Physics, Mathem, December 2003. ; 52:4
-
Konferensbidrag (refereegranskat)abstract
- The grammar formalism Labelled BNF (LBNF) and the compiler construction tool BNF Converter are introduced. Given a grammar written in LBNF, the BNF Converter produces a complete compiler front end (up to, but excluding, type checking), i.e. a lexer, a parser, and an abstract syntax definition. Moreover, it produces a pretty-printer and a language specification in L A T E X, as well as a template file for the compiler back end. A language specification in LBNF is completely declarative and therefore portable. It reduces dramatically the effort of implementing a language. The price to pay is that the language must be "well-behaved", i.e. that its lexical structure must be describable by a regular expression and its syntax by a context-free grammar.
|
|
| 28. |
- Forsberg, Markus, 1974, et al.
(författare)
-
Lexicon Extraction from Raw Text Data
- 2006
-
Ingår i: Advances in Natural Language Processing: Proceedings of the 5th International Conference, FinTAL 2006 Turku, Finland, August 23-25, 2006 / Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. - : SPRINGER. ; , s. 488-499, s. 488-499
-
Konferensbidrag (refereegranskat)
|
|
| 29. |
- Gruzitis, Normunds, et al.
(författare)
-
Formalising the Swedish Constructicon in Grammatical Framework
- 2015
-
Ingår i: Proceedings of the Grammar Engineering Across Frameworks (GEAF) Workshop, 53rd Annual Meeting of the ACL and 7th IJCNLP, Beijing, China, July 26-31, 2015. - 9781932432664
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a semi-automatic approach to acquire a computational construction grammar from the semi-formal Swedish Constructicon. The implementation is based on the resource grammar library provided by Grammatical Framework and can be seen as an extension to the existing Swedish resource grammar. An important consequence of this work is that it generates feedback, explicit and implicit, on how to improve the annotation consistency and adequacy of the original construction resource.
|
|
| 30. |
- Gruzitis, Normunds, et al.
(författare)
-
Grammatical Framework for implementing multilingual frames and constructions
- 2016
-
Ingår i: Book of Abstracts. The 9th International Conference on Construction Grammar (ICCG9) theme session on Computational Semantics with Frames and Constructions. October 05-09, 2016, Juiz de Fora, Brazil.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 31. |
- Hallgren, Thomas, 1965, et al.
(författare)
-
A Cloud-Based Editor for Multilingual Grammars
- 2015
-
Ingår i: ACL-IJCNLP 2015. - : Association for Computational Linguistics.
-
Konferensbidrag (refereegranskat)abstract
- Abstract Writing deep linguistic grammars has been considered a highly specialized skill, requiring the use of tools with steep learning curves and complex installation procedures. As the use of statistical methods has increased, new generations of computational linguists are getting less and less prepared for grammar writing tasks. In an aim to provide a better learning experience for grammar writers, we present a grammar engineering tool that resides in the cloud. It has been used in several tutorial courses and self-studies, and it ...
|
|
| 32. |
- Hammarström, Harald, 1977, et al.
(författare)
-
Cardinal Numerals Revisited in GF
- 2004
-
Ingår i: Workshop On Numerals In The World's Languages. 29 - 30 March 2004 Leipzig, Germany.
-
Konferensbidrag (refereegranskat)
|
|
| 33. |
- Humayoun, Muhammad, 1979, et al.
(författare)
-
Developing Punjabi Morphology, Corpus and Lexicon
- 2010
-
Ingår i: The 24th Pacific Asia conference on Language, Information and Computation (PACLIC24). - 9784905166009
-
Konferensbidrag (refereegranskat)abstract
- We describe an implementation of morphology, development of a corpus and building of a lexicon for Punjabi language. Such resources are building blocks for various language technology tasks ranging from part of speech tagging to machine translation. Their importance is further increased by the fact that Punjabi is an under resourced language. We release these resources as open-source.
|
|
| 34. |
- Humayoun, Muhammad, 1979, et al.
(författare)
-
Urdu Morphology, Orthography and Lexicon Extraction
- 2007
-
Ingår i: CAASL-2: The Second Workshop on Computational Approaches to Arabic Script-based Languages, July 21-22, 2007, LSA 2007 Linguistic Institute, Stanford University. - : Stanford, California. ; , s. 59-68
-
Konferensbidrag (refereegranskat)
|
|
| 35. |
- Hähnle, Reiner, 1962, et al.
(författare)
-
An Authoring Tool for informal and Formal Requirements Specifications
- 2002
-
Ingår i: Lecture Notes in Computer Science. 5th International Conference on Fundamental Approaches to Software Engineering, Grenoble, 8-12 April 2002. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 3540433538 ; 2306, s. 233-248
-
Konferensbidrag (refereegranskat)abstract
- We describe foundations and design principles of a tool that supports authoring of informal and formal software requirements specifications simultaneously and from a single source. The tool is an attempt to bridge the gap between completely informal requirements specifications (as found in practice) and formal ones (as needed in formal methods). The user is supported by an interactive syntax-directed editor, parsers and linearizers. As a formal specification language we realize the Object Constraint Language, a substandard of the UML, on the informal side a fragment of English. The implementation is based on the Grammatical Framework, a generic tool that combines linguistic and logical methods.
|
|
| 36. |
|
|
| 37. |
|
|
| 38. |
- Khegai, Janna, 1975, et al.
(författare)
-
Building and Using a Russian Resource Grammar in GF
- 2004
-
Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. ; 2945, s. 38-41
-
Tidskriftsartikel (refereegranskat)abstract
- Grammatical Framework (GF) [5] is a grammar formalism for describing formal and natural languages. An application grammar in GF is usually written for a restricted language domain, e.g. to map a formal language to a natural language. A resource grammar, on the other hand, aims at a complete description of a natural languages. The language-independent grammar API (Application Programmer's Interface) allows the user of a resource grammar to build application grammars in the same way as a programmer writes programs using a standard library. In an ongoing project, we have developed an API suitable for technical language, and implemented it for English, Finnish, French, German, Italian, Russian, and Swedish. This paper gives an outline of the project using Russian as an example.
|
|
| 39. |
|
|
| 40. |
- Khegai, Janna, 1975, et al.
(författare)
-
Multilingual Syntax Editing in GF
- 2003
-
Ingår i: Proceedings of 4th international conference on Computational Linguistics and Intelligent Text Processing, CICLing 2003, Mexico City, Mexico.
-
Konferensbidrag (refereegranskat)abstract
- GF (Grammatical Framework) makes it possible to perform multilingual authoring of documents in restricted languages. The idea is to use an object in type theory to describe the common abstract syntax of a document and then map this object to a concrete syntax in the different languages using linearization functions, one for each language. Incomplete documents are represented using metavariables in type theory. The system belongs to the tradition of logical frameworks in computer science. The paper gives a description of how a user can use the editor to build a document in several languages and also shows some examples how ambiguity is resolved using type checking. There is a brief description of how GF grammars are written for new domains and how linearization functions are defined
|
|
| 41. |
|
|
| 42. |
|
|
| 43. |
|
|
| 44. |
|
|
| 45. |
|
|
| 46. |
- Masciolini, Arianna, 1996, et al.
(författare)
-
Grammar-based concept alignment for domain-specific Machine Translation
- 2021
-
Ingår i: Proceedings of the Seventh International Workshop on Controlled Natural Language (CNL 2020/21).
-
Konferensbidrag (refereegranskat)abstract
- Grammar-based domain-specific MT systems are a common use case for CNLs. High-quality translation lexica are a crucial part of such systems, but involve time consuming work and significant linguistic knowledge. With parallel example sentences available, statistical alignment tools can help automate part of the process, but they are not suitable for small datasets and do not always perform well with complex multiword expressions. In addition, the correspondences between word forms obtained in this way cannot be used directly. Addressing these problems, we propose a grammar-based approach to this task and put it to test in a simple translation pipeline.
|
|
| 47. |
- Prasanth, Kolachina, et al.
(författare)
-
From Abstract Syntax to Universal Dependencies
- 2016
-
Ingår i: Linguistic Issues in Language Technology. - 1945-3590 .- 1945-3604. ; 13:3, s. 1-57
-
Tidskriftsartikel (refereegranskat)abstract
- Abstract syntax is a semantic tree representation that lies between parse trees and logical forms. It abstracts away from word order and lexical items, but contains enough information to generate both surface strings and logical forms. Abstract syntax is commonly used in compilers as an intermediate between source and target languages. Grammatical Framework (GF) is a grammar formalism that generalizes the idea to natural languages, to capture cross-lingual generalizations and perform interlingual translation. As one of the main results, the GF Resource Grammar Library (GF-RGL) has implemented a shared abstract syntax for over 30 languages. Each language has its own set of concrete syntax rules (morphology and syntax), by which it can be generated from the abstract syntax and parsed into it. This paper presents a conversion method from abstract syntax trees to dependency trees. The method is applied for converting GF-RGL trees to Universal Dependencies (UD), which uses a common set of la- bels for different languages. The correspondence between GF-RGL and UD turns out to be good, and the relatively few discrepancies give rise to interesting questions about universality. The conversion also has po- tential for practical applications: (1) it makes the GF parser usable as a rule-based dependency parser; (2) it enables bootstrapping UD tree- banks from GF treebanks; (3) it defines formal criteria to assess the informal annotation schemes of UD; (4) it gives a method to check the consistency of manually annotated UD trees with respect to the anno- tation schemes; (5) it makes information from UD treebanks available for the construction and ranking of GF trees, which can improve GF applications such as machine translation. The conversion is tested and evaluated by bootstrapping two small treebanks for 31 languages, as well as comparing a GF version of the English Penn treebank with the UD version.
|
|
| 48. |
-
Proceedings of the Grammar Engineering Across Frameworks (GEAF) 2015 Workshop
- 2015
-
Samlingsverk (redaktörskap) (övrigt vetenskapligt/konstnärligt)abstract
- Grammar Engineering Across Frameworks (GEAF) 2015 took place on 30 July 2015 in Beijing. This workshop builds on several previous workshop on the same topic, namely GEAF 2007 at the LSA Linguistic Institute at Stanford, GEAF 2008 at COLING in Manchester, GEAF 2009 at ACL/IJCNLP in Singapore and HMGE 2013 at ESSLLI 2013 in Düsseldorf. Grammar engineering, the practice of developing linguistically motivated grammars in software, is an active area of research in computational linguistics and comprises ...
|
|
| 49. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Abstract Syntax as Interlingua: Scaling Up the Grammatical Framework from Controlled Languages to Robust Pipelines
- 2020
-
Ingår i: Computational Linguistics. - : MIT Press. - 0891-2017 .- 1530-9312. ; 46:2, s. 425-486
-
Tidskriftsartikel (refereegranskat)abstract
- .Abstract syntax is an interlingual representation used in compilers. Grammatical Framework (GF) applies the abstract syntax idea to natural languages. The development of GF started in 1998, first as a tool for controlled language implementations, where it has gained an established position in both academic and commercial projects. GF provides grammar resources for over 40 languages, enabling accurate generation and translation, as well as grammar engineering tools and components for mobile and Web applications. On the research side, the focus in the last ten years has been on scaling up GF to wide-coverage language processing. The concept of abstract syntax offers a unified view on many other approaches: Universal Dependencies, WordNets, FrameNets, Construction Grammars, and Abstract Meaning Representations. This makes it possible for GF to utilize data from the other approaches and to build robust pipelines. In return, GF can contribute to data-driven approaches by methods to transfer resources from one language to others, to augment data by rule-based generation, to check the consistency of handannotated corpora, and to pipe analyses into high-precision semantic back ends. This article gives an overview of the use of abstract syntax as interlingua through both established and emerging NLP applications involving GF.
|
|
| 50. |
- Ranta, Aarne, 1963
(författare)
-
Abstract Wikipedia and Vastly Multilingual Natural Language Generation (Keynote Talk)
- 2021
-
Ingår i: Logic and Algorithms in Computational Linguistics (LACompLing).
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Abstract Wikipedia is an initiative from the Wikimedia Foundation to generate Wikipedia articles from an abstract (i.e., language-neutral) source in multiple languages. The goal has been set to 20 million articles in over 300 languages, guaranteed to be in synchrony with up-to-date information and thereby with each other. This is by far the largest Natural Language Generation (NLG) project of all times. Grammatical Framework (GF), with 40 languages and specialized domains such as science, law, and e-commerce, is orders of magnitude smaller. Nevertheless, GF has served as inspiration for Abstract Wikipedia, and pilot projects have started to scale it up to the task. Research in both NLG techniques, language resources, processing algorithms, and interaction with human authors is needed. This talk will outline a possible way to build up Abstract Wikipedia by starting with simple text-robot-like techniques and proceeding to more sophisticated NLG.
|
|
