Sciweavers

129 search results - page 9 / 26
» Towards Discontinuous Grammar
Sort
View
SOFSEM
2000
Springer
13 years 11 months ago
Towards High Speed Grammar Induction on Large Text Corpora
Abstract. In this paper we describe an e cient and scalable implementation for grammar induction based on the EMILE approach ( 2], 3], 4], 5], 6]). The current EMILE 4.1 implementa...
Pieter W. Adriaans, Marten Trautwein, Marco Vervoo...
NAACL
2010
13 years 5 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
CSMR
2003
IEEE
14 years 24 days ago
Towards Automatical Migration of Transformation Rules after Grammar Extension
The paper addresses two problems in software maintenance. Firstly, some maintenance tasks require modifications of the grammar. A change in a grammar can make syntax and transfor...
Wolfgang Lohmann, Günter Riedewald
JOLLI
2007
88views more  JOLLI 2007»
13 years 7 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
ACL
1993
13 years 8 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...