Sciweavers

3270 search results - page 218 / 654
» Approximate String Processing
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 6 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
DAS
2010
Springer
15 years 6 months ago
Analysis and taxonomy of column header categories for web tables
We describe a component of a document analysis system for constructing ontologies for domain-specific web tables imported into Excel. This component automates extraction of the Wa...
Sharad C. Seth, Ramana Chakradhar Jandhyala, Mukka...
EACL
2003
ACL Anthology
15 years 4 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
ICIP
2004
IEEE
16 years 4 months ago
Robust perceptual image hashing using feature points
Perceptual image hashing maps an image to a fixed length binary string based on the image's appearance to the human eye, and has applications in image indexing, authenticatio...
Vishal Monga, Brian L. Evans
IJCNLP
2005
Springer
15 years 8 months ago
Web-Based Terminology Translation Mining
Mining terminology translation from a large amount of Web data can be applied in many fields such as reading/writing assistant, machine translation and cross-language information r...
Gaolin Fang, Hao Yu, Fumihito Nishino