Sciweavers

770 search results - page 44 / 154
» Subsequence similarity language models
Sort
View
TNN
1998
125views more  TNN 1998»
14 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
BPM
2010
Springer
191views Business» more  BPM 2010»
14 years 11 months ago
Correctness Ensuring Process Configuration: An Approach Based on Partner Synthesis
Abstract. A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is sub...
Wil M. P. van der Aalst, Niels Lohmann, Marcello L...
AAAI
2000
14 years 11 months ago
The Systems Engineering Process Activities (SEPA) Methodology and Tool Suite
or cone, abstraction is chosen to represent a spectrum of user inputs/requirements that are narrowed, refined, and structured into a system design. User inputs require refinement f...
K. Suzanne Barber, Thomas J. Graser, Paul Grisham,...
EMNLP
2008
14 years 11 months ago
Mention Detection Crossing the Language Barrier
While significant effort has been put into annotating linguistic resources for several languages, there are still many left that have only small amounts of such resources. This p...
Imed Zitouni, Radu Florian
ECCC
2008
117views more  ECCC 2008»
14 years 10 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...