212 search results - page 23 / 43 » Second-Order Simple Grammars |
157
click to vote
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
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. ...
172
click to vote
EMNLP
2004
15 years 7 months ago
2004
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
145
click to vote
COLING
1996
15 years 7 months ago
1996
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...
156
click to vote
COLING
1990
15 years 7 months ago
1990
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...
189
click to vote
IEAAIE
2010
Springer
15 years 3 months ago
2010
Springer
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...