482 search results - page 54 / 97 » Structural Equations in Language Learning |
ISMIS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we adapt a statistical learning approach, inspired by automated topic segmentation techniques in speech-recognized documents to the challenging protein segmentation ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
EMNLP
2010
13 years 5 months ago
2010
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
DEXAW
2007
IEEE
14 years 2 months ago
2007
IEEE
Question Answering (QA) systems automatically answer natural language questions in a human-like manner. One of the practical approaches to open domain QA consists in extracting fa...
ISMB
1993
13 years 9 months ago
1993
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...