Name
Abstract | ||
|---|---|---|
A text is a triplet=(?,?1,?2) such that ? is a labeling function, and?1 and?2 are linear orders on the domain of ?; hence t may be seen as a word (?,?1) together with an additional linear order?2 on the domain of ?. The order?2 is used to give to the word (?,?1) itsindividual hierarchical representation (syntactic structure) which may be a tree but it may be also more general than a tree. In this paper we introducecontext-free grammars for texts and investigate their basic properties. Since each text has its own individual structure, the role of such a grammar should be that of a definition of a pattern common to all individual texts. This leads to the notion of ashapely context-free text grammar also investigated in this paper. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01192159 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Information theory,Rule-based machine translation,Discrete mathematics,Data structure,Context-free language,Combinatorics,Context-free grammar,Regular tree grammar,Grammar,Philosophy of language,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 2 | 0001-5903 |
Citations | PageRank | References |
5 | 0.50 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| P. ten Pas | 2 | 13 | 1.81 |
| G. Rozenberg | 3 | 39 | 3.39 |