Guntis Barzdins
University of Latvia
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Guntis Barzdins.
controlled natural language | 2009
Adam Z. Wyner; Krasimir Angelov; Guntis Barzdins; Danica Damljanovic; Brian T. Davis; Norbert E. Fuchs; Stefan Hoefler; Ken Jones; Kaarel Kaljurand; Tobias Kuhn; Martin Luts; Jonathan Pool; Mike Rosner; Rolf Schwitter; John F. Sowa
This collaborative report highlights the properties and prospects of Controlled Natural Languages (CNLs). The report poses a range of questions concerning the goals of the CNL, the design, the linguistic aspects, the relationships and evaluation of CNLs, and the application tools. In posing the questions, the report attempts to structure the field of CNLs and to encourage further systematic discussion by researchers and developers.
extended semantic web conference | 2011
Martins Zviedris; Guntis Barzdins
The presented tool uses a novel approach to explore and query a SPARQL endpoint. The tool is simple to use as a user needs only to enter an address of a SPARQL endpoint of ones interest. The tool will extract and visualize graphically the data schema of the endpoint. The user will be able to overview the data schema and use it to construct a SPARQL query according to the data schema. The tool can be downloaded from http://viziquer.lumii.lv. There is also additional information and help on how to use it in practice.
north american chapter of the association for computational linguistics | 2016
Guntis Barzdins; Didzis Gosko
Two extensions to the AMR smatch scoring script are presented. The first extension com-bines the smatch scoring script with the C6.0 rule-based classifier to produce a human-readable report on the error patterns frequency observed in the scored AMR graphs. This first extension results in 4% gain over the state-of-art CAMR baseline parser by adding to it a manually crafted wrapper fixing the identified CAMR parser errors. The second extension combines a per-sentence smatch with an en-semble method for selecting the best AMR graph among the set of AMR graphs for the same sentence. This second modification au-tomatically yields further 0.4% gain when ap-plied to outputs of two nondeterministic AMR parsers: a CAMR+wrapper parser and a novel character-level neural translation AMR parser. For AMR parsing task the character-level neural translation attains surprising 7% gain over the carefully optimized word-level neural translation. Overall, we achieve smatch F1=62% on the SemEval-2016 official scor-ing set and F1=67% on the LDC2015E86 test set.
controlled natural language | 2012
Normunds Gruzitis; Peteris Paikens; Guntis Barzdins
In this paper we present an ongoing research investigating the possibility and potential of integrating frame semantics, particularly FrameNet, in the Grammatical Framework (GF) application grammar development. An important component of GF is its Resource Grammar Library (RGL) that encapsulates the low-level linguistic knowledge about morphology and syntax of currently more than 20 languages facilitating rapid development of multilingual applications. In the ideal case, porting a GF application grammar to a new language would only require introducing the domain lexicon – translation equivalents that are interlinked via common abstract terms. While it is possible for a highly restricted CNL, developing and porting a less restricted CNL requires above average linguistic knowledge about the particular language, and above average GF experience. Specifying a lexicon is mostly straightforward in the case of nouns (incl. multi-word units), however, verbs are the most complex category (in terms of both inflectional paradigms and argument structure), and adding them to a GF application grammar is not a straightforward task. In this paper we are focusing on verbs, investigating the possibility of creating a multilingual FrameNet-based GF library. We propose an extension to the current RGL, allowing GF application developers to define clauses on the semantic level, thus leaving the language-specific syntactic mapping to this extension. We demonstrate our approach by reengineering the MOLTO Phrasebook application grammar.
Computer Networks | 1999
Andris Sidorovs; Guntis Barzdins; Janis Lacis; Karlis Ogsts
Abstract Address Resolution Protocol (ARP) is one of the key TCP/IP stack protocols, used on LANs to map 32 bit IP addresses into 48 bit hardware addresses. Regular ARP uses MAC layer broadcasts to perform the mapping. In this paper a new server-based ARP extension (smartARP) is proposed, which allows the extension of ARP functionality beyond a single MAC layer broadcast domain. Compared to regular IP router, smartARP together with simple broadcast-filtering switches presents a low-cost alternative for forwarding packets between MAC layer broadcast domains. SmartARP is transparent to existing IP hosts, operates independent of LAN speed, and scales for big networks.
algorithmic learning theory | 1993
Janis Barzdins; Guntis Barzdins; Kalvis Apsitis; Ugis Sarkans
Our goal through several years has been the development of efficient search algorithm for inductive inference of expressions using only input/output examples. The idea is to avoid exhaustive search by means of taking full advantage of semantic equality of many considered expressions. This might be the way that people avoid too big search when finding proof strategies for theorems, etc. As a formal model for the development of the method we use arithmetic expressions over the domain of natural numbers. A new approach for using weights associated with the functional symbols for restricting search space is considered. This allows adding constraints like the frequency of particular symbols in the expression. Additionally the current state of the art of computer experiments using this methodology is described. An example that is considered is the inductive inference of the formula for solving quadratic equations, the finding of which by pure exhaustive search would be unrealistic.
Baltic Computer Science, Selected Papers | 1991
Guntis Barzdins
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
controlled natural language | 2014
Guntis Barzdins
The paper presents a FrameNet-based information extraction and knowledge representation framework, called FrameNet-CNL. The framework is used on natural language documents and represents the extracted knowledge in a tailor-made Frame-ontology from which unambiguous FrameNet-CNL paraphrase text can be generated automatically in multiple languages. This approach brings together the fields of information extraction and CNL, because a source text can be considered belonging to FrameNet-CNL, if information extraction parser produces the correct knowledge representation as a result. We describe a state-of-the-art information extraction parser used by a national news agency and speculate that FrameNet-CNL eventually could shape the natural language subset used for writing the newswire articles.
international semantic technology conference | 2013
Martins Zviedris; Aiga Romane; Guntis Barzdins; Karlis Cerans
We describe a novel way for creating information systems based on ontologies. The described solution is aimed at domain experts who would benefit from being able to quickly prototype fully-functional, web-based information system for data input, editing and analysis. The systems backbone is SPARQL 1.1 endpoint that enables organization users to view and edit the data, while outside users can get read-only access to the endpoint. The system prototype is implemented and successfully tested with Latvian medical data ontology with 60 classes and imported 5 000 000 data-level triples.
controlled natural language | 2009
Normunds Gruzitis; Guntis Barzdins
Computational semantics and logic-based controlled natural languages (CNL) do not address systematically the word sense disambiguation problem of content words, i.e., they tend to interpret only some functional words that are crucial for construction of discourse representation structures. We show that micro-ontologies and multi-word units allow integration of the rich and polysemous multi-domain background knowledge into CNL thus providing interpretation for the content words. The proposed approach is demonstrated by extending the Attempto Controlled English (ACE) with polysemous and procedural constructs resulting in a more natural CNL named PAO covering narrative multi-domain texts.