Results 61 to 70 of about 147 (106)
Some of the next articles are maybe not open access.
2015
The dichotomy of generic and specific manifests itself in the programming sphere. Domain-specific languages (DSLs) are one of the forms of the manifestations of this dichotomy. Domain-specific languages are just what they are called: domain specific. All programming languages are domain-specific languages when they come into existence, but that changes
David Pollak, Vishal Layka
openaire +2 more sources
The dichotomy of generic and specific manifests itself in the programming sphere. Domain-specific languages (DSLs) are one of the forms of the manifestations of this dichotomy. Domain-specific languages are just what they are called: domain specific. All programming languages are domain-specific languages when they come into existence, but that changes
David Pollak, Vishal Layka
openaire +2 more sources
1999
Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude using continuations.
Pieter Koopman, Marinus J. Plasmeijer
openaire +1 more source
Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude using continuations.
Pieter Koopman, Marinus J. Plasmeijer
openaire +1 more source
Parser combinators for context-free path querying
Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 2018Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs.
Ilya Nozkin +3 more
openaire +2 more sources
Combining Analyses from Various Parsers
2000This chapter describes measures implemented in the semantics module to ensure that best use is made of the available linguistic analyses.
Karsten L. Worm +3 more
openaire +2 more sources
Improved Parsing for Arabic by Combining Diverse Dependency Parsers
2014Recently there has been a considerable interest in dependency parsing for many reasons. First, it works accurately for a wide range of typologically different languages. Second, it can be useful for semantics, since it can be easier to attach compositional rules directly to lexical items than to assign them to large numbers of phrase structure rules ...
Alabbas, Maytham, Ramsay, Allan
openaire +2 more sources
Improving Dependency Analysis by Syntactic Parser Combination
2005 International Conference on Natural Language Processing and Knowledge Engineering, 2006The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results.
openaire +2 more sources
, 2003 Combining Dependency Parsers Using Error Rates
2016In this paper, we present a method of improving dependency parsing accuracy by combining parsers using error rates. We use four parsers: MSTParser, MaltParser, TurboParser and MateParser, and the data of the analytical layer of the Prague Dependency Treebank.
openaire +2 more sources
Capturing semantic features to improve Chinese event detection
CAAI Transactions on Intelligence Technology, 2022Yongbin Liu
exaly
FlexParser—The adaptive log file parser for continuous results in a changing world
Journal of Software: Evolution and Process, 2022Nadine Rücker, Andreas K Maier
exaly