Search results for "Parsing"
showing 10 items of 46 documents
Predictive Model Markup Language (PMML) Representation of Bayesian Networks: An Application in Manufacturing
2018
International audience; Bayesian networks (BNs) represent a promising approach for the aggregation of multiple uncertainty sources in manufacturing networks and other engineering systems for the purposes of uncertainty quantification, risk analysis, and quality control. A standardized representation for BN models will aid in their communication and exchange across the web. This article presents an extension to the predictive model markup language (PMML) standard for the representation of a BN, which may consist of discrete variables, continuous variables, or their combination. The PMML standard is based on extensible markup language (XML) and used for the representation of analytical models…
Combining Machine Translated Sentence Chunks from Multiple MT Systems
2018
This paper presents a hybrid machine translation (HMT) system that pursues syntactic analysis to acquire phrases of source sentences, translates the phrases using multiple online machine translation (MT) system application program interfaces (APIs) and generates output by combining translated chunks to obtain the best possible translation. The aim of this study is to improve translation quality of English – Latvian texts over each of the individual MT APIs. The selection of the best translation hypothesis is done by calculating the perplexity for each hypothesis using an n-gram language model. The result is a phrase-based multi-system machine translation system that allows to improve MT out…
Extracting locations from sport and exercise-related social media messages using a neural network-based bilingual toponym recognition model
2022
Funding: This study is a part of the “Equality in suburban physical activity environments, YLLI” research project (in Finnish: Yhdenvertainen liikunnallinen lähiö, YLLI). The project is being financed by the research program about suburban in Finland “Lähiöohjelma 2020-2022” coordinated by the Ministry of Environment (grant recipient: Dr. Petteri Muukkonen). Sport and exercise contribute to health and well-being in cities. While previous research has mainly focused on activities at specific locations such as sport facilities, “informal sport” that occur at arbitrary locations across the city have been largely neglected. Such activities are more challenging to observe, but this challenge may…
Computing the Original eBWT Faster, Simpler, and with Less Memory
2021
Mantaci et al. [TCS 2007] defined the \(\mathrm {eBWT}\) to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. However, since this introduction, it has been used more generally to describe any \(\mathrm {BWT}\) of a collection of strings, and the fundamental property of the original definition (i.e., the independence from the input order) is frequently disregarded. In this paper, we propose a simple linear-time algorithm for the construction of the original \(\mathrm {eBWT}\), which does not require the preprocessing of Bannai et al. [CPM 2021]. As a byproduct, we obtain the first linear-time algorithm for computing the \(\mathrm {BWT}\) of a single string that uses …
The formation of structurally relevant units in artificial grammar learning
2002
A total of 78 adult participants were asked to read a sample of strings generated by a finite state grammar and, immediately after reading each string, to mark the natural segmentation positions with a slash bar. They repeated the same task after a phase of familiarization with the material, which consisted, depending on the group involved, of learning items by rote, performing a short term matching task, or searching for the rules of the grammar. Participants formed the same number of cognitive units before and after the training phase, thus indicating that they did not tend to form increasingly large units. However, the number of different units reliably decreased, whatever the task that…
Quantifying stenosis in renal arteriograms: a fuzzy syntactic analysis.
1999
AbstractThe introduction of fuzzy logic improves a system for the automatic quantification of renal artery lesions seen in digital subtraction angiograms. A two-step approach has been followed. An earlier system based on non-fuzzy syntactic analysis provided a clear symbolic description of the stenotic lesions. Although this system worked correctly, it did not take into account the variability and uncertainty inherent to image processing and to knowledge on the reference diameter. This system has been improved by the introduction of fuzzy logic in the representation of the reference diameter. It provides a description of the stenosis in terms of fuzzy quantities. To illustrate the benefits …
Natural Language Parsing
2009
Automatic natural language processing captures a lion’s share of the attention in open information management. In one way or another, many applications have to deal with natural language input. In this chapter the authors investigate the problem of natural language parsing from the perspective of biolinguistics. They argue that the human mind succeeds in the parsing task without the help of languagespecific rules of parsing and language-specific rules of grammar. Instead, there is a universal parser incorporating a universal grammar. The main argument comes from language acquisition: Children cannot learn language specific parsing rules by rule induction due to the complexity of unconstrain…
Context-free Languages
1988
In this chapter we shall define a class of rewriting systems called context-free grammars. The left-hand side of a rule in a context-free grammar consists of a single symbol, so that symbols are rewritten “context-freely”. Context-free grammars are of central importance to us because they define the class of context-free languages, the parsing of which is the subject of this book. In this chapter we shall consider some structural properties of context-free grammars which are of importance in parsing. Also, a basic method for recognizing context-free languages will be given.
Elements of Language Theory
1988
In this chapter we shall review the mathematical and computer science background on which the presentation in this book is based. We shall discuss the elements of discrete mathematics and formal language theory, emphasizing those issues that are of importance from the point of view of context-free parsing. We shall devote a considerable part of this chapter to matters such as random access machines and computational complexity. These will be relevant later when we derive efficient algorithms for parsing theoretic problems or prove lower bounds for the complexity of these problems. In this chapter we shall also discuss a general class of formal language descriptors called “rewriting systems”…
LR(k) Parsing
1990
In this chapter we shall generalize the notion of strong LL(k) parsing presented in Chapter 5 and consider a method for deterministic left parsing that applies to a slightly wider class of context-free grammars than does the strong LL(k) parsing method. This method will be called “canonical LL(k) parsing”. As in strong LL(k) parsing, the acronym “LL(k)” means that the input string is parsed (1) in a single Left-to-right scan, (2) producing a Left parse, and (3) using lookahead of length k.