122 search results - page 10 / 25 » grammars 2000 |
112
click to vote
FLAIRS
2000
15 years 5 months ago
2000
This paper presents a model for representing the pro ciency of users in a CALL system by recording their performance on speci c grammatical features. The model will be used both t...
157
click to vote
ICGI
2000
Springer
15 years 8 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
114
click to vote
ACL
2000
15 years 5 months ago
2000
As an application of NLP to computer-assisted language learning(CALL) , we propose a diagnostic processing of Japanese being able to detect errors and inappropriateness of sentenc...
155
click to vote
ACTA
2000
15 years 4 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
142
click to vote
UAI
2000
15 years 5 months ago
2000
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...