Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: regular expression

Sortuj według:

Ogranicz wyniki do:

Generating Syntax Diagrams From Regular Expressions

Alchimowicz B., Nawrocki J.

Foundations of Computing and Decision Sciences

2011

Vol. 36, No. 2

81-97

In some web applications there are fields and each field has its syntax. Usually that syntax is described with regular expressions. Programmers use them to instruct computer which input is correct and which is not. If the input is incorrect a user would like to know why it is wrong. One solution could be just to present the regular expression. Unfortunately many users are IT-laymen and they can not read regular expressions. Another solution would be to write a section in a user manual explaining which input is syntactically correct and which is not. Regrettably, that is a time consuming process. Thus, a question arises, if such a description could be generated automatically. The paper presents an experimental system that automatically generates an explanation of a given regular expression. This paper focuses on problem of generating syntax diagrams from regular expressions.

Using regular expressions in translation memories

Gintrowicz J., Jassem K.

Systems Science

2008

Vol. 34, no 4

37-40

The paper presents the idea of using regular expressions in translation systems based on translation memories. Regular expressions (regexps) are used for: search for a match in the input sentence, search for an appropriate example in the translation memory and in the transfer of the input sentence into its equivalent. The application of transfer rules to translation memories supports the thesis, put forward in the paper, that Machine Translation and Computer-Aided Translation converge into the same direction.

Interfacing graphs

Kämpke T.

Machine Graphics and Vision

2000

Vol. 9, No. 4

797-824

Transformations of vertex sequences of regular grid graph into paths of an arbitrary connected graph are facilitated according to various coarsening and approximation operations, including minimum cost alterations and minimum cost re-routings. The sequence transformations are supposed to support issues of man-machine interaction, which implies lack of an ultimate formal design objective. Furthermore, this implies that formal methods and algorithms have to be combined in a pragmatic fashion. For planar graph, the notion of Voronoi regions is modified to graph Voronoi regions which partition the plane according to proximity to verttices and edges simultaneously. The non-planar case is reduced to the planar case by adding all intersection points of vertex connections to the original vertex set and by splitting vertex connections accordingly. This allows grid point sequences to be intermediately transformed to so-called mixed or region sequences which are eventualy transformed to vertex sequences by production rule-like operations. The algorithmic preprocessing burden of partitioning and indexing the euclidean plane via the graph Voronoi regions or approximations thereof is practically larger and typically more complicated than any of the run time computations.