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
Journal ArticleDOI
TL;DR: The maximum-likelihood criterion and the minimum-distance criterion are proposed for the classification of noisy strings described by context-free grammars and classification algorithms based on a modified Cocke-Younger-Kasami parsing scheme are presented.
Abstract: A model of noise deformation of the substitution type is adopted for linguistic patterns generated by formal grammars. The maximum-likelihood criterion and the minimum-distance criterion are proposed for the classification of noisy strings described by context-free grammars. Classification algorithms based on a modified Cocke-Younger-Kasami parsing scheme are presented.

61 citations

Proceedings ArticleDOI
03 Nov 1993
TL;DR: It is proved in a constructive way that a non empty set of solutions always contains a regular solution, that is a tuple of regular tree languages.
Abstract: We present a decision procedure, based on tree automata techniques, for satisfiability of systems of set constraints including negated subset relationships. This result extends all previous works on set constraints solving and solves a problem which was left open by L. Bachmair et al. (1993). We prove in a constructive way that a non empty set of solutions always contains a regular solution, that is a tuple of regular tree languages. Moreover, we think that the new class of tree automata described here could be interesting in its own. >

61 citations

Book Chapter
01 Jan 2005
TL;DR: The authors argue that the highly ambiguous character of natural languages is surprising, and that the very existence of ambiguity calls for an explanation, and they argue that ambiguity is not theoretically important, whereas formal languages are unambiguous by design.
Abstract: Montague’s celebrated claim that no “important theoretical difference exists between formal and natural languages” (Montague 1974; 188) implies that ambiguity is not theoretically important, for ambiguity abounds in natural languages, whereas formal languages are unambiguous by design. More generally, the pervasiveness of ambiguity in natural languages seems to be widely regarded as unremarkable. Our objective in this paper is to argue, to the contrary, that the highly ambiguous character of natural languages is surprising, and that the very existence of ambiguity calls for an explanation.

61 citations

Book ChapterDOI
23 Sep 1996
TL;DR: It is shown that, in a formal sense, Old Georgian can be taken to provide an example of a non-semilinear language and that none of the aforementioned grammar formalisms is strong enough to generate this language.
Abstract: Mildly context sensitive grammar formalisms such as multi-component TAGs and linear context free rewrite systems have been introduced to capture the full complexity of natural languages. We show that, in a formal sense, Old Georgian can be taken to provide an example of a non-semilinear language. This implies that none of the aforementioned grammar formalisms is strong enough to generate this language.

61 citations

Journal ArticleDOI
TL;DR: In this paper, the problems related to finding a pattern common to all words in a given set are dealt with, where the authors restrict their attention to patterns expressible by the use of variables ranging over words.
Abstract: The paper deals with the problems related to finding a pattern common to all words in a given set We restrict our attention to patterns expressible by the use of variables ranging over words Two essentially different cases result, depending on whether or not the empty word belongs to the range We investigate equivalence and inclusion problems, patterns descriptive for a set, as well as some complexity issues The inclusion problem between two pattern languages turns out to be of fundamental theoretical importance because many problems in the classical combinatorics of words can be reduced to it

61 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