There has been little work on computational grammars for Amharic or other Ethio-Semitic languages and their use for parsing and generation. This paper introduces a grammar for a fragment of Amharic within the Extensible Dependency Grammar (XDG) framework of Debusmann. A language such as Amharic presents special challenges for the design of a dependency grammar because of the complex morphology ...

Charles J. Fillmore died at his home in San Francisco on February 13, 2014, of brain cancer. He was 84 years old. Fillmore was one of the world’s pre-eminent scholars of lexical meaning and its relationship with context, grammar, corpora, and computation, and his work had an enormous impact on computational linguistics. His early theoretical work in the 1960s, 1970s, and 1980s on case grammar a...

The title of this book, Categorial Grammar: Logical Syntax, Semantics, and Processing, indicates that this will be a book about categorial grammar. In the preface, however, several strains of categorial grammar are discussed, including combinatory categorial grammar (Steedman 2000), pregroup grammar (Lambek 1999), and abstract categorial grammar (de Groote 2001), and it is clarified that the bo...

We have constructed a web-based framework for collaborative multilingual grammar and treebank development in which developers are distributed around the world. It is important for developers of the world-wide collaboration to i) grasp and share the big picture of the grammar and treebank of each language and ii) understand commonalities of languages. Our framework, the Lextype DB, describes lex...

Grammar binarization is the process and result of transforming a grammar to an equivalent form whose rules contain at most two symbols in their right-hand side. Binarization is used, explicitly or implicity, by a wide range of parsers for contextfree grammars and other grammatical formalisms. Non-trivial grammars can be binarized in multiple ways, but in order to optimize the parser’s computati...

Tree Adjunct Grammar for RNA (TAG 2 RNA ) is a new grammatical device to model RNA secondary structures including pseudoknots. An e cient parsing algorithm for this grammar is developed, and applied to some computational problems concerning RNA secondary structures. With this parser, we rst try to predict secondary structures of RNA sequences which are known to form pseudoknots structures, and ...

Hindi and Urdu share a grammar and a basic vocabulary, but are often mutually unintelligible because they use different words in higher registers and sometimes even in quite ordinary situations. We report computational translation evidence of this unusual relationship (it differs from the usual pattern, that related languages share the advanced vocabulary and differ in the basics). We took a GF...

Algebraic graph transformations visually support intuition, have a strong theoretical basis, and provide a formal, implementation independent basis for the description of discretely evolving computational systems and their formal and tractable analysis. Graph grammar models of concurrent systems (petri nets, actor systems) have inspired corresponding semantics developments. Recently this led to...

the present study investigated comparatively the impact of two types of input enhancement (i.e. textual vs. compound enhancement) on developing grammar ability in iranian efl setting. sixty-five female secondary high school students were selected as a homogenous sample out of about a 100-member population based on nelson language proficiency test. then, their grammar ability was measured based ...