341 search results - page 18 / 69 » Formal Grammars of Early Language |
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
Children need to master reading letter-names and lettersounds before reading phrases and sentences. Pronunciation assessment of letter-names and letter-sounds read aloud is an imp...
106
click to vote
ICGI
2000
Springer
15 years 2 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...
ACL
2000
15 years 11 days 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...
ICGI
2010
Springer
14 years 8 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
76
Voted
LDTA
2010
14 years 11 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...