scispace - formally typeset
Search or ask a question
Topic

Formal language

About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.


Papers
More filters
Book ChapterDOI
TL;DR: A framework to explicitly document and manage the variation points and their corresponding variants of a variable modeling language enables the systematic study of various kinds of variabilities and their interdependencies.
Abstract: We present a taxonomy of the variability mechanisms offered by modeling languages. The definition of a formal language encompasses a syntax and a semantic domain as well as the mapping that relates them, thus language variabilities are classified according to which of those three pillars they address. This work furthermore proposes a framework to explicitly document and manage the variation points and their corresponding variants of a variable modeling language. The framework enables the systematic study of various kinds of variabilities and their interdependencies. Moreover, it allows a methodical customization of a language, for example, to a given application domain. The taxonomy of variability is explicitly of interest for the UML to provide a more precise understanding of its variation points.

39 citations

Proceedings ArticleDOI
Hermann Ney1
06 Apr 1987
TL;DR: A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar that can be viewed as a probabilistic extension of the CYK algorithm along with the incorporation of the nonlineer time alignment is presented.
Abstract: This paper deels with the use of context-free grammars in automatic speech recognition. A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar is presented. The algorithm can be viewed as a probabilistic extension of the CYK algorithm along with the incorporation of the nonlineer time alignment. Details of the implementation and experimental tests are described.

39 citations

01 Jan 1987
TL;DR: This work contrasts this conception of what it means for a machine to know a proposition with another, the situated-automata approach, which seeks to analyze knowledge in terms of relations between the state of a machine and thestate of its environment over time using logic as a metalanguage in which the analysis is carried out.
Abstract: Although the concept ofknowledge plays a central role in artificial intelligence, the theoretical foundations of knowledge representation currently rest on a very limited conception of what it means for a machine to know a proposition. In the current view, the machine is regarded as knowing a fact if its state either explicitly encodes the fact as a sentence of an interpreted formal language or if such a sentence can be derived from other encoded sentences according to the rules of an appropriate logical system. We contrast this conception, the interpreted-symbolic-structure approach, with another, the situated-automata approach, which seeks to analyze knowledge in terms of relations between the state of a machine and the state of its environment over time using logic as a metalanguage in which the analysis is carried out.

39 citations

Journal ArticleDOI
01 Dec 1987
TL;DR: A constructive method for the inference of regular grammars from positive sample strings of language using skeletal structure descriptions, is proposed, and polynomial-time algorithms based on the method are presented.
Abstract: A constructive method for the inference of regular grammars from positive sample strings of language using skeletal structure descriptions, is proposed, and polynomial-time algorithms based on the method are presented. The algorithms infer in the limit a class of regular languages, designated as terminal distinguishable regular languages. They do not overgeneralize if the samples are from a certain class of context-free languages capturing one of these basic results in formal language theory. The algorithms are adaptable for online inference. A measure of goodness for constructive methods for the problem of grammatical inference is introduced. Several examples are given to show the working and behavior of the algorithms.

39 citations

Journal ArticleDOI
01 Sep 1984-Noûs
TL;DR: The role of intuition in mathematics has been discussed in this article from a somewhat special point of view, based on some rather strong views that were advanced by another philosopher, Husserl, who did not develop anything specifically be called a theory of mathematical intuition, but he did attempt to give a general theory of intuition which should have application in different domains of knowledge.
Abstract: In this paper I shall discuss the role of the concept of intuition in mathematics from a somewhat special point of view. Much of the interest in the notion has derived from its place in Hilbert's program for the foundation of mathematics and, more recently, from some of Godel's views on the subject.1 However, I shall orient my discussion around some rather strong views that were advanced by another philosopher, Husserl. Husserl did not develop anything that could specifically be called a theory of mathematical intuition, but he did attempt to give a general theory of intuition which should have application in different domains of knowledge. In particular, in the Sixth Investigation of the Logical Investigations, and in Part II of Formal and Transcendental Logic, Husserl attempted to give an account of intuition (Anschauung) suitable to the kinds of abstract objects which are typical to mathematics and logic. For the most part, Husserl's investigations are concerned with what might be thought of as necessary, but not sufficient, conditions for mathematical knowledge, such as are provided by elementary observations on the grammar of formal languages, and on the consistency and "definiteness" of axiom systems.2 On the specific question of what constitutes evidence (Evidenz) for mathematical objects, or what it means to intuit or have "representing content" for mathematical objects, Husserl's own observations leave much to be desired. The problem is most acute in the case of the kinds of abstract objects for which it is not thought to be possible to find concrete, space-time instances. The situation is exacerbated by the fact that Husserl did not attempt to keep abreast of developments in the foundations of mathematics, so that his works on logic are not as well-informed as they might be. Husserl nonetheless did claim that there was intuition of abstract objects, that the evidence for objects of intuition could come in different degrees, with "apodicticity" and "adequacy" giving a maximal measure on evidence,

39 citations


Network Information
Related Topics (5)
Data structure
28.1K papers, 608.6K citations
87% related
Time complexity
36K papers, 879.5K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Semantics
24.9K papers, 653K citations
85% related
Component-based software engineering
24.2K papers, 461.9K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202237
2021113
2020175
2019173
2018142