DE eng

Search in the Catalogues and Directories

Hits 1 – 12 of 12

1
The AMITIÉS system : data-driven techniques for automated dialogue
In: Speech communication. - Amsterdam [u.a.] : Elsevier 48 (2006) 3-4, 354-373
BLLDB
OLC Linguistik
Show details
2
Constraining user response via multimodal dialog interface
In: International journal of speech technology. - Boston, Mass. [u.a.] : Kluwer Acad. Publ. 7 (2004) 4, 251-258
BLLDB
OLC Linguistik
Show details
3
Mouse selection versus voice selection of menu items
In: International journal of speech technology. - Boston, Mass. [u.a.] : Kluwer Acad. Publ. 5 (2002) 4, 389-402
BLLDB
Show details
4
Mouse Selection Versus Voice Selection of Menu Items
In: International journal of speech technology. - Boston, Mass. [u.a.] : Kluwer Acad. Publ. 5 (2002) 4, 389
OLC Linguistik
Show details
5
Computing with words
Hadj-Ali, Allel (Mitarb.); Juliano, Benjoe A. (Mitarb.); Gim, Gwangyong (Mitarb.). - New York [u.a.] : Wiley, 2001
BLLDB
UB Frankfurt Linguistik
Show details
6
A Measure of Semantic Complexity for Natural Language Systems
In: DTIC (2000)
BASE
Show details
7
An Architecture for Voice Dialogue Systems Based on Prolog-Style Theorem Proving
In: Computational linguistics. - Cambridge, Mass. : MIT Press 21 (1995) 3, 281-320
OLC Linguistik
Show details
8
An architecture for voice dialog systems based on prolog-style theorem proving
In: Computational linguistics. - Cambridge, Mass. : MIT Press 21 (1995) 3, 281-320
BLLDB
Show details
9
Dialogue Theory for Virtual Environments.
In: DTIC AND NTIS (1995)
BASE
Show details
10
The correction of ill-formed input using history-based expectation with applications to speech understanding
In: Computational linguistics. - Cambridge, Mass. : MIT Press 12 (1986) 1, 13-36
BLLDB
Show details
11
A production rule mechanism for generating lisp code
Smith, Douglas R,; Biermann, Alan W.. - Durham : Duke University, 1977
IDS Mannheim
Show details
12
ON THE SYNTHESIS OF FINITE-STATE ACCEPTORS
In: DTIC AND NTIS (1970)
Abstract: Two algorithms are presented for solving the following problem: given a finite-set S of strings of symbols, find a finite-state machine which will accept the strings of S and possibly some additional strings which 'resemble' those of S. The approach used is to directly construct the states and transitions of the acceptor machine from the string information. The algorithms include a parameter which enable one to increase the exactness of the resulting machine's behavior as much as desired by increasing the number of states in the machine. The properties of the algorithms are presented and illustrated with a number of examples. The paper gives a method for identifying a finite-state language from a randomly chosen finite subset of the language if the subset is large enough and if a bound is known on the number of states required to recognize the language. Finally, some of the uses of the algorithms and their relationship to the problem of grammatical inference are discussed. ; Report on Stanford Artificial Intelligence Project.
Keyword: *AUTOMATA; *COMPUTERS; ALGORITHMS; Bionics; COMPUTATIONAL LINGUISTICS; Computer Hardware; FINITE STATE ACCEPTORS; GRAMMARS; MAPPING(TRANSFORMATIONS); MATHEMATICAL MODELS; SET THEORY; SYNTHESIS; THEOREMS
URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0708080
http://www.dtic.mil/docs/citations/AD0708080
BASE
Hide details

Catalogues
1
1
4
0
0
0
0
Bibliographies
6
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
3
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern