In this lab, we'll write our own Context-Free Grammar (CFG) to provide a parser with rules for how sentences can be parsed. We'll also explore how we can easily obtain Part-of-Speech (POS) Tags using ...

This grammar will be based on Romanian, the language spoken in Romania of eastern Europe. Romanian is quite like English in that it uses the SVO (subject-verb-object) order of words, and even more ...

Abstract: A method using nonrecursive context-free grammars is presented for the recognition of isolated words. Some form of 'training' is required to combat problems of variations in speech. In the ...

Abstract: To exchange complex data structures in distributed systems, documents written in context-free languages are exchanged among communicating parties. Unparsing these documents correctly is as ...

An algorithm for analyzing any context-free phrase structure grammar and for generating a program which can then parse any sentence in the language (or indicate that the given sentence is invalid) is ...

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these ...

In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we ...