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
Proceedings Article
11 Jul 2010
TL;DR: The Topic-Aspect Model is presented, a Bayesian mixture model which jointly discovers topics and aspects and can generate token assignments in both of these dimensions, rather than assuming words come from only one of two orthogonal models.
Abstract: This paper presents the Topic-Aspect Model (TAM), a Bayesian mixture model which jointly discovers topics and aspects. We broadly define an aspect of a document as a characteristic that spans the document, such as an underlying theme or perspective. Unlike previous models which cluster words by topic or aspect, our model can generate token assignments in both of these dimensions, rather than assuming words come from only one of two orthogonal models. We present two applications of the model. First, we model a corpus of computational linguistics abstracts, and find that the scientific topics identified in the data tend to include both a computational aspect and a linguistic aspect. For example, the computational aspect of GRAMMAR emphasizes parsing, whereas the linguistic aspect focuses on formal languages. Secondly, we show that the model can capture different viewpoints on a variety of topics in a corpus of editorials about the Israeli-Palestinian conflict. We show both qualitative and quantitative improvements in TAM over two other state-of-the-art topic models.

128 citations

Journal ArticleDOI
TL;DR: A class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language are proposed and it is shown that the time needed grows only linearly with the size of the sample set.
Abstract: In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language. It is shown that the time needed grows only linearly with the size of the sample set and a measure of the complexity of the task is provided. Experimentally, our implementation proves very fast for application purposes.

127 citations

Proceedings ArticleDOI
27 May 1993
TL;DR: This paper describes the application of formal concept analysis to the representation of relationships among word senses and the relationships among the nodes which form the Concept lattice.
Abstract: This paper describes the application of formal concept analysis to the representation of relationships among word senses. The word "concept" is used as an exemplary case for three different formal contexts and their concept lattices. Formal contexts comprise both objects and attributes, explicitly indicating which objects share which attributes and which attributes share which objects. This information is then used to identify the concept nodes (for which there may or may not be a word ['label']) and the relationships among the nodes which form the Concept lattice. >

127 citations

Proceedings ArticleDOI
22 Jul 2002
TL;DR: A number of new results related to the complexity of such languages over so-called axis relations (such as "child" or "descendant") which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping) are provided.
Abstract: Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new results related to the complexity of such languages over so-called axis relations (such as "child" or "descendant") which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping).

127 citations

Journal ArticleDOI
TL;DR: Despite their simplicity, it is shown how the latter networks might be used for solving an NP-complete problem, namely the “3-colorability problem”, in linear time and linear resources (nodes, symbols, rules).
Abstract: In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters are defined by random context conditions, we obtain an incomparability result with the families of regular and context-free languages. Despite their simplicity, we show how the latter networks might be used for solving an NP-complete problem, namely the “3-colorability problem”, in linear time and linear resources (nodes, symbols, rules).

126 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