SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Angelov Krasimir 1978 ) "

Sökning: WFRF:(Angelov Krasimir 1978 )

  • Resultat 1-10 av 36
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  • Angelov, Krasimir, 1978, et al. (författare)
  • A Framework for Conflict Analysis of Normative Texts Written in Controlled Natural Language
  • 2013
  • Ingår i: Journal of Logic and Algebraic Programming. - : Elsevier BV. - 1567-8326. ; 82:5-7, s. 216-240
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper we are concerned with the analysis of normative conflicts, or the detection of conflicting obligations, permissions and prohibitions in normative texts written in a Controlled Natural Language (CNL). For this we present AnaCon, a proof-of-concept system where normative texts written in CNL are automatically translated into the formal language CL using the Grammatical Framework (GF). Such CL expressions are then analysed for normative conflicts by the CLAN tool, which gives counter-examples in cases where conflicts are found. The framework also uses GF to give a CNL version of the counter-example, helping the user to identify the conflicts in the original text. We detail the application of AnaCon to two case studies and discuss the effectiveness of our approach.
  •  
3.
  • Angelov, Krasimir, 1978 (författare)
  • A Parallel WordNet for English, Swedish and Bulgarian
  • 2020
  • Ingår i: Proceedings of The 12th Language Resources and Evaluation Conference.
  • Konferensbidrag (refereegranskat)abstract
    • We present the parallel creation of a WordNet resource for Swedish and Bulgarian which is tightly aligned with the Princeton WordNet. The alignment is not only on the synset level, but also on word level, by matching words with their closest translations in each language. We argue that the tighter alignment is essential in machine translation and natural language generation. About one-fifth of the lexical entries are also linked to the corresponding Wikipedia articles. In addition to the traditional semantic relations in WordNet, we also integrate morphological and morpho-syntactic information. The resource comes with a corpus where examples from Princeton WordNet are translated to Swedish and Bulgarian. The examples are aligned on word and phrase level. The new resource is open-source and in its development we used only existing open-source resources.
  •  
4.
  •  
5.
  • Angelov, Krasimir, 1978, et al. (författare)
  • Editing with Search and Exploration for Controlled Languages
  • 2018
  • Ingår i: Controlled Natural Language / editors: Brian Davis, C. Maria Keet, Adam Wyner. - : IOS Press. - 0922-6389 .- 1879-8314. - 9781614999041 ; , s. 1-10
  • Bokkapitel (refereegranskat)abstract
    • We present an editor for controlled languages which is a combination of a syntax editor and a predictive editor. It shows a bird's-eye view which lets the user to explore what is possible in the language. Still, unlike the syntax editors the user is not expected to understand the underlying abstract syntax or ontology behind the language. It also lets the user to enter arbitrary phrases from which the editor finds the phrases which are the closest match.
  •  
6.
  • Angelov, Krasimir, 1978, et al. (författare)
  • Fast Statistical Parsing with Parallel Multiple Context-Free Grammars
  • 2014
  • Ingår i: EACL'14, 14th Conference of the European Chapter of the Association for Computational Linguistics.
  • Konferensbidrag (refereegranskat)abstract
    • We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which we added statistical ranking. We show that the new algorithm is several times faster than other statistical PMCFG parsing algorithms on real-sized grammars. At the same time the algorithm is more general since it supports non-binarized and non-linear grammars. We also show that if we make the search heuristics non-admissible, the parsing speed improves even further, at the risk of returning sub-optimal solutions.
  •  
7.
  • Angelov, Krasimir, 1978 (författare)
  • GF Runtime System
  • 2009
  • Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Natural languages have been subject of studies for centuriesand are hot topic even today. The demand for computer systems able to communicate directly in natural language places new challenges. Computational resources like grammars and lexicons and efficient processing tools are needed.Grammars are described as computer programs in declarativedomain specific languages. Just like any other programming language they require mature compilers and efficient runtime systems.The topic of this thesis is the runtime system for the Grammatical Framework (GF) language. The first part of the thesis describes the semantics of the Portable Grammar Format (PGF). This is a low-level format which for GF plays the same role as the JVM bytecode for Java. The representation is designed to be as simple as possible to make it easy to write interpreters for it. The second part is for the incremetal parsing algorithm in PGF. The parser performance was always a bottle neck in GF until now. The new parser is of orders of magnitude faster than any of the previous implementations. The last contribution of the thesis is the development of the Bulgarian resource grammar. This is the first Balkan language in the resource library and the first open-source grammar for Bulgarian. The grammar development was also an important benchmark for the development of the parsing algorithm.
  •  
8.
  • Angelov, Krasimir, 1978 (författare)
  • Incremental Parsing of Parallel Multiple Context-Free Grammars
  • 2009
  • Ingår i: 12th Conference of the European Chapter of the Association for Computational Linguistics. - Morristown, NJ, USA : Association for Computational Linguistics. - 9781932432169 ; , s. 69-76
  • Konferensbidrag (refereegranskat)abstract
    • Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has the advantage to be incremental and to support PMCFG directly rather than the weaker MCFG formalism. The algorithm is also top-down which allows it to be used for grammar based word prediction.
  •  
9.
  • Angelov, Krasimir, 1978 (författare)
  • Multiword expressions in multilingual applications within the Grammatical Framework
  • 2019
  • Ingår i: Representation and parsing of multiword expressions. - 2625-3127. ; , s. 127-146
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • The main focus of Grammatical Framework (GF) is in multilingual applications where the same type of content is produced and analyzed in several languages at once. This is achieved by joining the grammars for all languages with a shared interlingual representation. In designing the interlingua, multiword expressions are an important factor that must be considered. Here, I adopt the broader definition where everything that translates non-compositionally accross languages is considered an expression. In this chapter I present multiword expressions from a cross-lingual perspective in relation to an interlingual grammar.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 36

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy