Add to ORKGContains fulltext : 74806.pdf (author's version ) (Open Access)The value of the computational approach in the cognitive sciences lays both in the need to formalize theories such that they can be implemented as computer programs and in the subsequent ease of experimenting with these programs. In this paper I hope to show that, the cleaner a programming style is used, the more these benefits will be present. As an example, the musical parser designed and described by Longuet-Higgins is re-implemented in a clean functional programming style in LISP. This yields a, so called, micro version that makes the theoretical issues that the original program was supposed to illustrate, stand out much more clearly
This article describes FPG, a functional parser generator. It is functional both in the sense that i...
Abstract. A parser is a program that checks if a text is a sentence of the language as described by ...
A parser is an algorithm that computes a structure for an input string given a grammar. All parsers ...
The value of the computational approach in the cognitive sciences lays both in the need to formalize...
Parsing is the process of analysing an input string in order to extract a structured representation ...
Parsers – programs that extract structure from strings – are fundamental components of many software...
Parser design lags behind linguistic theory. While modern transformational grammar has largely aba...
and high level sources of knowledge (concepts). The function of the parser is to produce a segmentat...
Parsing technology is concerned with the automatic decomposition of complex structures into their co...
In this paper, we discuss how recent theoretical linguistic research focusing on the Minimalist Prog...
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both lo...
This 320-page book treats parsing in its own right, in greater depth than is found in most computer ...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
In the constructive programming community it is commonplace to see formal developments of textbook a...
Parsing models have many applications in AI, ranging from natural language processing (NLP) and comp...
This article describes FPG, a functional parser generator. It is functional both in the sense that i...
Abstract. A parser is a program that checks if a text is a sentence of the language as described by ...
A parser is an algorithm that computes a structure for an input string given a grammar. All parsers ...
The value of the computational approach in the cognitive sciences lays both in the need to formalize...
Parsing is the process of analysing an input string in order to extract a structured representation ...
Parsers – programs that extract structure from strings – are fundamental components of many software...
Parser design lags behind linguistic theory. While modern transformational grammar has largely aba...
and high level sources of knowledge (concepts). The function of the parser is to produce a segmentat...
Parsing technology is concerned with the automatic decomposition of complex structures into their co...
In this paper, we discuss how recent theoretical linguistic research focusing on the Minimalist Prog...
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both lo...
This 320-page book treats parsing in its own right, in greater depth than is found in most computer ...
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, an...
In the constructive programming community it is commonplace to see formal developments of textbook a...
Parsing models have many applications in AI, ranging from natural language processing (NLP) and comp...
This article describes FPG, a functional parser generator. It is functional both in the sense that i...
Abstract. A parser is a program that checks if a text is a sentence of the language as described by ...
A parser is an algorithm that computes a structure for an input string given a grammar. All parsers ...