Sciweavers

3818 search results - page 109 / 764
» Word Problems on Compressed Words
Sort
View
ANLP
1994
72views more  ANLP 1994»
15 years 6 months ago
Tagging accurately - Don't guess if you know
We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text ...
Pasi Tapanainen, Atro Voutilainen
131
Voted
IJNSEC
2007
89views more  IJNSEC 2007»
15 years 4 months ago
Vulnerabilities in the Adachi-Aoki-Komano-Ohta Micropayment Scheme
Rivest and Shamir presented two simple micropayment schemes, “PayWord” and “MicroMint,” for making small purchases over the Internet [14]. Recently, Adachi et al. have poi...
Minho Kim, Çetin Kaya Koç
133
Voted
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
15 years 4 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
133
Voted
NAACL
2010
15 years 2 months ago
Probabilistic Frame-Semantic Parsing
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
Dipanjan Das, Nathan Schneider, Desai Chen, Noah A...
144
Voted
ACL
2009
15 years 2 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta