Sciweavers

212 search results - page 23 / 43
» Second-Order Simple Grammars
Sort
View
DEXA
2007
Springer
126views Database» more  DEXA 2007»
15 years 1 months ago
Compiling Declarative Specifications of Parsing Algorithms
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
Carlos Gómez-Rodríguez, Jesús...
EMNLP
2004
14 years 11 months ago
Bilingual Parsing with Factored Estimation: Using English to Parse Korean
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
David A. Smith, Noah A. Smith
COLING
1996
14 years 11 months ago
Dealing with Cross-Sentential Anaphora Resolution in ALEP
The experiments described here have been done in connection with the LS-GRAM project, which is concerned with the development of large scale grammars and thus foreseen the coverag...
Thierry Declerck
COLING
1990
14 years 11 months ago
A Logic-Based Government-Binding Parser for Mandarin Chinese
Mandarin Chinese is a highly flexible and context-sensitive language. It is difficult to do the case marking and index assignment during the parsing of Chinese sentences. This pap...
Hsin-Hsi Chen
IEAAIE
2010
Springer
14 years 7 months ago
Web Usage Mining for Improving Students Performance in Learning Management Systems
An innovative technique based on multi-objective grammar guided genetic programming (MOG3P-MI) is proposed to detect the most relevant activities that a student needs to pass a cou...
Amelia Zafra, Sebastián Ventura