2467 search results - page 62 / 494 » Finite State Machines |
98
Voted
ACL
1998
15 years 1 months ago
1998
We present a method for constructing, maintaining and consulting a database of proper nouns. We describe noun phrases composed of a proper noun and/or a description of a human occ...
76
Voted
CAI
2005
Springer
15 years 14 days ago
2005
Springer
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
116
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
90
Voted
CICLING
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
117
Voted
IAT
2003
IEEE
15 years 5 months ago
2003
IEEE
This research is about automatic identification and extraction of person names in Chinese text documents. Solutions to this problem have immediate and extensive applications in ma...