FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W55463712> ?p ?o ?g. }

• W55463712 abstract "This paper a t tempts to clarify two distinct notions of reversibility: (i) Uniformity of implementation of parsing and generation, and (it) reversibility as an inherent (or intrinsic) property of grammars. On the one hand, we explain why grammars specified as definite programs (or the various related grammars) lead to uniformity of implementation. On the other hand, we define different intrinsic reversibility properties for such g rammars the most important being finite reversibility, which says that both parsing and generation are finitely enumerable (see t e x t ) and give examples and counter-examples of grammars which possess or do not possess these intrinsic properties. We also show that , under a certain moderation condition on linguistic description, finite enumerability of parsing is equivalent to finite enumerability of generation. 1 I n t r o d u c t i o n From the linguist's point of view, a grammar is a formal device which defines a recursively enumerable set of well-formed linguistic structures, each having, among other aspects, a phonological content (or, when dealing with writ ten text, a string content) and a semantic content. Such a device is completely neutral as regards its uses for parsing (recovering semantic content from string content) or generation (recovering string content from semantic content). From the computat ional linguist's point of view, on the other hand, the problem is how to implement such a grammar both as a parsing program and as a generation program, in such a way that these programs exactly reflect the content of the grammar. This we will call the reversibility problem. Let us assume, for specificity, tha t the grammar has been presented as a definite program (a Prolog program)J Then the reversibility problem has a simple solution: use a complete interpreter for definite programs--for instance a top-down interpreter having a breadth-first search procedure2--and directly use the grammar as the program both for parsing and for generation. In the parsing mode, for any given string x, the program will enumerate all semantics Yl,Y2, . . . assigned to it by the grammar, and similarly, in the generation mode, for any given semantics y, the program will enumerate all semantics xl , x 2 , . . , assigned to it by the grammar. This is a striking property of definite programs: they are reversible in the sense that they naturally lead to uniformity of implementation of the parsing and generation modes (see §4). So the reversibility problem is solved, and we can spend the next few years skimming through Fodor's (not Jerry 's) guides in travel bookstores? Not quite. First, the s tandard depth-first interpreter for definite programs is an incomplete one, and this problem must be circumvented in some way. Second, and more crucially, even when using a complete interpreter, parsing (and similarly generation) does not in general terminate: the program may well enumerate Yl,Y2, . . . ad infinitum. This is even true if, in fact, there are only a finite number of solutions Yl ,Y2, . . . , Yk, or even, in the extreme case, no solution at all: the program may not be aware that it has at some point already exhausted all the solutions that it will eventually 1We could have made s o m e o t h e r choice, for instance s o m e unification grammar formalism. The advantage of using definite programs in t h e p r e s e n t discussion is that they embody the whole unification paradigm in its purest form, that unification of terms is conceptually simpler (and less p r o n e to misunderstandings) than unification of DAGs, and that the denotational and operational semantics of definite programs have been thoroughly studied. 2See e.g. [7, p. 59] and section §2.1.3. See also [19] in this volume for a related approach." @default.
• W55463712 created "2016-06-24" @default.
• W55463712 creator A5059468860 @default.
• W55463712 date "1991-01-01" @default.
• W55463712 modified "2023-09-25" @default.
• W55463712 title "Inherently Reversible Grammars, Logic Programming and Computability" @default.
• W55463712 cites W1507382776 @default.
• W55463712 cites W1526292255 @default.
• W55463712 cites W1541434994 @default.
• W55463712 cites W1655990431 @default.
• W55463712 cites W1969283967 @default.
• W55463712 cites W1996360405 @default.
• W55463712 cites W2000217878 @default.
• W55463712 cites W2027592826 @default.
• W55463712 cites W2107298945 @default.
• W55463712 cites W2126182679 @default.
• W55463712 cites W2131504185 @default.
• W55463712 cites W2140194681 @default.
• W55463712 cites W2157902310 @default.
• W55463712 cites W2161021345 @default.
• W55463712 hasPublicationYear "1991" @default.
• W55463712 type Work @default.
• W55463712 sameAs 55463712 @default.
• W55463712 citedByCount "11" @default.
• W55463712 countsByYear W554637122015 @default.
• W55463712 crossrefType "journal-article" @default.
• W55463712 hasAuthorship W55463712A5059468860 @default.
• W55463712 hasConcept C11413529 @default.
• W55463712 hasConcept C134083981 @default.
• W55463712 hasConcept C134306372 @default.
• W55463712 hasConcept C138885662 @default.
• W55463712 hasConcept C147547768 @default.
• W55463712 hasConcept C154945302 @default.
• W55463712 hasConcept C157486923 @default.
• W55463712 hasConcept C186644900 @default.
• W55463712 hasConcept C199360897 @default.
• W55463712 hasConcept C203702658 @default.
• W55463712 hasConcept C204321447 @default.
• W55463712 hasConcept C26022165 @default.
• W55463712 hasConcept C2778152352 @default.
• W55463712 hasConcept C33923547 @default.
• W55463712 hasConcept C37914503 @default.
• W55463712 hasConcept C41008148 @default.
• W55463712 hasConcept C41895202 @default.
• W55463712 hasConcept C53893814 @default.
• W55463712 hasConcept C67621940 @default.
• W55463712 hasConcept C97212296 @default.
• W55463712 hasConceptScore W55463712C11413529 @default.
• W55463712 hasConceptScore W55463712C134083981 @default.
• W55463712 hasConceptScore W55463712C134306372 @default.
• W55463712 hasConceptScore W55463712C138885662 @default.
• W55463712 hasConceptScore W55463712C147547768 @default.
• W55463712 hasConceptScore W55463712C154945302 @default.
• W55463712 hasConceptScore W55463712C157486923 @default.
• W55463712 hasConceptScore W55463712C186644900 @default.
• W55463712 hasConceptScore W55463712C199360897 @default.
• W55463712 hasConceptScore W55463712C203702658 @default.
• W55463712 hasConceptScore W55463712C204321447 @default.
• W55463712 hasConceptScore W55463712C26022165 @default.
• W55463712 hasConceptScore W55463712C2778152352 @default.
• W55463712 hasConceptScore W55463712C33923547 @default.
• W55463712 hasConceptScore W55463712C37914503 @default.
• W55463712 hasConceptScore W55463712C41008148 @default.
• W55463712 hasConceptScore W55463712C41895202 @default.
• W55463712 hasConceptScore W55463712C53893814 @default.
• W55463712 hasConceptScore W55463712C67621940 @default.
• W55463712 hasConceptScore W55463712C97212296 @default.
• W55463712 hasLocation W554637121 @default.
• W55463712 hasOpenAccess W55463712 @default.
• W55463712 hasPrimaryLocation W554637121 @default.
• W55463712 hasRelatedWork W1512767 @default.
• W55463712 hasRelatedWork W1526292255 @default.
• W55463712 hasRelatedWork W1548630441 @default.
• W55463712 hasRelatedWork W1554357161 @default.
• W55463712 hasRelatedWork W1563640839 @default.
• W55463712 hasRelatedWork W1564303565 @default.
• W55463712 hasRelatedWork W1572831335 @default.
• W55463712 hasRelatedWork W1580003217 @default.
• W55463712 hasRelatedWork W1596939801 @default.
• W55463712 hasRelatedWork W1709097247 @default.
• W55463712 hasRelatedWork W1793660669 @default.
• W55463712 hasRelatedWork W1969965298 @default.
• W55463712 hasRelatedWork W2038248725 @default.
• W55463712 hasRelatedWork W203959070 @default.
• W55463712 hasRelatedWork W2107298945 @default.
• W55463712 hasRelatedWork W2488441460 @default.
• W55463712 hasRelatedWork W51453473 @default.
• W55463712 hasRelatedWork W82600474 @default.
• W55463712 hasRelatedWork W86183852 @default.
• W55463712 hasRelatedWork W103809722 @default.
• W55463712 isParatext "false" @default.
• W55463712 isRetracted "false" @default.
• W55463712 magId "55463712" @default.
• W55463712 workType "article" @default.