2474 search results - page 165 / 495 » Learning Languages in a Union |
110
click to vote
ACL
1998
15 years 5 months ago
1998
Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" int...
233
click to vote
NAACL
2010
15 years 1 months ago
2010
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
124
click to vote
TCS
2010
15 years 2 months ago
2010
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model co...
131
click to vote
JALC
2007
15 years 3 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
135
Voted
ACL
1998
15 years 5 months ago
1998
In this paper, we report on an effort to provide a general-purpose spoken language generation tool for Concept-to-Speech (CTS) applications by extending a widely used text generat...