| 1. |
- 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.
|
|
| 2. |
- 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.
|
|
| 3. |
|
|
| 4. |
- 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.
|
|
| 5. |
- Caprotti, Olga, 1964, et al.
(författare)
-
The MOLTO Phrasebook
- 2010
-
Ingår i: Swedish Language Technology Conference SLTC 2010.
-
Konferensbidrag (refereegranskat)
|
|
| 6. |
- 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.
|
|
| 7. |
- 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.
|
|
| 8. |
- 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.
|
|
| 9. |
- 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)
|
|
| 10. |
- 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)
|
|
